Complexity of Tile Rotation Problems. - Eric Goles Ch.; Ivan Rapaport (Theor. Comput. Sci., 1997)

Additive Cellular Automata over Zp and the Bottom of (CA, <=). - Jacques Mazoyer; Ivan Rapaport (MFCS, 1998)

Inducing an Order on Cellular Automata by a Grouping Operation. - Jacques Mazoyer; Ivan Rapaport (Discret. Appl. Math., 1999)

Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. - Jacques Mazoyer; Ivan Rapaport (Discret. Math., 1999)

Tiling Allowing Rotations Only. - Eric Goles Ch.; Ivan Rapaport (Theor. Comput. Sci., 1999)

Bilateral Orientations and Domination. - Fedor V. Fomin; Martín Matamala; Erich Prisner; Ivan Rapaport (Electron. Notes Discret. Math., 2001)

k-pseudosnakes in Large Grids. - Martín Matamala; Erich Prisner; Ivan Rapaport (LATIN, 2002)

Tiling groups for Wang tiles. - Cristopher Moore; Ivan Rapaport; Eric Rémila (SODA, 2002)

Tiling with bars under tomographic constraints. - Christoph Dürr; Eric Goles Ch.; Ivan Rapaport; Eric Rémila (Theor. Comput. Sci., 2003)

AT-free graphs: linear bounds for the oriented diameter. - Fedor V. Fomin; Martín Matamala; Erich Prisner; Ivan Rapaport (Discret. Appl. Math., 2004)

Complexity of approximating the oriented diameter of chordal graphs. - Fedor V. Fomin; Martín Matamala; Ivan Rapaport (J. Graph Theory, 2004)

Domino tilings and related models: space of configurations of domains with holes. - Sébastien Desreux; Martín Matamala; Ivan Rapaport; Eric Rémila (Theor. Comput. Sci., 2004)

Cellular automata and communication complexity. - Christoph Dürr; Ivan Rapaport; Guillaume Theyssier (Theor. Comput. Sci., 2004)

Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time. - Florent Becker; Ivan Rapaport; Eric Rémila (FSTTCS, 2006)

Small Alliances in Graphs. - Rodolfo Carvajal; Martín Matamala; Ivan Rapaport; Nicolas Schabanel (MFCS, 2007)

Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol. - Eric Goles Ch.; Cedric Little; Ivan Rapaport (ISAAC, 2008)

Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory. - Florent Becker; Sergio Rajsbaum; Ivan Rapaport; Eric Rémila (SIROCCO, 2008)

Communications in cellular automata - Eric Goles Ch.; Pierre-Etienne Meunier; Ivan Rapaport; Guillaume Theyssier (CSP, 2008)

Minimal proper interval completions. - Ivan Rapaport; Karol Suchan; Ioan Todinca (Inf. Process. Lett., 2008)

Modeling heterocyst pattern formation in cyanobacteria. - Ziomara P. Gerdtzen; J. Cristian Salgado; Axel Osses; Juan A. Asenjo; Ivan Rapaport; Barbara A. Andrews (BMC Bioinform., 2009)

Average Long-Lived Memoryless Consensus: The Three-Value Case. - Ivan Rapaport; Eric Rémila (SIROCCO, 2010)

Average long-lived binary consensus: Quantifying the stabilizing role played by memory. - Florent Becker; Sergio Rajsbaum; Ivan Rapaport; Eric Rémila (Theor. Comput. Sci., 2010)

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round. - Florent Becker; Martín Matamala; Nicolas Nisse; Ivan Rapaport; Karol Suchan; Ioan Todinca (IPDPS, 2011)

On Dissemination Thresholds in Regular and Irregular Graph Classes. - Ivan Rapaport; Karol Suchan; Ioan Todinca; Jacques Verstraëte (Algorithmica, 2011)

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power - Florent Becker; Adrian Kosowski; Nicolas Nisse; Ivan Rapaport; Karol Suchan (CoRR, 2011)

Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]. - Eric Goles Ch.; Pierre-Etienne Meunier; Ivan Rapaport; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Traced communication complexity of cellular automata. - Eric Goles Ch.; Pierre Guillon 001; Ivan Rapaport (Theor. Comput. Sci., 2011)

