Pedro Montealegre
Titre
Citée par
Citée par
Année
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
302017
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques
FV Fomin, M Liedloff, P Montealegre, I Todinca
Algorithmica 80 (4), 1146-1169, 2018
242018
The complexity of the bootstraping percolation and other problems
E Goles, P Montealegre-Barba, I Todinca
Theoretical Computer Science 504, 73-82, 2013
242013
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
222016
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
192014
Computational complexity of threshold automata networks under different updating schemes
E Goles, P Montealegre
Theoretical Computer Science 559, 3-19, 2014
152014
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
122016
PSPACE-completeness of majority automata networks
E Goles, P Montealegre, V Salo, I Törmä
Theoretical Computer Science 609, 118-128, 2016
122016
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
112018
On distributed Merlin-Arthur decision protocols
P Fraigniaud, P Montealegre, R Oshman, I Rapaport, I Todinca
International Colloquium on Structural Information and Communication …, 2019
102019
Beyond classes of graphs with “few” minimal separators: FPT results through potential maximal cliques
M Liedloff, P Montealegre, I Todinca
International Workshop on Graph-Theoretic Concepts in Computer Science, 499-512, 2015
10*2015
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
82017
Finding connected secluded subgraphs
PA Golovach, P Heggernes, PT Lima, P Montealegre
Journal of Computer and System Sciences 113, 101-124, 2020
72020
Distributed subgraph detection
P Fraigniaud, P Montealegre, D Olivetti, I Rapaport, I Todinca
arXiv preprint arXiv:1706.03996, 2017
72017
Deterministic graph connectivity in the broadcast congested clique
P Montealegre, I Todinca
arXiv preprint arXiv:1602.04095, 2016
62016
Competing activists—political polarization
L Böttcher, P Montealegre, E Goles, H Gersbach
Physica A: Statistical Mechanics and its Applications 545, 123713, 2020
52020
The impact of locality on the detection of cycles in the broadcast congested clique model
F Becker, P Montealegre, I Rapaport, I Todinca
Latin American Symposium on Theoretical Informatics, 134-145, 2018
52018
The complexity of the majority rule on planar graphs
E Goles, P Montealegre
Advances in Applied Mathematics 64, 111-123, 2015
52015
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
42020
A fast parallel algorithm for the robust prediction of the two-dimensional strict majority automaton
E Goles, P Montealegre
International Conference on Cellular Automata, 166-175, 2016
42016
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20