default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPedro Montealegre-Barba
Pedro Montealegre 0001
Person information
- affiliation: Adolfo Ibáñez University, Santiago, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j28]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson
, Guillaume Theyssier:
On the parameterized complexity of freezing dynamics. Adv. Appl. Math. 157: 102706 (2024)- [j27]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. Algorithmica 86(2): 585-612 (2024) - [c29]Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson:
The Hardness of Local Certification of Finite-State Dynamics. LATIN (1) 2024: 51-65 - [c28]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC 2024: 205-208 - [c27]Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
Local Certification of Majority Dynamics. SOFSEM 2024: 369-382 - [c26]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. DISC 2024: 25:1-25:20 - [i31]Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR abs/2405.03321 (2024) - 2023
- [j26]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Local certification of graphs with bounded genus. Discret. Appl. Math. 325: 9-36 (2023) - [j25]Juan A. Aledo, Eric Goles, Marco Montalva-Medel, Pedro Montealegre, José C. Valverde:
Symmetrizable Boolean networks. Inf. Sci. 626: 787-804 (2023) - [j24]Eric Goles, Laura Leal, Pedro Montealegre, Ivan Rapaport, Martín Ríos-Wilson:
Distributed maximal independent set computation driven by finite-state dynamics. Int. J. Parallel Emergent Distributed Syst. 38(1): 85-97 (2023) - [c25]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO 2023: 482-501 - [c24]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. DISC 2023: 20:1-20:17 - [i30]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR abs/2301.11988 (2023) - [i29]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. CoRR abs/2307.14292 (2023) - [i28]Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
Local Certification of Majority Dynamics. CoRR abs/2309.01852 (2023) - [i27]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Sylvain Sené:
Dynamical Stability of Threshold Networks over Undirected Signed Graphs. CoRR abs/2309.01854 (2023) - [i26]Benjamin Jauregui, Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Local Certification of Some Geometric Intersection Graph Classes. CoRR abs/2309.04789 (2023) - [i25]David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport:
Recognizing Hereditary Properties in the Presence of Byzantine Nodes. CoRR abs/2312.07747 (2023) - [i24]Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson:
The Hardness of Local Certification of Finite-State Dynamics. CoRR abs/2312.12278 (2023) - 2022
- [j23]Eric Goles, Marco Montalva-Medel, Pedro Montealegre, Martín Ríos-Wilson:
On the complexity of generalized Q2R automaton. Adv. Appl. Math. 138: 102355 (2022) - [j22]Nicolas Bitar, Eric Goles, Pedro Montealegre:
Computational Complexity of Biased Diffusion-Limited Aggregation. SIAM J. Discret. Math. 36(1): 823-866 (2022) - [c23]Pedro Montealegre, Martín Ríos-Wilson:
Computing the Probability of Getting Infected: On the Counting Complexity of Bootstrap Percolation. Automata and Complexity 2022: 179-201 - [c22]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Computing Power of Hybrid Models in Synchronous Networks. OPODIS 2022: 20:1-20:18 - [c21]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. SIROCCO 2022: 116-134 - [c20]Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport:
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. SIROCCO 2022: 212-233 - [c19]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. DISC 2022: 43:1-43:3 - [i23]Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca:
Computing Power of Hybrid Models in Synchronous Networks. CoRR abs/2208.02640 (2022) - 2021
- [j21]Eric Goles, Pedro Montealegre, Kévin Perrot:
Freezing sandpiles and Boolean threshold networks: Equivalence and complexity. Adv. Appl. Math. 125: 102161 (2021) - [j20]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021) - [j19]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The role of randomness in the broadcast congested clique model. Inf. Comput. 281: 104669 (2021) - [j18]Eric Goles, Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson:
On the complexity of asynchronous freezing cellular automata. Inf. Comput. 281: 104764 (2021) - [j17]Eric Goles, Andrew Adamatzky, Pedro Montealegre, Martín Ríos-Wilson:
Generating Boolean Functions on Totalistic Automata Networks. Int. J. Unconv. Comput. 16(4): 343-391 (2021) - [c18]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics. CiE 2021: 260-272 - [c17]Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. SSS 2021: 395-409 - [i22]Eric Goles, Pedro Montealegre, Kévin Perrot:
Freezing sandpiles and Boolean threshold networks: equivalence and complexity. CoRR abs/2101.04204 (2021) - [i21]Eric Goles, Andrew Adamatzky, Pedro Montealegre, Martín Ríos-Wilson:
Generating Boolean Functions on Totalistic Automata Networks. CoRR abs/2107.14799 (2021) - [i20]Eric Goles Ch., Marco Montalva-Medel, Pedro Montealegre, Martín Ríos-Wilson:
On the complexity of the generalized Q2R automaton. CoRR abs/2108.03335 (2021) - [i19]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. CoRR abs/2112.03195 (2021) - [i18]Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport:
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. CoRR abs/2112.03206 (2021) - 2020
- [j16]Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
On the complexity of the stability problem of binary freezing totalistic cellular automata. Inf. Comput. 274: 104535 (2020) - [j15]Eric Goles, Pedro Montealegre:
The complexity of the asynchronous prediction of the majority automata. Inf. Comput. 274: 104537 (2020) - [j14]Eric Goles, Fabiola Lobos, Pedro Montealegre, Eurico L. P. Ruivo, Pedro P. B. de Oliveira:
Computational Complexity of the Stability Problem for Elementary Cellular Automata. J. Cell. Autom. 15(4): 261-304 (2020) - [j13]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Graph reconstruction in the congested clique. J. Comput. Syst. Sci. 113: 1-17 (2020) - [j12]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding connected secluded subgraphs. J. Comput. Syst. Sci. 113: 101-124 (2020) - [j11]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Impact of Locality in the Broadcast Congested Clique Model. SIAM J. Discret. Math. 34(1): 682-700 (2020) - [c16]Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Shared vs Private Randomness in Distributed Interactive Proofs. ISAAC 2020: 51:1-51:13 - [c15]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328 - [i17]Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca:
Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020) - [i16]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson, Guillaume Theyssier:
On the impact of treewidth in the computational complexity of freezing dynamics. CoRR abs/2005.11758 (2020) - [i15]Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Shared vs Private Randomness in Distributed Interactive Proofs. CoRR abs/2006.16191 (2020) - [i14]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca:
Local Certification of Graphs with Bounded Genus. CoRR abs/2007.08084 (2020) - [i13]Pedro Montealegre, Diego Ramírez-Romero, Iván Rapaport:
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. CoRR abs/2012.03185 (2020)
2010 – 2019
- 2019
- [j10]Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica 81(3): 986-1005 (2019) - [c14]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson:
On the Effects of Firing Memory in the Dynamics of Conjunctive Networks. Automata 2019: 1-19 - [c13]Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245 - [i12]Eric Goles, Pedro Montealegre, Martín Ríos-Wilson:
On the effects of firing memory in the dynamics of conjunctive networks. CoRR abs/1901.09789 (2019) - [i11]Nicolas Bitar, Eric Goles, Pedro Montealegre:
Computational Complexity of Restricted Diffusion Limited Aggregation. CoRR abs/1904.10011 (2019) - [i10]Eric Goles, Diego Maldonado, Pedro Montealegre, Martín Ríos-Wilson:
On the Complexity of Asynchronous Freezing Cellular Automata. CoRR abs/1910.10882 (2019) - [i9]Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
On the Complexity of the Stability Problem of Binary Freezing Totalistic Cellular Automata. CoRR abs/1912.02953 (2019) - 2018
- [j9]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Algorithmica 80(4): 1146-1169 (2018) - [j8]Fabiola Lobos, Eric Goles, Eurico L. P. Ruivo, Pedro Paulo Balbi de Oliveira, Pedro Montealegre:
A Mining a Class of Decision Problems for One-dimensional Cellular Automata. J. Cell. Autom. 13(5-6): 393-405 (2018) - [j7]Eric Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier:
On the complexity of two-dimensional signed majority cellular automata. J. Comput. Syst. Sci. 91: 1-32 (2018) - [j6]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. Theor. Comput. Sci. 711: 66-78 (2018) - [c12]Eric Goles, Diego Maldonado, Pedro Montealegre-Barba, Nicolas Ollinger:
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata. ACRI 2018: 406-415 - [c11]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. LATIN 2018: 134-145 - [c10]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. SIROCCO 2018: 134-148 - 2017
- [b1]Pedro Montealegre-Barba:
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). University of Orléans, France, 2017 - [c9]Eric Goles, Diego Maldonado, Pedro Montealegre, Nicolas Ollinger:
On the Computational Complexity of the Freezing Non-strict Majority Automata. AUTOMATA 2017: 109-119 - [c8]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. IPEC 2017: 18:1-18:13 - [c7]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca:
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [i8]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Graph Reconstruction in the Congested Clique. CoRR abs/1706.03107 (2017) - [i7]Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca:
Distributed Subgraph Detection. CoRR abs/1706.03996 (2017) - [i6]Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, Pedro Montealegre:
Finding Connected Secluded Subgraphs. CoRR abs/1710.10979 (2017) - 2016
- [j5]Eric Goles, Pedro Montealegre, Javier Vera:
Naming Game Automata Network. J. Cell. Autom. 11(5-6): 497-521 (2016) - [j4]Eric Goles, Pedro Montealegre, Ville Salo, Ilkka Törmä:
PSPACE-completeness of majority automata networks. Theor. Comput. Sci. 609: 118-128 (2016) - [c6]Eric Goles, Pedro Montealegre:
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton. ACRI 2016: 166-175 - [c5]Pedro Montealegre, Ioan Todinca:
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique. PODC 2016: 245-247 - [c4]Pedro Montealegre, Ioan Todinca:
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators. WG 2016: 183-194 - [i5]Pedro Montealegre, Ioan Todinca:
Deterministic graph connectivity in the broadcast congested clique. CoRR abs/1602.04095 (2016) - [i4]Pedro Montealegre, Ioan Todinca:
On Distance-d Independent Set and other problems in graphs with few minimal separators. CoRR abs/1607.04545 (2016) - [i3]Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff, Pedro Montealegre, Pawel Rzazewski:
Fixing improper colorings of graphs. CoRR abs/1607.06911 (2016) - 2015
- [j3]Eric Goles, Pedro Montealegre:
The complexity of the majority rule on planar graphs. Adv. Appl. Math. 64: 111-123 (2015) - [c3]Mathieu Liedloff, Pedro Montealegre, Ioan Todinca:
Beyond Classes of Graphs with "Few" Minimal Separators: FPT Results Through Potential Maximal Cliques. WG 2015: 499-512 - [i2]Eric Goles Ch., Pedro Montealegre, Ville Salo, Ilkka Törmä:
PSPACE-Completeness of Majority Automata Networks. CoRR abs/1501.03992 (2015) - 2014
- [j2]Eric Goles Ch., Pedro Montealegre:
Computational complexity of threshold automata networks under different updating schemes. Theor. Comput. Sci. 559: 3-19 (2014) - [c2]Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. SIROCCO 2014: 83-95 - [c1]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms Parameterized by Vertex Cover and Modular Width, through Potential Maximal Cliques. SWAT 2014: 182-193 - [i1]Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre-Barba, Ioan Todinca:
Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. CoRR abs/1404.3882 (2014) - 2013
- [j1]Eric Goles Ch., Pedro Montealegre-Barba, Ioan Todinca:
The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci. 504: 73-82 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
