Ivan Rapaport

发表

Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model

Jarkko Kari, Martín Matamala, Ivan Rapaport, 2015, SIROCCO.

The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model

Ivan Rapaport, Antonio Fernández, Eric Rémila, 2016, COCOON.

Distributed Testing of Excluded Subgraphs

Ivan Rapaport, Ville Salo, Pierre Fraigniaud, 2016, DISC.

Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata

Ivan Rapaport, Raimundo Briceño, I. Rapaport, 2013, Theor. Comput. Sci..

Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs

Nicolas Nisse, Ivan Rapaport, Karol Suchan, 2009, SIROCCO.

Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast

Ivan Rapaport, Antonio Fernández, Eric Rémila, 2015, PODC.

On Dissemination Thresholds in Regular and Irregular Graph Classes

Ivan Rapaport, Jacques Verstraëte, Ioan Todinca, 2008, LATIN.

Minimal Proper Interval Completions

Ivan Rapaport, Ioan Todinca, Karol Suchan, 2006, WG.

On Dissemination Thresholds in Regular and Irregular Graph Classes

Ivan Rapaport, Jacques Verstraëte, Ioan Todinca, 2009, Algorithmica.

The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and Determinism

Ivan Rapaport, Pedro Montealegre-Barba, Florent Becker, 2014, SIROCCO.

Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory

Ivan Rapaport, Sergio Rajsbaum, Eric Rémila, 2008, SIROCCO.

Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power pdf

Nicolas Nisse, Ivan Rapaport, Adrian Kosowski, 2011, ArXiv.

Modeling heterocyst pattern formation in cyanobacteria

Ivan Rapaport, J. Cristian Salgado, Juan A. Asenjo, 2009, BMC Bioinformatics.

Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time

Ivan Rapaport, Eric Rémila, Florent Becker, 2006, FSTTCS.

Complexity of approximating the oriented diameter of chordal graphs

Martín Matamala, Ivan Rapaport, Fedor V. Fomin, 2004, J. Graph Theory.

Adding a Referee to an Interconnection Network: What Can(not) Be Computed in One Round

Nicolas Nisse, Martín Matamala, Ivan Rapaport, 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.

The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinism

Ivan Rapaport, Florent Becker, Ioan Todinca, 2015 .

Allowing each node to communicate only once in a distributed system: shared whiteboard models

Nicolas Nisse, Martín Matamala, Ivan Rapaport, 2014, Distributed Computing.

Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results

Ivan Rapaport, Pablo Moisset de Espanés, 2014, Automata.

Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case

Ivan Rapaport, Axel Osses, Pablo Moisset de Espanés, 2016, Biosyst..

Tiling Allowing Rotations Only

Ivan Rapaport, Eric Goles Ch., 1999, Theor. Comput. Sci..

Communication complexity in number-conserving and monotone cellular automata

Ivan Rapaport, Eric Goles Ch., A. Moreira, 2011, Theor. Comput. Sci..

Complexity of Tile Rotation Problems

Ivan Rapaport, Eric Goles Ch., 1997, Theor. Comput. Sci..

Minimal proper interval completions

Ivan Rapaport, Ioan Todinca, Karol Suchan, 2006, Inf. Process. Lett..

Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model

Ivan Rapaport, Daniel Remenik, Pablo Moisset de Espanés, 2016, Networks.

Tiling groups for Wang tiles

Ivan Rapaport, Cristopher Moore, Eric Rémila, 2002, SODA '02.

AT-free graphs: linear bounds for the oriented diameter

Martín Matamala, Ivan Rapaport, Fedor V. Fomin, 2004, Discret. Appl. Math..

Average Long-Lived Memoryless Consensus: The Three-Value Case

Ivan Rapaport, Eric Rémila, I. Rapaport, 2010, SIROCCO.

Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results

Ivan Rapaport, Jacques Mazoyer, 1999, Discret. Math..

Distributed computing of efficient routing schemes in generalized chordal graphs

Nicolas Nisse, Ivan Rapaport, Karol Suchan, 2009, Theor. Comput. Sci..

Small Alliances in Graphs

Martín Matamala, Ivan Rapaport, Nicolas Schabanel, 2007, MFCS.

Bilateral Orientations and Domination

Martín Matamala, Ivan Rapaport, Fedor V. Fomin, 2001, Electron. Notes Discret. Math..

Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]

Ivan Rapaport, Eric Goles Ch., Guillaume Theyssier, 2011, Theor. Comput. Sci..

Traced communication complexity of cellular automata pdf

Ivan Rapaport, Pierre Guillon, Eric Goles Ch., 2011, Theor. Comput. Sci..

Cellular automata and communication complexity

Ivan Rapaport, Christoph Dürr, Guillaume Theyssier, 2002, Theor. Comput. Sci..

k-pseudosnakes in Large Grids

Martín Matamala, Ivan Rapaport, Erich Prisner, 2002, LATIN.

Tiling with bars under tomographic constraints

Ivan Rapaport, Eric Goles Ch., Christoph Dürr, 2003, Theor. Comput. Sci..

Average long-lived binary consensus: Quantifying the stabilizing role played by memory

Ivan Rapaport, Sergio Rajsbaum, Eric Rémila, 2010, Theor. Comput. Sci..

Complexity of approximating the oriented diameter of chordal graphs

Martín Matamala, Ivan Rapaport, Fedor V. Fomin, 2004, J. Graph Theory.

Strict Majority Bootstrap Percolation in the r-wheel pdf

Ivan Rapaport, Guillaume Theyssier, Marcos A. Kiwi, 2013, Inf. Process. Lett..

Inducing an Order on Cellular Automata by a Grouping Operation

Ivan Rapaport, Jacques Mazoyer, I. Rapaport, 1998, Discret. Appl. Math..

Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model

Ivan Rapaport, Pedro Montealegre-Barba, Ioan Todinca, 2018, SIROCCO.

Domino tilings and related models: space of configurations of domains with holes

Martín Matamala, Ivan Rapaport, Eric Rémila, 2004, Theor. Comput. Sci..

Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes pdf

Ivan Rapaport, Pedro Montealegre, Benjamin Jauregui, 2021, ArXiv.

Communication complexity meets cellular automata: Necessary conditions for intrinsic universality

Ivan Rapaport, Raimundo Briceño, I. Rapaport, 2021, Nat. Comput..

Compact Distributed Certification of Planar Graphs

Ivan Rapaport, Pierre Fraigniaud, Eric Rémila, 2021, Algorithmica.

A Meta-Theorem for Distributed Certification pdf

Ivan Rapaport, Pierre Fraigniaud, Ioan Todinca, 2021, SIROCCO.

Predicting the behaviour of proteins in hydrophobic interaction chromatography. 1: Using the hydrophobic imbalance (HI) to describe their surface amino acid distribution.

Ivan Rapaport, Juan A Asenjo, J. Asenjo, 2006, Journal of chromatography. A.

Complexity of approximating the oriented diameter of chordal graphs

Martín Matamala, Ivan Rapaport, Fedor V. Fomin, 2004 .

Predicting the behaviour of proteins in hydrophobic interaction chromatography. 2. Using a statistical description of their surface amino acid distribution.

Ivan Rapaport, Juan A Asenjo, J. Asenjo, 2006, Journal of chromatography. A.

Is it possible to predict the average surface hydrophobicity of a protein using only its amino acid composition?

Ivan Rapaport, Juan A Asenjo, J. Asenjo, 2005, Journal of chromatography. A.