| Año |
Iván Rapaport
|
| 2011 | On dissemination thresholds in regular and irregular graph classes.
Rapaport I; Suchan K; Todinca I and Verstraete J. Algorithmica 59 (1) pp. 16–34 (2011). |
| 2010 | Average long-lived binary consensus: Quantifying the stabilizing role played by memory.
Becker F; Rajsbaum S; Rapaport I; et al. Theoretical Computer Science 411(14-15) pp. 1558-1566 (2010). |
| 2010 | Communication complexity and intrinsic universality in cellular automata.
Goles E; Meunier P.E; Rapaport I and Theyssier G. Theoretical Computer Science 412 pp. 2-21 (2011).
|
| 2010 | Average long-lived memoryless consensus: the three-value case
Rapaport I; Remila E. Lecture Notes in Computer Science, Article Nº 6058; pp.114-126. (2010) |
| 2010 | Distributed computing of efficient routing schemes in generalized chordal graphs
Nisse N; Rapaport I; Suchan K; Lecture Notes in Computer Science, 5869 pp. 252-265. (2010) |
| 2010 | Average binary long-lived Consensus: quantifying the stabilizing role played by memory
Becker F; Rajsbaum S; Rapaport I; Remila E; Theoretical Computer Science 411(14-15), pp.1558-1566. (2010) |
| 2009 | Modeling heterocyst pattern formation in cyanobacteria
Gerdtzen ZP; Salgado JC; Osses A; Asenjo JA; Rapaport I; Andrews BA; BMC Bioinformatics 10(6). (2009)
|
| 2009 | Distributed computing of efficient routing schemes in generalized chordal graphs
Nisse N; Rapaport I; Suchan K; Lecture Notes in Computer Science 5869, pp. 252-265. (2009) |
| 2008 | Average binary long-lived Consensus: quantifying the stabilization role played by memory
Becker F; Rémila E; Rapaport I; Rajsbaum S; Lecture Notes in Computer Science 5058, pp. 48-60. (2008) |
| 2008 | Minimal proper interval completions
Rapaport I; Suchan K; Todinca I; Information Processing Letters 106, pp. 195-202. (2008) |
| 2008 | On dissemination thresholds in regular and irregular graph classes
Rapaport I; Suchan K; Todinca I; Verstraete J; Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN 2008), Lecture Notes in Computer Science 4957, pp. 24-35, April 7-11, 2008, Buzios, Brazil.(2008) |
| 2008 | Understanding a non-trivial cellular automaton by finding its simplest underlying communication protocol
Goles E; Little C; Rapaport I; Lecture Notes in Computer Science 5369, pp. 593-605. (2008)
|
| 2007 | A discrete mathematical model applied to genetic regulation and metabolic networks
Asenjo J; Ramírez P; Rapaport I; Aracena J; Goles E; B. Andrews. J. Microbiology and Biotechnology. Vol. 17, 3:496-510. (2007) |
| 2006 | Predicting the behaviour of proteins in hydrophobic interaction chromatography 2: Using a statistical description of their surface amino acid distribution
Rapaport I; J. Asenjo. Journal of Chromatography A. Vol. 1107. pp. 120-129. (2006) |
| 2006 | New approaches for predicting protein retention time in hydrophobic interaction chromatography
M.E. Lienqueo, A. Mahn, G. Navarro, T. Perez-Acle, C. Salgado, Rapaport I; J. Asenjo. Journal of Molecular Recognition. Vol. 19(4), pp. 260-269. (2006) |
| 2006 | Predicting the behaviour of proteins in hyrophobic interaction chromatography 1: Using the hydrophobic imbalance (HI) to describe their surface amino acid distribution
C. Salgado, Rapaport I; J. Asenjo. Journal of Chromatography A. Vol. 1107, pp. 110-119. (2006) |
| 2006 | Minimal proper interval completions
Rapaport I; K. Suchan, I. Todinca. Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006, Norway), Lecture Notes in Computer Science 4271, pp. 217-228. (2006) |
| 2006 | Self-Assemblying classes of shapes, fast and with a minimal number of tiles
F. Becker, E. Rémila, Rapaport I; Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2006, India), Lecture Notes in Computer Science 4337, pp. 45-56. (2006) |
| 2005 | Prediction of retention times of proteins in hydrophobix interaction chromatography using only their amino acid composition
C. Salgado, Rapaport I; J. Asenjo. Journal of Chromatography A. Vol. 1098, pp. 44-154. (2005) |
| 2005 | Is it possible to predict the average surface hydrophobicity of a protein using only its amino acid composition?
C. Salgado, Rapaport I; J. Asenjo. Journal of Chromatography A. Vol. 1075, pp. 133-143. (2005) |
| 2004 | Cellular automata and communication complexity
Durr C; Rapaport I; G. Theyssier. Theoretical Computer Science. Vol. 322/2, pp. 355-368. (2004) |
| 2004 | The complexity of approximation the oriented diameter of chordal graphs
F. Fomin, Matamala M; Rapaport I; Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002, Czech Republic), Lecture Notes in Computer Science 2573, pp. 211-222. (2002). Journal of Graph Theory. Vol. 45(4 |
| 2004 | AT-free graphs: linear bounds for the oriented diameter
F. Fomine, Matamala M; E. Prisner, Rapaport I; Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO 2001, Brazil). Discrete Applied Mathematics 141, pp. 135-148. (2004) |
| 2004 | Domino tilings and other physical models: space of configurations of domais with holes
S. Desreaux, Matamala M; Rapaport I; Rémila E; Theoretical Computer Science. Vol. 319, pp. 83-1001. (2004) |
| 2003 | Tiling with bars under tomographic constraints
Durr C; Goles E; Rapaport I; Rémila E; Theoretical Computer Science 290, pp. 1317-1329. (2003) |
| 2002 | Who wins Domineering on rectangular boards?
Lachmann M; Moore C; Rapaport I; In More Games of No Chance. MSRI Publications 42 (2002), pp. 307-315, Cambridge University Press. 2nd MSRI Combinatorial Games Theory Workshop, California, USA. (2000) |
| 2002 | k-Pseudosnakes in large grids
Matamala M; Prisner E; Rapaport I; Proceedings of the 5th Latin American Theoretical Informatics Symposium (LATIN 2002, Mexico), pp. 224-235. (2002) |
| 2002 | Tiling groups for Wang tiles
Moore C; Rapaport I; Rémila E; Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002, San Francisco, USA), pp. 402-411. (2002) |
| 1999 | Global fixed point attractors of circular cellular automata and periodic tilings of the plane: undecidability results
Mazoyer J; Rapaport I; Discrete Mathematics 199, pp. 103-122. Editor's Choice Edition.(1999) |
| 1999 | Tiling allowing rotations only
Goles E; Rapaport I; Theoretical Computer Science 218, pp. 285-295. (1999) |
| 1999 | Inducing an order on cellular automata by a grouping operation
Mazoyer J; Rapaport I; Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (STACS 1998), Lecture Notes in Computer Science 1373 (1998), 116-127, February 25-27, 1998, Paris, France. Discrete Applied Mathematics 91, pp, 177-19 (1999) |
| 1998 | Additive cellular automata over Zp and the bottom of (CA,
Mazoyer J; Rapaport I; Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science (MFCS 1998), Lecture Notes in Computer Science 1450, pp. 834-843, August 24-28, 1998, Brno, Czech Republic. (1998) |
| 1997 | Complexity of tile rotation problems
Goles E; Rapaport I; Theoretical Computer Science 188, pp. 129-159. (1997) |
