Ivan Rapaport

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 42

Top Topics

Traveling Salesman

Boolean Networks

Computing Power

Top Venues

Publications

Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC (2024)
Fedor V. Fomin, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Model Checking on Graphs of Bounded Treedepth. CoRR (2024)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. Algorithmica 86 (2) (2024)
Benjamin Jauregui, Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
Local Certification of Some Geometric Intersection Graph Classes. CoRR (2023)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. CoRR (2023)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Local certification of graphs with bounded genus. Discret. Appl. Math. 325 (2023)
David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport
Recognizing Hereditary Properties in the Presence of Byzantine Nodes. CoRR (2023)
Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Distributed Certification for Classes of Dense Graphs. DISC (2023)
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) (2023)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR (2023)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO (2023)
Pierre Fraigniaud, Pedro Montealegre, Pablo Paredes, Ivan Rapaport, Martín Ríos Wilson, Ioan Todinca
Computing Power of Hybrid Models in Synchronous Networks. CoRR (2022)
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)
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)
Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. SIROCCO (2022)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. SIROCCO (2022)
Antonio Lizama, Ivan Rapaport
Connectivity and Connected Components in the Number-in-Hand Computation Model. Automata and Complexity (2022)
Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. CoRR (2021)
Pedro Pérez-Escalona, Ivan Rapaport, José A. Soto, Ian Vidal
The Multiple Traveling Salesman Problem on Spiders. SOFSEM (2021)
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
The role of randomness in the broadcast congested clique model. Inf. Comput. 281 (2021)
Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
A Meta-Theorem for Distributed Certification. CoRR (2021)
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. SSS (2021)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Compact Distributed Certification of Planar Graphs. Algorithmica 83 (7) (2021)
Raimundo Briceño, Ivan Rapaport
Communication complexity meets cellular automata: Necessary conditions for intrinsic universality. Nat. Comput. 20 (2) (2021)
Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
Compact Distributed Certification of Planar Graphs. CoRR (2020)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Éric Rémila, Ioan Todinca
Compact Distributed Certification of Planar Graphs. PODC (2020)
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
Graph reconstruction in the congested clique. J. Comput. Syst. Sci. 113 (2020)
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
Shared vs Private Randomness in Distributed Interactive Proofs. ISAAC (2020)
Florent Becker, Pedro Montealegre, Ivan Rapaport, Ioan Todinca
The Impact of Locality in the Broadcast Congested Clique Model. SIAM J. Discret. Math. 34 (1) (2020)
Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
Shared vs Private Randomness in Distributed Interactive Proofs. CoRR (2020)
Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Eric Rémila, Ioan Todinca
Local Certification of Graphs with Bounded Genus. CoRR (2020)
Pierre Fraigniaud, Pedro Montealegre, Rotem Oshman, Ivan Rapaport, Ioan Todinca
On Distributed Merlin-Arthur Decision Protocols. SIROCCO (2019)
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)
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)
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)
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca
Distributed Subgraph Detection. CoRR (2017)
Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca
Graph Reconstruction in the Congested Clique. CoRR (2017)
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. DISC (2016)
Pablo Moisset de Espanés, Axel Osses, Ivan Rapaport
Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case. Biosyst. 150 (2016)
Pablo Moisset de Espanés, Ivan Rapaport, Daniel Remenik, Javiera Urrutia
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model. Networks 67 (1) (2016)
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. CoRR (2016)
Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. COCOON (2016)
Florent Becker, Adrian Kosowski, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28 (3) (2015)
Jarkko Kari, Martín Matamala, Ivan Rapaport, Ville Salo
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. SIROCCO (2015)
Florent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila
Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. PODC (2015)
Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier
Strict Majority Bootstrap Percolation in the r-wheel. Inf. Process. Lett. 114 (6) (2014)
Pablo Moisset de Espanés, Ivan Rapaport
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results. Automata (2014)
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)
Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier
Strict majority bootstrap percolation in the r-wheel. CoRR (2013)
Cristian Calude, Bruno Durand, Anahí Gajardo, Dominique Perrin, Ivan Rapaport, Sergio Rica
Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. 504 (2013)
Raimundo Briceño, Ivan Rapaport
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata. Theor. Comput. Sci. 468 (2013)
Nicolas Nisse, Ivan Rapaport, Karol Suchan
Distributed computing of efficient routing schemes in generalized chordal graphs. Theor. Comput. Sci. 444 (2012)
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
Allowing each node to communicate only once in a distributed system: shared whiteboard models. SPAA (2012)
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
Traced communication complexity of cellular automata. Theor. Comput. Sci. 412 (30) (2011)
Eric Goles Ch., Pierre Guillon, Ivan Rapaport
Traced communication complexity of cellular automata CoRR (2011)
Eric Goles Ch., A. Moreira, Ivan Rapaport
Communication complexity in number-conserving and monotone cellular automata. Theor. Comput. Sci. 412 (29) (2011)
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59 (1) (2011)
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]. Theor. Comput. Sci. 412 (52) (2011)
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
Communication complexity and intrinsic universality in cellular automata. Theor. Comput. Sci. 412 (1-2) (2011)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS (2011)
Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power CoRR (2011)
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila
Average long-lived binary consensus: Quantifying the stabilizing role played by memory. Theor. Comput. Sci. 411 (14-15) (2010)
Ivan Rapaport, Eric Rémila
Average Long-Lived Memoryless Consensus: The Three-Value Case. SIROCCO (2010)
Florent Becker, Martín Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, Ioan Todinca
Adding a referee to an interconnection network: What can(not) be computed in one round CoRR (2010)
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
Communication Complexity and Intrinsic Universality in Cellular Automata CoRR (2009)
Nicolas Nisse, Ivan Rapaport, Karol Suchan
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. SIROCCO (2009)
Ziomara P. Gerdtzen, J. Cristian Salgado, Axel Osses, Juan A. Asenjo, Ivan Rapaport, Barbara A. Andrews
Modeling heterocyst pattern formation in cyanobacteria. BMC Bioinform. 10 (S-6) (2009)
Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN (2008)
Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal proper interval completions. Inf. Process. Lett. 106 (5) (2008)
Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier
Communications in cellular automata CSP (2008)
Eric Goles Ch., Cedric Little, Ivan Rapaport
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol. ISAAC (2008)
Florent Becker, Sergio Rajsbaum, Ivan Rapaport, Eric Rémila
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. SIROCCO (2008)
Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel
Small Alliances in Graphs. MFCS (2007)
Florent Becker, Ivan Rapaport, Eric Rémila
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. FSTTCS (2006)
Ivan Rapaport, Karol Suchan, Ioan Todinca
Minimal Proper Interval Completions. WG (2006)
Christoph Dürr, Ivan Rapaport, Guillaume Theyssier
Cellular automata and communication complexity. Theor. Comput. Sci. 322 (2) (2004)
Fedor V. Fomin, Martín Matamala, Ivan Rapaport
Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45 (4) (2004)
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. 141 (1-3) (2004)
Sébastien Desreux, Martín Matamala, Ivan Rapaport, Eric Rémila
Domino tilings and related models: space of configurations of domains with holes. Theor. Comput. Sci. 319 (1-3) (2004)
Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
Tiling with bars under tomographic constraints. Theor. Comput. Sci. 290 (3) (2003)
Martín Matamala, Erich Prisner, Ivan Rapaport
k-pseudosnakes in Large Grids. LATIN (2002)
Fedor V. Fomin, Martín Matamala, Ivan Rapaport
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG (2002)
Christoph Dürr, Ivan Rapaport, Guillaume Theyssier
Cellular automata and communication complexity CoRR (2002)
Cristopher Moore, Ivan Rapaport, Eric Rémila
Tiling groups for Wang tiles. SODA (2002)
Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7 (2001)
Eric Goles Ch., Ivan Rapaport
Tiling Allowing Rotations Only. Theor. Comput. Sci. 218 (2) (1999)
Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila
Tiling with bars under tomographic constraints CoRR (1999)
Jacques Mazoyer, Ivan Rapaport
Inducing an Order on Cellular Automata by a Grouping Operation. Discret. Appl. Math. 91 (1-3) (1999)
Jacques Mazoyer, Ivan Rapaport
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. Discret. Math. 199 (1-3) (1999)
Jacques Mazoyer, Ivan Rapaport
Inducing an Order on Cellular Automata by a Grouping Operation. STACS (1998)
Jacques Mazoyer, Ivan Rapaport
and the Bottom of (CA, <=). MFCS (1998)
Eric Goles Ch., Ivan Rapaport
Complexity of Tile Rotation Problems. Theor. Comput. Sci. 188 (1-2) (1997)