Pedro Montealegre-Barba
Orcid: 0000-0002-2508-5907Affiliations:
- Adolfo Ibáñez University, Santiago, Chile
According to our database1,
Pedro Montealegre-Barba
authored at least 60 papers
between 2013 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
3
6
2
5
6
2
4
1
3
1
1
1
4
2
4
2
1
2
3
2
3
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Proceedings of the 38th International Symposium on Distributed Computing, 2024
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
Proceedings of the LATIN 2024: Theoretical Informatics, 2024
2023
Int. J. Parallel Emergent Distributed Syst., 2023
Proceedings of the 37th International Symposium on Distributed Computing, 2023
Proceedings of the Structural Information and Communication Complexity, 2023
2022
SIAM J. Discret. Math., 2022
Proceedings of the 36th International Symposium on Distributed Computing, 2022
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes.
Proceedings of the Structural Information and Communication Complexity, 2022
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022
Computing the Probability of Getting Infected: On the Counting Complexity of Bootstrap Percolation.
Proceedings of the Automata and Complexity, 2022
2021
Int. J. Unconv. Comput., 2021
Adv. Appl. Math., 2021
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021
Proceedings of the Connecting with Computability, 2021
2020
SIAM J. Discret. Math., 2020
J. Cell. Autom., 2020
On the complexity of the stability problem of binary freezing totalistic cellular automata.
Inf. Comput., 2020
Inf. Comput., 2020
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020
2019
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques.
Algorithmica, 2019
Proceedings of the Structural Information and Communication Complexity, 2019
Proceedings of the Cellular Automata and Discrete Complex Systems, 2019
2018
J. Comput. Syst. Sci., 2018
J. Cell. Autom., 2018
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques.
Algorithmica, 2018
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.
Proceedings of the Structural Information and Communication Complexity, 2018
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
Proceedings of the Cellular Automata, 2018
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).
PhD thesis, 2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
Proceedings of the Cellular Automata and Discrete Complex Systems, 2017
2016
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton.
Proceedings of the Cellular Automata, 2016
2015
2014
Computational complexity of threshold automata networks under different updating schemes.
Theor. Comput. Sci., 2014
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism.
Proceedings of the Structural Information and Communication Complexity, 2014
2013
Theor. Comput. Sci., 2013