On the complexity of two-dimensional signed majority cellular automata
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2018/02/01
-
Indian UGC (journal)
-
Refrences31
-
Citations8
-
Eric Goles
-
Pedro Montealegre
-
Kévin Perrot
-
Guillaume Theyssier
Cite
Goles, Eric, et al. “On the Complexity of Two-Dimensional Signed Majority Cellular Automata”. Journal of Computer and System Sciences, vol. 91, 2018, pp. 1-32, https://doi.org/10.1016/j.jcss.2017.07.010.
Goles, E., Montealegre, P., Perrot, K., & Theyssier, G. (2018). On the complexity of two-dimensional signed majority cellular automata. Journal of Computer and System Sciences, 91, 1-32. https://doi.org/10.1016/j.jcss.2017.07.010
Goles, Eric, Pedro Montealegre, Kévin Perrot, and Guillaume Theyssier. “On the Complexity of Two-Dimensional Signed Majority Cellular Automata”. Journal of Computer and System Sciences 91 (2018): 1-32. https://doi.org/10.1016/j.jcss.2017.07.010.
Goles E, Montealegre P, Perrot K, Theyssier G. On the complexity of two-dimensional signed majority cellular automata. Journal of Computer and System Sciences. 2018;91:1-32.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| The complexity of the majority rule on planar graphs | Advances in Applied Mathematics |
| 5 | 2015 |
| Four states are enough! | Theoretical Computer Science |
| 13 | 2011 |
| Bulking I: An abstract theory of bulking | Theoretical Computer Science |
| 15 | 2011 |
| Bulking II: Classifications of cellular automata | Theoretical Computer Science |
| 21 | 2011 |
| Planar and Grid Graph Reachability Problems | Theory of Computing Systems |
| 15 | 2009 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| Intrinsic universality in automata networks I: Families and simulations | Theoretical Computer Science |
| 2024 | |
| A majority–minority cellular automata algorithm for global optimization | Expert Systems with Applications |
| 5 | 2022 |
On the Complexity of Stable and Biased Majority | Mathematics |
| 2022 | |
| Freezing sandpiles and Boolean threshold networks: Equivalence and complexity | Advances in Applied Mathematics |
| 3 | 2021 |
| Two-dimensional rotation-symmetric number-conserving cellular automata | Information Sciences |
| 2 | 2021 |
Citations Analysis
The category
Science: Mathematics: Instruments and machines: Electronic computers. Computer science 6
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled School Choice in a Market Environment: Individual versus Social Expectations and was published in 2018. The most recent citation comes from a 2024 study titled Intrinsic universality in automata networks I: Families and simulations. This article reached its peak citation in 2022, with 2 citations. It has been cited in 7 different journals, 28% of which are open access. Among related journals, the Information and Computation cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.