The complexity of the bootstraping percolation and other problems. - Eric Goles Ch.; Pedro Montealegre-Barba; Ioan Todinca (Theor. Comput. Sci., 2013)

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIROCCO, 2014)

Computational complexity of threshold automata networks under different updating schemes. - Eric Goles Ch.; Pedro Montealegre 001 (Theor. Comput. Sci., 2014)

The complexity of the majority rule on planar graphs. - Eric Goles 001; Pedro Montealegre 001 (Adv. Appl. Math., 2015)

A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton. - Eric Goles 001; Pedro Montealegre 001 (ACRI, 2016)

Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. - Pedro Montealegre 001; Ioan Todinca (PODC, 2016)

On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. - Pedro Montealegre 001; Ioan Todinca (WG, 2016)

Deterministic graph connectivity in the broadcast congested clique. - Pedro Montealegre 001; Ioan Todinca (CoRR, 2016)

Naming Game Automata Network. - Eric Goles 001; Pedro Montealegre 001; Javier Vera (J. Cell. Autom., 2016)

PSPACE-completeness of majority automata networks. - Eric Goles 001; Pedro Montealegre 001; Ville Salo; Ilkka Törmä (Theor. Comput. Sci., 2016)

On the Computational Complexity of the Freezing Non-strict Majority Automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre 001; Nicolas Ollinger (AUTOMATA, 2017)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Distributed Subgraph Detection. - Pierre Fraigniaud; Pedro Montealegre 001; Dennis Olivetti; Ivan Rapaport; Ioan Todinca (CoRR, 2017)

Sequential and distributes graph algorithms. Parameterized algorithms via potential maximal cliques; broadcast congested clique. (Algorithmes de graphes séquentiels et distribués. Algorithmes paramétrés via des cliques maximales potentielles ; Modèle de diffusion dans une clique congestionnée). - Pedro Montealegre-Barba (2017)

Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre-Barba; Nicolas Ollinger (ACRI, 2018)

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (LATIN, 2018)

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. - Pedro Montealegre 001; Sebastian Perez-Salazar; Ivan Rapaport; Ioan Todinca (SIROCCO, 2018)

Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. - Fedor V. Fomin; Mathieu Liedloff; Pedro Montealegre 001; Ioan Todinca (Algorithmica, 2018)

A Mining a Class of Decision Problems for One-dimensional Cellular Automata. - Fabiola Lobos; Eric Goles 001; Eurico L. P. Ruivo; Pedro Paulo Balbi de Oliveira; Pedro Montealegre 001 (J. Cell. Autom., 2018)

On the complexity of two-dimensional signed majority cellular automata. - Eric Goles 001; Pedro Montealegre 001; Kévin Perrot; Guillaume Theyssier (J. Comput. Syst. Sci., 2018)

Fixing improper colorings of graphs. - Valentin Garnero; Konstanty Junosza-Szaniawski; Mathieu Liedloff; Pedro Montealegre 001; Pawel Rzazewski (Theor. Comput. Sci., 2018)

On the Effects of Firing Memory in the Dynamics of Conjunctive Networks. - Eric Goles 001; Pedro Montealegre 001; Martín Ríos-Wilson (Automata, 2019)

On Distributed Merlin-Arthur Decision Protocols. - Pierre Fraigniaud; Pedro Montealegre 001; Rotem Oshman; Ivan Rapaport; Ioan Todinca (SIROCCO, 2019)

Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. - Mathieu Liedloff; Pedro Montealegre 001; Ioan Todinca (Algorithmica, 2019)

Computational Complexity of Restricted Diffusion Limited Aggregation. - Nicolas Bitar; Eric Goles 001; Pedro Montealegre 001 (CoRR, 2019)

Shared vs Private Randomness in Distributed Interactive Proofs. - Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (ISAAC, 2020)

The complexity of the asynchronous prediction of the majority automata. - Eric Goles 001; Pedro Montealegre 001 (Inf. Comput., 2020)

On the complexity of the stability problem of binary freezing totalistic cellular automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre 001; Nicolas Ollinger (Inf. Comput., 2020)

Computational Complexity of the Stability Problem for Elementary Cellular Automata. - Eric Goles 001; Fabiola Lobos; Pedro Montealegre 001; Eurico L. P. Ruivo; Pedro P. B. de Oliveira (J. Cell. Autom., 2020)

Finding connected secluded subgraphs. - Petr A. Golovach; Pinar Heggernes; Paloma T. Lima; Pedro Montealegre 001 (J. Comput. Syst. Sci., 2020)

Graph reconstruction in the congested clique. - Pedro Montealegre 001; Sebastian Perez-Salazar; Ivan Rapaport; Ioan Todinca (J. Comput. Syst. Sci., 2020)

The Impact of Locality in the Broadcast Congested Clique Model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIAM J. Discret. Math., 2020)

On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. - Eric Goles 001; Pedro Montealegre 001; Martín Ríos-Wilson; Guillaume Theyssier (CiE, 2021)

Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. - Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (SSS, 2021)

Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. - Eric Goles 001; Pedro Montealegre 001; Kévin Perrot (Adv. Appl. Math., 2021)

