default search action
Ivan Rapaport
Iván Rapaport
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j33]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. Algorithmica 86(2): 585-612 (2024) - [c39]Fedor V. Fomin
, Pierre Fraigniaud
Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. PODC 2024: 205-208 - [c38]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 - [i23]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
- [j32]Laurent Feuilloley
Local certification of graphs with bounded genus. Discret. Appl. Math. 325: 9-36 (2023) - [j31]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) - [c37]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. SIROCCO 2023: 482-501 - [c36]Pierre Fraigniaud, Frédéric Mazoit
Distributed Certification for Classes of Dense Graphs. DISC 2023: 20:1-20:17 - [i22]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Energy-Efficient Distributed Algorithms for Synchronous Networks. CoRR abs/2301.11988 (2023) - [i21]Pierre Fraigniaud, Frédéric Mazoit, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
Distributed Certification for Classes of Dense Graphs. CoRR abs/2307.14292 (2023) - [i20]Benjamin Jauregui, Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Local Certification of Some Geometric Intersection Graph Classes. CoRR abs/2309.04789 (2023) - [i19]Mariana Escalante, Martín Matamala, Iván Rapaport, Paola B. Tolomei, Luis Miguel Torres:
The Minimum Clique Routing Problem on Cycles. CoRR abs/2311.10055 (2023) - [i18]David Cifuentes-Núñez, Pedro Montealegre, Ivan Rapaport:
Recognizing Hereditary Properties in the Presence of Byzantine Nodes. CoRR abs/2312.07747 (2023) - 2022
- [c35]Antonio Lizama, Ivan Rapaport:
Connectivity and Connected Components in the Number-in-Hand Computation Model. Automata and Complexity 2022: 71-74 - [c34]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 - [c33]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. SIROCCO 2022: 116-134 - [c32]Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport:
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. SIROCCO 2022: 212-233 - [c31]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 - [i17]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
- [j30]Laurent Feuilloley, Pierre Fraigniaud, Pedro Montealegre
Compact Distributed Certification of Planar Graphs. Algorithmica 83(7): 2215-2244 (2021) - [j29]Florent Becker, Pedro Montealegre
The role of randomness in the broadcast congested clique model. Inf. Comput. 281: 104669 (2021) - [j28]Raimundo Briceño, Ivan Rapaport:
Communication complexity meets cellular automata: Necessary conditions for intrinsic universality. Nat. Comput. 20(2): 307-320 (2021) - [c30]Pedro Pérez-Escalona, Ivan Rapaport, José A. Soto, Ian Vidal:
The Multiple Traveling Salesman Problem on Spiders. SOFSEM 2021: 337-348 - [c29]Pedro Montealegre
Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. SSS 2021: 395-409 - [i16]Pierre Fraigniaud, Pedro Montealegre, Ivan Rapaport, Ioan Todinca:
A Meta-Theorem for Distributed Certification. CoRR abs/2112.03195 (2021) - [i15]Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport:
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. CoRR abs/2112.03206 (2021) - 2020
- [j27]Pedro Montealegre
Graph reconstruction in the congested clique. J. Comput. Syst. Sci. 113: 1-17 (2020) - [j26]Florent Becker, Pedro Montealegre
The Impact of Locality in the Broadcast Congested Clique Model. SIAM J. Discret. Math. 34(1): 682-700 (2020) - [c28]Pedro Montealegre
Shared vs Private Randomness in Distributed Interactive Proofs. ISAAC 2020: 51:1-51:13 - [c27]Laurent Feuilloley
Compact Distributed Certification of Planar Graphs. PODC 2020: 319-328 - [i14]Laurent Feuilloley, Pierre Fraigniaud, Ivan Rapaport, Eric Rémila, Pedro Montealegre, Ioan Todinca
Compact Distributed Certification of Planar Graphs. CoRR abs/2005.05863 (2020) - [i13]Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport:
Shared vs Private Randomness in Distributed Interactive Proofs. CoRR abs/2006.16191 (2020) - [i12]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) - [i11]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
- [c26]Pierre Fraigniaud, Pedro Montealegre
On Distributed Merlin-Arthur Decision Protocols. SIROCCO 2019: 230-245 - 2018
- [c25]Florent Becker, Pedro Montealegre
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. LATIN 2018: 134-145 - [c24]Pedro Montealegre
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. SIROCCO 2018: 134-148 - 2017
- [c23]Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina
Three Notes on Distributed Property Testing. DISC 2017: 15:1-15:30 - [i10]Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, Ioan Todinca:
Graph Reconstruction in the Congested Clique. CoRR abs/1706.03107 (2017) - [i9]Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, Ioan Todinca:
Distributed Subgraph Detection. CoRR abs/1706.03996 (2017) - 2016
- [j25]Pablo Moisset de Espanés, Axel Osses
Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case. Biosyst. 150: 167-176 (2016) - [j24]Pablo Moisset de Espanés, Ivan Rapaport, Daniel Remenik
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model. Networks 67(1): 82-91 (2016) - [c22]Florent Becker, Antonio Fernández Anta
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. COCOON 2016: 182-193 - [c21]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca
Distributed Testing of Excluded Subgraphs. DISC 2016: 342-356 - [i8]Pierre Fraigniaud, Ivan Rapaport, Ville Salo, Ioan Todinca:
Distributed Testing of Excluded Subgraphs. CoRR abs/1605.03719 (2016) - 2015
- [j23]Florent Becker, Adrian Kosowski, Martín Matamala
Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Comput. 28(3): 189-200 (2015) - [c20]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: 167-169 - [c19]Jarkko Kari
Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. SIROCCO 2015: 370-384 - 2014
- [j22]Marcos A. Kiwi
Strict Majority Bootstrap Percolation in the r-wheel. Inf. Process. Lett. 114(6): 277-281 (2014) - [c18]Pablo Moisset de Espanés, Ivan Rapaport:
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results. Automata 2014: 97-105 - [c17]Florent Becker, Pedro Montealegre
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. SIROCCO 2014: 83-95 - 2013
- [j21]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: 1-11 (2013) - [j20]Cristian Calude
Discrete mathematical structures: From dynamics to complexity. Theor. Comput. Sci. 504: 3-4 (2013) - [i7]Marcos A. Kiwi, Pablo Moisset de Espanés, Ivan Rapaport, Sergio Rica, Guillaume Theyssier:
Strict majority bootstrap percolation in the r-wheel. CoRR abs/1308.3831 (2013) - 2012
- [j19]Nicolas Nisse, Ivan Rapaport
Distributed computing of efficient routing schemes in generalized chordal graphs. Theor. Comput. Sci. 444: 17-27 (2012) - [c16]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: 11-17 - 2011
- [j18]Ivan Rapaport, Karol Suchan
On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica 59(1): 16-34 (2011) - [j17]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport
Communication complexity and intrinsic universality in cellular automata. Theor. Comput. Sci. 412(1-2): 2-21 (2011) - [j16]Eric Goles Ch., Andrés Moreira, Ivan Rapaport
Communication complexity in number-conserving and monotone cellular automata. Theor. Comput. Sci. 412(29): 3616-3628 (2011) - [j15]Eric Goles Ch., Pierre Guillon
Traced communication complexity of cellular automata. Theor. Comput. Sci. 412(30): 3906-3916 (2011) - [j14]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]. Theor. Comput. Sci. 412(52): 7169-7170 (2011) - [c15]Florent Becker, Martín Matamala
Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. IPDPS 2011: 508-514 - [e1]Nazim Fatès, Eric Goles Chacc, Alejandro Maass, Ivan Rapaport:
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. DMTCS Proceedings AP, DMTCS 2011 [contents] - [i6]Eric Goles Ch., Pierre Guillon, Ivan Rapaport:
Traced communication complexity of cellular automata. CoRR abs/1102.3522 (2011) - [i5]Florent Becker, Adrian Kosowski, Nicolas Nisse, Ivan Rapaport, Karol Suchan:
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power. CoRR abs/1109.6534 (2011) - 2010
- [j13]Florent Becker, Sergio Rajsbaum
Average long-lived binary consensus: Quantifying the stabilizing role played by memory. Theor. Comput. Sci. 411(14-15): 1558-1566 (2010) - [c14]Ivan Rapaport, Eric Rémila:
Average Long-Lived Memoryless Consensus: The Three-Value Case. SIROCCO 2010: 114-126 - [i4]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 abs/1009.4447 (2010)
2000 – 2009
- 2009
- [j12]Ziomara P. Gerdtzen, J. Cristian Salgado
Modeling heterocyst pattern formation in cyanobacteria. BMC Bioinform. 10(S-6) (2009) - [c13]Nicolas Nisse, Ivan Rapaport, Karol Suchan
Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs. SIROCCO 2009: 252-265 - [i3]Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communication Complexity and Intrinsic Universality in Cellular Automata. CoRR abs/0912.1777 (2009) - 2008
- [j11]Ivan Rapaport
Minimal proper interval completions. Inf. Process. Lett. 106(5): 195-202 (2008) - [c12]Eric Goles Ch., Cedric Little
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol. ISAAC 2008: 592-604 - [c11]Ivan Rapaport, Karol Suchan
On Dissemination Thresholds in Regular and Irregular Graph Classes. LATIN 2008: 24-35 - [c10]Florent Becker, Sergio Rajsbaum
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. SIROCCO 2008: 48-60 - [c9]Eric Goles Ch., Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier:
Communications in cellular automata. CSP 2008: 81-92 - 2007
- [c8]Rodolfo Carvajal, Martín Matamala, Ivan Rapaport, Nicolas Schabanel:
Small Alliances in Graphs. MFCS 2007: 218-227 - 2006
- [c7]Florent Becker, Ivan Rapaport, Eric Rémila:
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. FSTTCS 2006: 45-56 - [c6]Ivan Rapaport, Karol Suchan
Minimal Proper Interval Completions. WG 2006: 217-228 - 2004
- [j10]Fedor V. Fomin
AT-free graphs: linear bounds for the oriented diameter. Discret. Appl. Math. 141(1-3): 135-148 (2004) - [j9]Fedor V. Fomin, Martín Matamala
Complexity of approximating the oriented diameter of chordal graphs. J. Graph Theory 45(4): 255-269 (2004) - [j8]Sébastien Desreux, Martín Matamala
Domino tilings and related models: space of configurations of domains with holes. Theor. Comput. Sci. 319(1-3): 83-101 (2004) - [j7]Christoph Dürr, Ivan Rapaport
Cellular automata and communication complexity. Theor. Comput. Sci. 322(2): 355-368 (2004) - 2003
- [j6]Christoph Dürr, Eric Goles Ch., Ivan Rapaport
Tiling with bars under tomographic constraints. Theor. Comput. Sci. 290(3): 1317-1329 (2003) - 2002
- [c5]Martín Matamala, Erich Prisner
k-pseudosnakes in Large Grids. LATIN 2002: 224-235 - [c4]Cristopher Moore, Ivan Rapaport, Eric Rémila:
Tiling groups for Wang tiles. SODA 2002: 402-411 - [c3]Fedor V. Fomin, Martín Matamala, Ivan Rapaport:
The Complexity of Approximating the Oriented Diameter of Chordal Graphs. WG 2002: 211-222 - [i2]Christoph Dürr, Ivan Rapaport, Guillaume Theyssier:
Cellular automata and communication complexity. CoRR cs.CC/0210008 (2002) - 2001
- [j5]Fedor V. Fomin
Bilateral Orientations and Domination. Electron. Notes Discret. Math. 7: 26-29 (2001)
1990 – 1999
- 1999
- [j4]Jacques Mazoyer, Ivan Rapaport
Inducing an Order on Cellular Automata by a Grouping Operation. Discret. Appl. Math. 91(1-3): 177-196 (1999) - [j3]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): 103-122 (1999) - [j2]Eric Goles Ch., Ivan Rapaport
Tiling Allowing Rotations Only. Theor. Comput. Sci. 218(2): 285-295 (1999) - [i1]Christoph Dürr, Eric Goles Ch., Ivan Rapaport, Eric Rémila:
Tiling with bars under tomographic constraints. CoRR cs.DS/9903020 (1999) - 1998
- [c2]Jacques Mazoyer, Ivan Rapaport:
Additive Cellular Automata over Zp and the Bottom of (CA, <=). MFCS 1998: 834-843 - [c1]Jacques Mazoyer, Ivan Rapaport:
Inducing an Order on Cellular Automata by a Grouping Operation. STACS 1998: 116-127 - 1997
- [j1]Eric Goles Ch., Ivan Rapaport
Complexity of Tile Rotation Problems. Theor. Comput. Sci. 188(1-2): 129-159 (1997)
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 20:10 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: