PDI - Resultado de Búsqueda

Pedro Tomás Montealegre Barba

Profesor Asistente

Universidad Adolfo Ibáñez

santiago, Chile

Matemáticas discretas, algoritmos, complejidad computacional, redes de autómatas, grafos, algoritmos distribuídos, paralelismo

Informatica, UNIVERSITE D'ORLEANS. Francia, 2017
Ingeniero Civil Matemático, UNIVERSIDAD DE CHILE. Chile, 2012

Postdoctorado Other

UNIVERSIDAD ADOLFO IBANEZ

Ingeniería y Ciencias

Santiago, Chile

2017 - 2017

Conslutor Part Time

Galyleo

Santiago, Chile

2012 - 2013
Colaborador Part Time

FONDEF D05I10211: Herramientas para la formación de profesores de matemáticas

Santiago, Chile

2009 - 2012
Ayudante de investigación Part Time

Centro de modelamiento matemático (CMM)

Santiago, Chile

2010 - 2010

N/A

Becas Chile

Conicyt

Chile, 2012

Beca de doctorado


A large diffusion and small amplification dynamics for density classification on graphs Osses, Axel; Rapaport, Ivan Article ISI SCOPUS International Journal of Modern Physics C (2023)
Distributed maximal independent set computation driven by finite-state dynamics Leal, Laura; Rapaport, Ivan; Rios-Wilson, Martin Article ISI SCOPUS International Journal of Parallel, Emergent and Distributed Systems (2023)
Local certification of graphs with bounded genus Feuilloley, Laurent; Fraigniaud, Pierre; Rapaport, Ivan; Remila, Eric; Todinca, Ioan Article ISI SCOPUS Discrete Applied Mathematics (2023)
Symmetrizable Boolean networks Aledo, Juan A.; Valverde, Jose C. Article ISI SCOPUS Information Sciences (2023)
A Meta-Theorem for Distributed Certification Rapaport, Ivan; Todinca, Ioan Article ISI SCOPUS Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2022)
COMPUTATIONAL COMPLEXITY OF BIASED DIFFUSION-LIMITED AGGREGATION Article ISI SCOPUS SIAM Journal on Discrete Mathematics (2022)
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes Jauregui, Benjamin; Rapaport, Ivan; Parter, M Article ISI SCOPUS Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2022)
Introducing the activity parameter for elementary cellular automata Concha-Vega, Pablo; Santivanez, Julio Article ISI SCOPUS International Journal of Modern Physics C (2022)
Majority networks and consensus dynamics Goles E.; Medina P.; Montealegre P.; SantivaÃƒÂ±ez J. Article SCOPUS Chaos, Solitons and Fractals (2022)
On the complexity of generalized Q2R automaton Article ISI SCOPUS Advances in Applied Mathematics (2022)
Compact Distributed Certification of Planar Graphs Feuilloley, Laurent; Rapaport, Ivan; Remila, Eric; Todinca, Ioan Article ISI SCOPUS Algorithmica (2021)
Freezing sandpiles and Boolean threshold networks: Equivalence and complexity Article ISI SCOPUS Advances in Applied Mathematics (2021)
On the complexity of asynchronous freezing cellular automata Article ISI SCOPUS Information and Computation (2021)
On the Impact of Treewidth in the Computational Complexity of Freezing Dynamics Rios Wilson, Martin; Theyssier, Guillaume; DeMol, L; Weiermann, A; Fernandez-Duque, D Article ISI SCOPUS Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2021)
The role of randomness in the broadcast congested clique model Becker, Florent; Rapaport, Ivan; Todinca, Ioan Article ISI SCOPUS Information and Computation (2021)
Graph reconstruction in the congested clique Montealegre R. Article ISI SCOPUS Journal of Computer and System Sciences (2020)
On the complexity of the stability problem of binary freezing totalistic cellular automata Ollinger, N Article ISI SCOPUS Information and Computation (2020)
The complexity of the asynchronous prediction of the majority automata Article ISI SCOPUS Information and Computation (2020)
THE IMPACT OF LOCALITY IN THE BROADCAST CONGESTED CLIQUE MODEL Montealecre, P. Article ISI SCOPUS SIAM Journal on Discrete Mathematics (2020)
Beyond Classes of Graphs with Few Minimal Separators: FPT Results Through Potential Maximal Cliques Article ISI SCOPUS ALGORITHMICA (2019)
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques Fomin, Fedor V.; Montealegre, Pedro; Todinca, Ioan Article ISI ALGORITHMICA (2018)
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata Ollinger, N Article SCOPUS Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018)
Fixing improper colorings of graphs Garnero, Valentin; Junosza-Szaniawski, Konstanty; Rzazewski, Pawel Article ISI Theoretical Computer Science (2018)
On the complexity of two-dimensional signed majority cellular automata Article ISI SCOPUS JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2018)
Two rounds are enough for reconstructing any graph (Class) in the congested clique model Perez-Salazar S. Article SCOPUS Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018)
Three notes on distributed property testing Even G.; Fischer O.; Fraigniaud P.; Gonen T.; Levi R.; Olivetti D.; Oshman R. Article SCOPUS Leibniz International Proceedings in Informatics, LIPIcs (2017)
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique Todinca, Ioan; A.C.M. Article ISI PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'16) (2016)
Naming Game Automata Networks Article ISI SCOPUS JOURNAL OF CELLULAR AUTOMATA (2016)
On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal Separators Todinca, Ioan Article ISI PROGRESS IN ARTIFICIAL INTELLIGENCE AND PATTERN RECOGNITION, IWAIPR 2018 (2016)
PSPACE-completeness of majority automata networks Goles E.; Montealegre P.; Salo, V; Torma, I Article ISI Theoretical Computer Science (2016)
The complexity of the majority rule on planar graphs Goles E.; Montealegre P. Article ISI SCOPUS ADVANCES IN APPLIED MATHEMATICS (2015)
Computational complexity of threshold automata networks under different updating schemes Article ISI SCOPUS Theoretical Computer Science (2014)


Finding connected secluded subgraphs Lima P.T. ConferencePaper SCOPUS Leibniz International Proceedings in Informatics, LIPIcs (2018)
On the Computational Complexity of the Freezing Non-strict Majority Automata Maldonado, Diego ConferencePaper ISI SCOPUS (2017)
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton ConferencePaper ISI SCOPUS PROGRESS IN ARTIFICIAL INTELLIGENCE AND PATTERN RECOGNITION, IWAIPR 2018 (2016)


COMPUTING POWER OF HYBRID MODELS IN SYNCHRONOUS NETWORKS Proyecto (2023)
DISTRIBUTED ALGORITHMS IN THE CONGEST MODEL: SUBGRAPH DETECTION AND RECONSTRUCTION Proyecto (2019)