List View
 |   | 
   web
Author Title Year Publication Volume Pages
Goles, E.; Montealegre, P.; Perrot, K. Freezing sandpiles and Boolean threshold networks: Equivalence and complexity 2021 Advances In Applied Mathematics 125 102161
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
Golovach, P.A.; Heggernes, P.; Lima, P.T.; Montealegre, P. Finding Connected Secluded Subgraphs 2020 12th International Symposium on Parameterized and Exact Computation 89 1-13
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
Golovach, P.A.; Heggernes, P.; Lima, P.T.; Montealegre, P. Finding connected secluded subgraphs 2020 Journal Of Computer And System Sciences 113 101-124
Goles, E.; Montealegre, P.; Rios-Wilson, M. On The Effects Of Firing Memory In The Dynamics Of Conjunctive Networks 2020 Discrete And Continuous Dynamical Systems 40 5765-5793
Bottcher, L.; Montealegre, P.; Goles, E.; Gersbach, H. Competing activists-Political polarization 2020 Physica A-Statistical Mechanics And Its Applications 545 13 pp
Goles, E.; Montealegre, P. The complexity of the asynchronous prediction of the majority automata 2020 Information and Computation 274
Liedloff, M.; Montealegre, P.; Todinca, I. Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques 2019 Algorithmica 81 986-1005
Lobos, F.; Goles, E.; Ruivo, E.L.P.; de Oliveira, P.P.B.; Montealegre, P. Mining a Class of Decision Problems for One-dimensional Cellular Automata 2018 Journal Of Cellular Automata 13 393-405
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
Goles, E.; Montealegre, P.; Vera, J. Naming Game Automata Networks 2016 Journal Of Cellular Automata 11 497-521
Goles, E.; Montealegre, P.; Salo, V.; Torma, I. PSPACE-completeness of majority automata networks 2016 Theoretical Computer Science 609 118-128
Goles, E.; Montealegre, P. The complexity of the majority rule on planar graphs 2015 Advances In Applied Mathematics 64 111-123
Goles, E.; Montealegre, P. Computational complexity of threshold automata networks under different updating schemes 2014 Theoretical Computer Science 559 3-19