| 
Citations
 | 
   web
Becker, F., Montealegre, P., Rapaport, I., & Todinca, I. (2021). The role of randomness in the broadcast congested clique model. Inf. Comput., 281, 104669.
toggle visibility
Bitar, N., Goles, E., & Montealegre, P. (2022). COMPUTATIONAL COMPLEXITY OF BIASED DIFFUSION-LIMITED AGGREGATION. SIAM Discret. Math., 36(1), 823–866.
toggle visibility
Bottcher, L., Montealegre, P., Goles, E., & Gersbach, H. (2020). Competing activists-Political polarization. Physica A, 545, 13 pp.
toggle visibility
Concha-Vega, P., Goles, E., Montealegre, P., & Rios-Wilson, M. (2022). On the Complexity of Stable and Biased Majority. Mathematics, 10(18), 3408.
toggle visibility
Concha-Vega, P., Goles, E., Montealegre, P., Rios-Wilson, M., & Santivanez, J. (2022). Introducing the activity parameter for elementary cellular automata. Int. J. Mod Phys. C, 33(09), 2250121.
toggle visibility
Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., Remila, E., & Todinca, I. (2021). Compact Distributed Certification of Planar Graphs. Algorithmica, 83(7), 2215–2244.
toggle visibility
Goles, E., & Montealegre, P. (2014). Computational complexity of threshold automata networks under different updating schemes. Theor. Comput. Sci., 559, 3–19.
toggle visibility
Goles, E., & Montealegre, P. (2015). The complexity of the majority rule on planar graphs. Adv. Appl. Math., 64, 111–123.
toggle visibility
Goles, E., & Montealegre, P. (2020). The complexity of the asynchronous prediction of the majority automata. Inf. Comput., 274(SI).
toggle visibility
Goles, E., Adamatzky, A., Montealegre, P., & Rios-Wilson, M. (2021). Generating Boolean Functions on Totalistic Automata Networks. Int. J. Unconv. Comput., 16(4), 343–391.
toggle visibility
Goles, E., Lobos, F., Montealegre, P., Ruivo, E. L. P., & de Oliveira, P. P. B. (2020). Computational Complexity of the Stability Problem for Elementary Cellular Automata. J. Cell. Autom., 15(4), 261–304.
toggle visibility
Goles, E., Maldonado, D., Montealegre, P., & Ollinger, N. (2020). On the complexity of the stability problem of binary freezing totalistic cellular automata. Inf. Comput., 274, 21 pp.
toggle visibility
Goles, E., Montalva-Medel, M., Montealegre, P., & Rios-Wilson, M. (2022). On the complexity of generalized Q2R automaton. Adv. Appl. Math., 138, 102355.
toggle visibility
Goles, E., Montealegre, P., & Perrot, K. (2021). Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. Adv. Appl. Math., 125, 102161.
toggle visibility
Goles, E., Montealegre, P., Perrot, K., & Theyssier, G. (2018). On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci., 91, 1–32.
toggle visibility
Goles, E., Montealegre, P., & Rios-Wilson, M. (2020). On The Effects Of Firing Memory In The Dynamics Of Conjunctive Networks. Discret. Contin. Dyn. Syst., 40(10), 5765–5793.
toggle visibility
Goles, E., Montealegre, P., Salo, V., & Torma, I. (2016). PSPACE-completeness of majority automata networks. Theor. Comput. Sci., 609, 118–128.
toggle visibility
Goles, E., Montealegre, P., & Vera, J. (2016). Naming Game Automata Networks. J. Cell. Autom., 11(5-6), 497–521.
toggle visibility
Golovach, P. A., Heggernes, P., Lima, P. T., & Montealegre, P. (2020). Finding connected secluded subgraphs. J. Comput. Syst. Sci., 113, 101–124.
toggle visibility
Golovach, P. A., Heggernes, P., Lima, P. T., & Montealegre, P. (2020). Finding Connected Secluded Subgraphs. In 12th International Symposium on Parameterized and Exact Computation (Vol. 89, pp. 1–13).
toggle visibility