Communication complexity in number-conserving and monotone cellular automata. - Eric Goles Ch.; Andrés Moreira; Ivan Rapaport (Theor. Comput. Sci., 2011)

Communication complexity and intrinsic universality in cellular automata. - Eric Goles Ch.; Pierre-Etienne Meunier; Ivan Rapaport; Guillaume Theyssier (Theor. Comput. Sci., 2011)

Allowing each node to communicate only once in a distributed system: shared whiteboard models. - Florent Becker; Adrian Kosowski; Nicolas Nisse; Ivan Rapaport; Karol Suchan (SPAA, 2012)

Distributed computing of efficient routing schemes in generalized chordal graphs. - Nicolas Nisse; Ivan Rapaport; Karol Suchan (Theor. Comput. Sci., 2012)

Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata. - Raimundo Briceño; Ivan Rapaport (Theor. Comput. Sci., 2013)

Discrete mathematical structures: From dynamics to complexity. - Cristian Calude; Bruno Durand 001; Anahí Gajardo; Dominique Perrin; Ivan Rapaport; Sergio Rica (Theor. Comput. Sci., 2013)

Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results. - Pablo Moisset de Espanés; Ivan Rapaport (Automata, 2014)

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIROCCO, 2014)

Strict Majority Bootstrap Percolation in the r-wheel. - Marcos A. Kiwi; Pablo Moisset de Espanés; Ivan Rapaport; Sergio Rica; Guillaume Theyssier (Inf. Process. Lett., 2014)

Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast. - Florent Becker; Antonio Fernández Anta; Ivan Rapaport; Eric Rémila (PODC, 2015)

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model. - Jarkko Kari; Martín Matamala; Ivan Rapaport; Ville Salo (SIROCCO, 2015)

Allowing each node to communicate only once in a distributed system: shared whiteboard models. - Florent Becker; Adrian Kosowski; Martín Matamala; Nicolas Nisse; Ivan Rapaport; Karol Suchan; Ioan Todinca (Distributed Comput., 2015)

The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model. - Florent Becker; Antonio Fernández Anta; Ivan Rapaport; Eric Rémila (COCOON, 2016)

Distributed Testing of Excluded Subgraphs. - Pierre Fraigniaud; Ivan Rapaport; Ville Salo; Ioan Todinca (DISC, 2016)

Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case. - Pablo Moisset de Espanés; Axel Osses; Ivan Rapaport (Biosyst., 2016)

Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model. - Pablo Moisset de Espanés; Ivan Rapaport; Daniel Remenik; Javiera Urrutia (Networks, 2016)

Three Notes on Distributed Property Testing. - Guy Even; Orr Fischer; Pierre Fraigniaud; Tzlil Gonen; Reut Levi; Moti Medina; Pedro Montealegre 001; Dennis Olivetti; Rotem Oshman; Ivan Rapaport; Ioan Todinca (DISC, 2017)

Distributed Subgraph Detection. - Pierre Fraigniaud; Pedro Montealegre 001; Dennis Olivetti; Ivan Rapaport; Ioan Todinca (CoRR, 2017)

The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (LATIN, 2018)

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. - Pedro Montealegre 001; Sebastian Perez-Salazar; Ivan Rapaport; Ioan Todinca (SIROCCO, 2018)

On Distributed Merlin-Arthur Decision Protocols. - Pierre Fraigniaud; Pedro Montealegre 001; Rotem Oshman; Ivan Rapaport; Ioan Todinca (SIROCCO, 2019)

Shared vs Private Randomness in Distributed Interactive Proofs. - Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (ISAAC, 2020)

