toggle visibility Search & Display Options

Select All    Deselect All
List View
 |   | 
   print
  Author Title Year Publication Volume Pages Links
Bitar, N.; Goles, E.; Montealegre, P. COMPUTATIONAL COMPLEXITY OF BIASED DIFFUSION-LIMITED AGGREGATION 2022 Siam Journal On Discrete Mathematics 36 823-866 details   doi
Gaspers, S.; Liedloff, M.; Stein, M.; Suchan, K. Complexity of splits reconstruction for low-degree trees 2015 Discrete Applied Mathematics 180 89-100 details   pdf doi
Goles, E.; Montealegre, P. Computational complexity of threshold automata networks under different updating schemes 2014 Theoretical Computer Science 559 3-19 details   pdf doi
Goles, E.; Montealegre, P. The complexity of the majority rule on planar graphs 2015 Advances In Applied Mathematics 64 111-123 details   pdf doi
Goles, E.; Montealegre, P. The complexity of the asynchronous prediction of the majority automata 2020 Information and Computation 274 details   doi
Goles, E.; Lobos, F.; Montealegre, P.; Ruivo, ELP.; de Oliveira, PPB. Computational Complexity of the Stability Problem for Elementary Cellular Automata 2020 Journal of Cellular Automata 15 261-304 details   openurl
Goles, E.; Maldonado, D.; Montealecre, P. On the complexity of asynchronous freezing cellular automata 2021 Information and Computation 281 104764 details   doi
Goles, E.; Maldonado, D.; Montealegre, P.; Ollinger, N. On the complexity of the stability problem of binary freezing totalistic cellular automata 2020 Information And Computation 274 21 pp details   doi
Goles, E.; Montealegre, P.; Perrot, K.; Theyssier, G. On the complexity of two-dimensional signed majority cellular automata 2018 Journal Of Computer And System Sciences 91 1-32 details   pdf doi
Select All    Deselect All
List View
 |   | 
   print

Save Citations:
Export Records: