Chao Wang
Orcid: 0000-0002-0073-9791Affiliations:
- Nankai University, Department of Software, Tianjin, China
- Tsinghua University, Beijing, China (2003 - 2005)
- Nankai University, Tianjin, China (PhD 2003)
According to our database1,
Chao Wang
authored at least 20 papers
between 2004 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Two graphs: Resolving the periodic reversibility of one-dimensional finite cellular automata.
Appl. Math. Comput., 2025
2024
Decision algorithms for reversibility of 1D cellular automata under reflective boundary conditions.
Theor. Comput. Sci., 2024
The Computation for Reversibility of Arbitrary One-dimensional Finite Cellular Automata Becomes Efficient.
CoRR, 2024
2023
Patterns Induce Injectivity: A New Thinking in Constructing Injective Local Rules of 1D Cellular Automata over F<sub>2</sub>.
CoRR, 2023
STATE-OF-ART Algorithms for Injectivity and Bounded Surjectivity of One-dimensional Cellular Automata.
CoRR, 2023
2022
Efficient methods with polynomial complexity to determine the reversibility of general 1D linear cellular automata over Zp.
Inf. Sci., 2022
Proceedings of the 26th International Conference on Pattern Recognition, 2022
2020
The <i>r</i>-Hamming gap and distance-gap-preserving mappings from binary vectors to permutations.
Appl. Math. Comput., 2020
Proceedings of the ICRAI 2020: 6th International Conference on Robotics and Artificial Intelligence, 2020
2019
Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity.
CoRR, 2019
2018
2017
2015
Reversibility of general 1D linear cellular automata over the binary field Z<sub>2</sub> under null boundary conditions.
Inf. Sci., 2015
2008
2004
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs.
Electron. Notes Discret. Math., 2004