Follow
Pedro Montealegre
Pedro Montealegre
Verified email at uai.cl - Homepage
Title
Cited by
Cited by
Year
Three notes on distributed property testing
G Even, O Fischer, P Fraigniaud, T Gonen, R Levi, M Medina, ...
31st International Symposium on Distributed Computing (DISC 2017), 2017
442017
The complexity of the bootstraping percolation and other problems
E Goles, P Montealegre-Barba, I Todinca
Theoretical Computer Science 504, 73-82, 2013
372013
Compact distributed certification of planar graphs
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, É Rémila, I Todinca
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
312020
Computational complexity of threshold automata networks under different updating schemes
E Goles, P Montealegre
Theoretical Computer Science 559, 3-19, 2014
302014
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
FV Fomin, M Liedloff, P Montealegre, I Todinca
Algorithmica 80, 1146-1169, 2018
262018
PSPACE-completeness of majority automata networks
E Goles, P Montealegre, V Salo, I Törmä
Theoretical Computer Science 609, 118-128, 2016
252016
The simultaneous number-in-hand communication model for networks: Private coins, public coins and determinism
F Becker, P Montealegre, I Rapaport, I Todinca
International colloquium on structural information and communication …, 2014
242014
On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators
P Montealegre, I Todinca
International Workshop on Graph-Theoretic Concepts in Computer Science, 183-194, 2016
232016
On the complexity of two-dimensional signed majority cellular automata
E Goles, P Montealegre, K Perrot, G Theyssier
Journal of Computer and System Sciences 91, 1-32, 2018
222018
Local certification of graphs with bounded genus
L Feuilloley, P Fraigniaud, P Montealegre, I Rapaport, E Rémila, I Todinca
Discrete Applied Mathematics 325, 9-36, 2023
212023
Brief announcement: deterministic graph connectivity in the broadcast congested clique
P Montealegre, I Todinca
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
172016
On distributed Merlin-Arthur decision protocols
P Fraigniaud, P Montealegre, R Oshman, I Rapaport, I Todinca
International Colloquium on Structural Information and Communication …, 2019
162019
A meta-theorem for distributed certification
P Fraigniaud, P Montealegre, I Rapaport, I Todinca
International Colloquium on Structural Information and Communication …, 2022
142022
On the computational complexity of the freezing non-strict majority automata
E Goles, D Maldonado, P Montealegre, N Ollinger
International Workshop on Cellular Automata and Discrete Complex Systems …, 2017
142017
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques
M Liedloff, P Montealegre, I Todinca
Algorithmica 81 (3), 986-1005, 2019
13*2019
The complexity of the asynchronous prediction of the majority automata
E Goles, P Montealegre
Information and Computation 274, 104537, 2020
112020
Competing activists—political polarization
L Böttcher, P Montealegre, E Goles, H Gersbach
Physica A: Statistical Mechanics and its Applications 545, 123713, 2020
112020
The impact of locality in the broadcast congested clique model
F Becker, P Montealegre, I Rapaport, I Todinca
SIAM Journal on Discrete Mathematics 34 (1), 682-700, 2020
102020
On the effects of firing memory in the dynamics of conjunctive networks
E Goles, P Montealegre, M Ríos-Wilson
Cellular Automata and Discrete Complex Systems: 25th IFIP WG 1.5 …, 2019
102019
The impact of locality on the detection of cycles in the broadcast congested clique model
F Becker, P Montealegre, I Rapaport, I Todinca
LATIN 2018: Theoretical Informatics: 13th Latin American Symposium, Buenos …, 2018
102018
The system can't perform the operation now. Try again later.
Articles 1–20