Compact Distributed Certification of Planar Graphs. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Algorithmica, 2021)

The role of randomness in the broadcast congested clique model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (Inf. Comput., 2021)

On the complexity of asynchronous freezing cellular automata. - Eric Goles 001; Diego Maldonado; Pedro Montealegre 001; Martín Ríos-Wilson (Inf. Comput., 2021)

Generating Boolean Functions on Totalistic Automata Networks. - Eric Goles 001; Andrew Adamatzky; Pedro Montealegre 001; Martín Ríos-Wilson (Int. J. Unconv. Comput., 2021)

Computing the Probability of Getting Infected: On the Counting Complexity of Bootstrap Percolation. - Pedro Montealegre 001; Martín Ríos-Wilson (Automata and Complexity, 2022)

Computing Power of Hybrid Models in Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Pablo Paredes; Ivan Rapaport; Martín Ríos-Wilson; Ioan Todinca (OPODIS, 2022)

Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. - Benjamin Jauregui; Pedro Montealegre 001; Ivan Rapaport (SIROCCO, 2022)

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Pablo Paredes; Ivan Rapaport; Martín Ríos-Wilson; Ioan Todinca (DISC, 2022)

On the complexity of generalized Q2R automaton. - Eric Goles 001; Marco Montalva-Medel; Pedro Montealegre 001; Martín Ríos-Wilson (Adv. Appl. Math., 2022)

Computational Complexity of Biased Diffusion-Limited Aggregation. - Nicolas Bitar; Eric Goles 001; Pedro Montealegre 001 (SIAM J. Discret. Math., 2022)

Energy-Efficient Distributed Algorithms for Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIROCCO, 2023)

Distributed Certification for Classes of Dense Graphs. - Pierre Fraigniaud; Frédéric Mazoit; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (DISC, 2023)

Local Certification of Some Geometric Intersection Graph Classes. - Benjamin Jauregui; Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (CoRR, 2023)

Recognizing Hereditary Properties in the Presence of Byzantine Nodes. - David Cifuentes-Núñez; Pedro Montealegre 001; Ivan Rapaport (CoRR, 2023)

Local certification of graphs with bounded genus. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Discret. Appl. Math., 2023)

Distributed maximal independent set computation driven by finite-state dynamics. - Eric Goles 001; Laura Leal; Pedro Montealegre 001; Ivan Rapaport; Martín Ríos-Wilson (Int. J. Parallel Emergent Distributed Syst., 2023)

Symmetrizable Boolean networks. - Juan A. Aledo; Eric Goles 001; Marco Montalva-Medel; Pedro Montealegre 001; José C. Valverde (Inf. Sci., 2023)

The Hardness of Local Certification of Finite-State Dynamics. - Diego Maldonado; Pedro Montealegre 001; Martín Ríos-Wilson (LATIN (1), 2024)

Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. - Fedor V. Fomin; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (PODC, 2024)

Local Certification of Majority Dynamics. - Diego Maldonado; Pedro Montealegre 001; Martín Ríos-Wilson; Guillaume Theyssier (SOFSEM, 2024)

Distributed Model Checking on Graphs of Bounded Treedepth. - Fedor V. Fomin; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (DISC, 2024)

On the parameterized complexity of freezing dynamics. - Eric Goles 001; Pedro Montealegre 001; Martín Ríos-Wilson; Guillaume Theyssier (Adv. Appl. Math., 2024)

Distributed Model Checking in Graphs Classes of Bounded Expansion. - Fedor V. Fomin; Pierre Fraigniaud; Petr A. Golovach; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (CoRR, 2024)

A Meta-Theorem for Distributed Certification. - Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (Algorithmica, 2024)

Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. - Fedor V. Fomin; Pierre Fraigniaud; Petr A. Golovach; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (PODC, 2025)

Deterministic Distributed DFS via Cycle Separators in Planar Graphs. - Benjamin Jauregui; Pedro Montealegre 001; Ivan Rapaport (PODC, 2025)

Brief Announcement: Strong and Hiding Distributed Certification of k-Coloring. - Augusto Modanese; Pedro Montealegre 001; Martín Ríos-Wilson (PODC, 2025)

Compact distributed certification of geometric graph classes. - Benjamin Jauregui; Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (J. Comput. Syst. Sci., 2025)

Dynamical stability of threshold networks over undirected signed graphs. - Eric Goles 001; Pedro Montealegre 001; Martín Ríos-Wilson; Sylvain Sené (Theor. Comput. Sci., 2025)

Strong and Hiding Distributed Certification of k-Coloring. - Augusto Modanese; Pedro Montealegre-Barba; Martín Ríos-Wilson (CoRR, 2025)

Shared Versus Private Randomness in Distributed Interactive Proofs. - Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (Algorithmica, 2025)

Sandpiles prediction and crossover on $ mathbb {Z}^2$ within Moore neighborhood. - Pablo Concha-Vega; Eric Goles 001; Pedro Montealegre 001; Kévin Perrot (Nat. Comput., 2025)