Ivan Rapaport

102 papers A* 6A 7B 23C 1Misc 1Journal 59Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
Distributed Model Checking on Graphs of Bounded Treedepth.
Algorithmica
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2025 A* conf
Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks.
PODC
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2025 J jnl
Compact distributed certification of geometric graph classes.
J. Comput. Syst. Sci.
Benjamin Jauregui, Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
2025 A* conf
Deterministic Distributed DFS via Cycle Separators in Planar Graphs.
PODC
Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport
2025 J jnl
Deterministic Distributed DFS via Cycle Separators in Planar Graphs.
CoRR
Benjamin Jauregui, Pedro Montealegre-Barba, Ivan Rapaport
2025 B conf
Recognizing Hereditary Properties in the Presence of Byzantine Nodes.
OPODIS
David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport
2025 J jnl
Shared Versus Private Randomness in Distributed Interactive Proofs.
Algorithmica
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
2024 J jnl
A Meta-Theorem for Distributed Certification.
Algorithmica
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024 A* conf
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth.
PODC
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024 J jnl
Distributed Model Checking in Graphs Classes of Bounded Expansion.
CoRR
Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024 A conf
Distributed Model Checking on Graphs of Bounded Treedepth.
DISC
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2024 J jnl
Distributed Model Checking on Graphs of Bounded Treedepth.
CoRR
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023 A conf
Distributed Certification for Classes of Dense Graphs.
DISC
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023 J jnl
Distributed Certification for Classes of Dense Graphs.
CoRR
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023 J jnl
Distributed maximal independent set computation driven by finite-state dynamics.
Int. J. Parallel Emergent Distributed Syst.
Eric Goles, Laura Leal, Pedro Montealegre, Ivan Rapaport, Martín Ríos-Wilson
2023 B conf
Energy-Efficient Distributed Algorithms for Synchronous Networks.
SIROCCO
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023 J jnl
Energy-Efficient Distributed Algorithms for Synchronous Networks.
CoRR
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2023 J jnl
Local Certification of Some Geometric Intersection Graph Classes.
CoRR
Benjamin Jauregui, Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
2023 J jnl
Local certification of graphs with bounded genus.
Discret. Appl. Math.
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2023 J jnl
Recognizing Hereditary Properties in the Presence of Byzantine Nodes.
CoRR
David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport
2022 B conf
A Meta-Theorem for Distributed Certification.
SIROCCO
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2022 A conf
Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks.
DISC
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca
2022 B conf
Computing Power of Hybrid Models in Synchronous Networks.
OPODIS
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca
2022 J jnl
Computing Power of Hybrid Models in Synchronous Networks.
CoRR
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos-Wilson, Ioan Todinca
2022 — conf
Connectivity and Connected Components in the Number-in-Hand Computation Model.
Automata and Complexity
Antonio Lizama, Ivan Rapaport
2022 B conf
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes.
SIROCCO
Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport
2021 J jnl
A Meta-Theorem for Distributed Certification.
CoRR
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2021 J jnl
Communication complexity meets cellular automata: Necessary conditions for intrinsic universality.
Nat. Comput.
Raimundo Briceño, Ivan Rapaport
2021 J jnl
Compact Distributed Certification of Planar Graphs.
Algorithmica
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2021 C conf
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs.
SSS
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
2021 J jnl
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes.
CoRR
Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport
2021 B conf
The Multiple Traveling Salesman Problem on Spiders.
SOFSEM
Pedro Pérez-Escalona, Ivan Rapaport, José A. Soto, Ian Vidal
2021 J jnl
The role of randomness in the broadcast congested clique model.
Inf. Comput.
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2020 A* conf
Compact Distributed Certification of Planar Graphs.
PODC
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
2020 J jnl
Compact Distributed Certification of Planar Graphs.
CoRR
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
2020 J jnl
Graph reconstruction in the congested clique.
J. Comput. Syst. Sci.
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
2020 J jnl
Local Certification of Graphs with Bounded Genus.
CoRR
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca
2020 B conf
Shared vs Private Randomness in Distributed Interactive Proofs.
ISAAC
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
2020 J jnl
Shared vs Private Randomness in Distributed Interactive Proofs.
CoRR
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
2020 J jnl
The Impact of Locality in the Broadcast Congested Clique Model.
SIAM J. Discret. Math.
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2019 B conf
On Distributed Merlin-Arthur Decision Protocols.
SIROCCO
Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca
2018 B conf
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model.
LATIN
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2018 B conf
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model.
SIROCCO
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
2017 J jnl
Distributed Subgraph Detection.
CoRR
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca
2017 J jnl
Graph Reconstruction in the Congested Clique.
CoRR
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
2017 A conf
Three Notes on Distributed Property Testing.
DISC
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Pedro Montealegre, Dennis Olivetti, Rotem Oshman, Ivan Rapaport, Ioan Todinca
2016 A conf
Distributed Testing of Excluded Subgraphs.
DISC
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
2016 J jnl
Distributed Testing of Excluded Subgraphs.
CoRR
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
2016 J jnl
Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case.
Biosyst.
Pablo Moisset de Espanés, Axel Osses, Ivan Rapaport
2016 J jnl
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model.
Networks
Pablo Moisset de Espanés, Ivan Rapaport, Daniel Remenik, Javiera Urrutia
2016 Misc conf
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model.
COCOON
Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila
2015 J jnl
Allowing each node to communicate only once in a distributed system: shared whiteboard models.
Distributed Comput.
Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
2015 A* conf
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast.
PODC
Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila
2015 B conf
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model.
SIROCCO
Jarkko Kari, Martín Matamala, Ivan Rapaport, Ville Salo
2014 J jnl
Strict Majority Bootstrap Percolation in the r-wheel.
Inf. Process. Lett.
Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier
2014 — conf
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results.
Automata
Pablo Moisset de Espanés, Ivan Rapaport
2014 B conf
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism.
SIROCCO
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
2013 J jnl
Discrete mathematical structures: From dynamics to complexity.
Theor. Comput. Sci.
Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica
2013 J jnl
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata.
Theor. Comput. Sci.
Raimundo Briceño, Ivan Rapaport
2013 J jnl
Strict majority bootstrap percolation in the r-wheel.
CoRR
Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier
2012 B conf
Allowing each node to communicate only once in a distributed system: shared whiteboard models.
SPAA
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
2012 J jnl
Distributed computing of efficient routing schemes in generalized chordal graphs.
Theor. Comput. Sci.
Nicolas Nisse, Ivan Rapaport, Karol Suchan
2011 — ed.
17th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2011, Center for Mathematical Modeling, University of Chile, Santiago, Chile, November 21-23, 2011
Automata
Nazim Fatès, Eric Goles Chacc, Alejandro Maass, Ivan Rapaport
2011 A conf
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round.
IPDPS
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
2011 J jnl
Communication complexity and intrinsic universality in cellular automata.
Theor. Comput. Sci.
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
2011 J jnl
Communication complexity in number-conserving and monotone cellular automata.
Theor. Comput. Sci.
Eric Goles Ch., Andrés Moreira, Ivan Rapaport
2011 J jnl
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21].
Theor. Comput. Sci.
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
2011 J jnl
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power
CoRR
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
2011 J jnl
On Dissemination Thresholds in Regular and Irregular Graph Classes.
Algorithmica
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
2011 J jnl
Traced communication complexity of cellular automata
CoRR
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
2011 J jnl
Traced communication complexity of cellular automata.
Theor. Comput. Sci.
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
2010 J jnl
Adding a referee to an interconnection network: What can(not) be computed in one round
CoRR
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
2010 B conf
Average Long-Lived Memoryless Consensus: The Three-Value Case.
SIROCCO
Ivan Rapaport, Eric Rémila
2010 J jnl
Average long-lived binary consensus: Quantifying the stabilizing role played by memory.
Theor. Comput. Sci.
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila
2009 J jnl
Communication Complexity and Intrinsic Universality in Cellular Automata
CoRR
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
2009 B conf
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs.
SIROCCO
Nicolas Nisse, Ivan Rapaport, Karol Suchan
2009 J jnl
Modeling heterocyst pattern formation in cyanobacteria.
BMC Bioinform.
Ziomara P. Gerdtzen, J. Cristian Salgado, Axel Osses, Juan A. Asenjo, Ivan Rapaport, Barbara A. Andrews
2008 B conf
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory.
SIROCCO
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila
2008 — conf
Communications in cellular automata
CSP
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
2008 J jnl
Minimal proper interval completions.
Inf. Process. Lett.
Ivan Rapaport, Karol Suchan, Ioan Todinca
2008 B conf
On Dissemination Thresholds in Regular and Irregular Graph Classes.
LATIN
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
2008 B conf
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol.
ISAAC
Eric Goles Ch., Cedric Little, Ivan Rapaport
2007 B conf
Small Alliances in Graphs.
MFCS
Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
2006 B conf
Minimal Proper Interval Completions.
WG
Ivan Rapaport, Karol Suchan, Ioan Todinca
2006 — conf
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time.
FSTTCS
Florent Becker, Ivan Rapaport, Eric Rémila
2004 J jnl
AT-free graphs: linear bounds for the oriented diameter.
Discret. Appl. Math.
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
2004 J jnl
Cellular automata and communication complexity.
Theor. Comput. Sci.
Christoph Dürr, Ivan Rapaport, Guillaume Theyssier
2004 J jnl
Complexity of approximating the oriented diameter of chordal graphs.
J. Graph Theory
Fedor V. Fomin, Martín Matamala, Ivan Rapaport
2004 J jnl
Domino tilings and related models: space of configurations of domains with holes.
Theor. Comput. Sci.
Sébastien Desreux, Martín Matamala, Ivan Rapaport, Eric Rémila
2003 J jnl
Tiling with bars under tomographic constraints.
Theor. Comput. Sci.
Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
2002 J jnl
Cellular automata and communication complexity
CoRR
Christoph Dürr, Ivan Rapaport, Guillaume Theyssier
2002 B conf
The Complexity of Approximating the Oriented Diameter of Chordal Graphs.
WG
Fedor V. Fomin, Martín Matamala, Ivan Rapaport
2002 A* conf
Tiling groups for Wang tiles.
SODA
Cristopher Moore, Ivan Rapaport, Eric Rémila
2002 B conf
k-pseudosnakes in Large Grids.
LATIN
Martín Matamala, Erich Prisner, Ivan Rapaport
2001 J jnl
Bilateral Orientations and Domination.
Electron. Notes Discret. Math.
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
1999 J jnl
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results.
Discret. Math.
Jacques Mazoyer, Ivan Rapaport
1999 J jnl
Inducing an Order on Cellular Automata by a Grouping Operation.
Discret. Appl. Math.
Jacques Mazoyer, Ivan Rapaport
1999 J jnl
Tiling Allowing Rotations Only.
Theor. Comput. Sci.
Eric Goles Ch., Ivan Rapaport
1999 J jnl
Tiling with bars under tomographic constraints
CoRR
Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
1998 B conf
Additive Cellular Automata over Z
MFCS
Jacques Mazoyer, Ivan Rapaport
1998 A conf
Inducing an Order on Cellular Automata by a Grouping Operation.
STACS
Jacques Mazoyer, Ivan Rapaport
1997 J jnl
Complexity of Tile Rotation Problems.
Theor. Comput. Sci.
Eric Goles Ch., Ivan Rapaport