Graph reconstruction in the congested clique. - Pedro Montealegre 001; Sebastian Perez-Salazar; Ivan Rapaport; Ioan Todinca (J. Comput. Syst. Sci., 2020)

The Impact of Locality in the Broadcast Congested Clique Model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIAM J. Discret. Math., 2020)

The Multiple Traveling Salesman Problem on Spiders. - Pedro Pérez-Escalona; Ivan Rapaport; José A. Soto; Ian Vidal (SOFSEM, 2021)

Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs. - Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (SSS, 2021)

Compact Distributed Certification of Planar Graphs. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Algorithmica, 2021)

The role of randomness in the broadcast congested clique model. - Florent Becker; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (Inf. Comput., 2021)

Communication complexity meets cellular automata: Necessary conditions for intrinsic universality. - Raimundo Briceño; Ivan Rapaport (Nat. Comput., 2021)

Connectivity and Connected Components in the Number-in-Hand Computation Model. - Antonio Lizama; Ivan Rapaport (Automata and Complexity, 2022)

Computing Power of Hybrid Models in Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Pablo Paredes; Ivan Rapaport; Martín Ríos-Wilson; Ioan Todinca (OPODIS, 2022)

Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes. - Benjamin Jauregui; Pedro Montealegre 001; Ivan Rapaport (SIROCCO, 2022)

Brief Announcement: Computing Power of Hybrid Models in Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Pablo Paredes; Ivan Rapaport; Martín Ríos-Wilson; Ioan Todinca (DISC, 2022)

Energy-Efficient Distributed Algorithms for Synchronous Networks. - Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (SIROCCO, 2023)

Distributed Certification for Classes of Dense Graphs. - Pierre Fraigniaud; Frédéric Mazoit; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (DISC, 2023)

Local Certification of Some Geometric Intersection Graph Classes. - Benjamin Jauregui; Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (CoRR, 2023)

The Minimum Clique Routing Problem on Cycles. - Mariana Escalante; Martín Matamala; Iván Rapaport; Paola B. Tolomei; Luis Miguel Torres (CoRR, 2023)

Recognizing Hereditary Properties in the Presence of Byzantine Nodes. - David Cifuentes-Núñez; Pedro Montealegre 001; Ivan Rapaport (CoRR, 2023)

Local certification of graphs with bounded genus. - Laurent Feuilloley; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Éric Rémila; Ioan Todinca (Discret. Appl. Math., 2023)

Distributed maximal independent set computation driven by finite-state dynamics. - Eric Goles 001; Laura Leal; Pedro Montealegre 001; Ivan Rapaport; Martín Ríos-Wilson (Int. J. Parallel Emergent Distributed Syst., 2023)

Brief Announcement: Distributed Model Checking on Graphs of Bounded Treedepth. - Fedor V. Fomin; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (PODC, 2024)

Distributed Model Checking on Graphs of Bounded Treedepth. - Fedor V. Fomin; Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (DISC, 2024)

Distributed Model Checking in Graphs Classes of Bounded Expansion. - Fedor V. Fomin; Pierre Fraigniaud; Petr A. Golovach; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (CoRR, 2024)

A Meta-Theorem for Distributed Certification. - Pierre Fraigniaud; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (Algorithmica, 2024)

Brief Announcement: Deciding FO Formulas Efficiently in Congested Networks. - Fedor V. Fomin; Pierre Fraigniaud; Petr A. Golovach; Pedro Montealegre 001; Ivan Rapaport; Ioan Todinca (PODC, 2025)

Deterministic Distributed DFS via Cycle Separators in Planar Graphs. - Benjamin Jauregui; Pedro Montealegre 001; Ivan Rapaport (PODC, 2025)

Compact distributed certification of geometric graph classes. - Benjamin Jauregui; Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (J. Comput. Syst. Sci., 2025)

Shared Versus Private Randomness in Distributed Interactive Proofs. - Pedro Montealegre 001; Diego Ramírez-Romero; Ivan Rapaport (Algorithmica, 2025)