ivan rapaport
rapaport at dim.uchile.cl
ph.d. in computer science.
école normale supérieure de lyon, france (1998).
engineer. major in mathematics.
universidad de chile (1995).
Traced communication complexity of cellular automata. E. Goles, P. Guillon and I. Rapaport. 15th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2009). To be held in October 10-12, 2009, Sao José dos Campos, Sao Paulo, Brazil.
Distributed computing of efficient routing schemes in generalized chordal graphs. N. Nisse, I. Rapaport and K. Suchan. Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009), Lecture Notes in Computer Science 5869 (2010), 252-265, May 25-27, 2009, Piran, Slovenia.
Understanding a non-trivial cellular automaton by finding its simplest underlying communication protocol E. Goles, C. Little and I. Rapaport. Proceedings of the 19th International Symposium on Algorithms and Complexity (ISAAC 2008), Lecture Notes in Computer Science 5369 (2008), 593-605, December 15-17, 2008, Gold Coast, Australia.
Communications in cellular automata E.Goles, P.-E. Meunier, I. Rapaport and G. Theyssier. To appear in the Electronic Proceedings of Theoretical Computer Science. International Workshop on the Complexity of Simple Programs (CSP08), December 6-7, 2008, Cork, Ireland.
Average binary long-lived Consensus: quantifying the stabilizing role played by memory F. Becker, S. Rajsbaum, I. Rapaport and E. Rémila. Theoretical Computer Science 411 (2010), 1558 - 1566. Proceedings of the 15th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2008), Lecture Notes in Computer Science 5058 (2008), 48-60, June 17-20, 2008, Villars-sur-Ollon, Switzerland.
On dissemination thresholds in regular and irregular graph classes I. Rapaport, K. Suchan, I. Todinca and J. Verstraete. Algorithmica, DOI: 10.1007/s00453-009-9309-0, 2009. Proceedings of the 8th Latin American Theoretical Informatics Symposium (LATIN 2008), Lecture Notes in Computer Science 4957 (2008), 24-35, April 7-11, 2008, Buzios, Brazil.
Small alliances in graphs R. Carvajal, M. Matamala, I. Rapaport and N. Schabanel. Proceedings of the 32nd Symposium on Mathematical Foundations of Computer Science (MFCS 2007), Lecture Notes in Computer Science 4708 (2007), 218-227, August 26-31, 2007, Cesky Krumlov, Czech Republic. 10th Combinatorial and Computational Aspects of Optimization, Topology and Algebra (ACCOTA 2006), December 3-6, 2006, Puerto Vallarta, México.
Self-Assemblying classes of shapes, fast and with minimal number of tiles. F. Becker, E. Rémila and I. Rapaport. Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2006), Lecture Notes in Computer Science 4337 (2006), 45-56, December 13-15, 2006, Kolkata, India.
Minimal proper interval completions I. Rapaport, K. Suchan and I. Todinca. Information Processing Letters 106 (2008), 195-202. Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2006), Lecture Notes in Computer Science 4271 (2006), 217-228, June 22-24, 2006, Bergen, Norway.The complexity of approximating the oriented diameter of chordal graphs F. Fomin, M. Matamala and I. Rapaport. Journal of Graph Theory 45(4), 2004, 255-269. Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002), Lecture Notes in Computer Science 2573 (2002), 211-222, June 13-15, 2002, Cesky Krumlov, Czech Republic.
AT-free graphs: linear bounds for the oriented diameterF. Fomin, M. Matamala, E. Prisner and I. Rapaport. Discrete Applied Mathematics 141 (2004), 135-148. Brazilian Symposium on Graphs, Algorithms and Combinatorics (GRACO 2001), March 17-19, 2001, Fortaleza, Brazil.
Cellular automata and communication complexity C. Durr, I. Rapaport and G. Theyssier. Theoretical Computer Science 322/2 (2004), 355-368.
Domino tilings and other physical models: space of configurations of domains with holes S. Desreux, M. Matamala, I. Rapaport and E. Rémila. Theoretical Computer Science 319 (2004), 83-101. IV Simposio Chileno de Matemáticas, November 12-15, 2002, Punta Arenas, Chile.
Tiling with bars under tomographic constraints C. Durr, E. Goles, I. Rapaport and E. Rémila. Theoretical Computer Science 290 (2003), 1317-1329.Who wins Domineering on rectangular boards? M. Lachmann, C. Moore and I. Rapaport. In More Games of No Chance. MSRI Publications 42 (2002), 307-315, Cambridge University Press. 2nd MSRI Combinatorial Games Theory Workshop, July 24-28, 2000, Berkeley, California, USA.
k-Pseudosnakes in large grids M. Matamala, E. Prisner and I. Rapaport. Proceedings of the 5th Latin American Theoretical Informatics Symposium (LATIN 2002), Lecture Notes in Computer Science 2286 (2002), 224-235, April 2-6, 2002, Cancún, Mexico.
Tiling groups for Wang tiles C. Moore, I. Rapaport and E. Rémila. Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), 402-411, January 6-8, 2002, San Francisco, California, USA.
Global fixed point attractors of circular cellular automata and periodic tilings of the plane: undecidability results J. Mazoyer and I. Rapaport. Discrete Mathematics 199 (1999), 103-122. Editor's Choice Edition 1999. Cellular Automata Workshop 1997, September 25-27, 1997, Gargnano, Lago di Garda, Italy. Automata '98, December 10-12, 1998, Santiago, Chile.
Tiling allowing rotations only E. Goles and I. Rapaport. Theoretical Computer Science 218 (1999), 285-295. Polyominoes, Tilings and Cellular Automata: Journés d'Hiver à Caen, January 28-31, 1997, Caen, France.
Inducing an order on cellular automata by a grouping operation J. Mazoyer and I. Rapaport. Discrete Applied Mathematics 91 (1999), 177-196. 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.
Additive cellular automata over Zp and the bottom of (CA,<) J. Mazoyer and I. Rapaport. Proceedings of the 23rd Symposium on Mathematical Foundations of Computer Science (MFCS 1998), Lecture Notes in Computer Science 1450 (1998), 834-843, August 24-28, 1998, Brno, Czech Republic.
Complexity of tile rotation problems E. Goles and I. Rapaport. Theoretical Computer Science 188 (1997), 129-159.
Modeling heterocyst pattern formation in cyanobacteria. Z.P. Gerdtzen, J.C. Salgado, A. Osses, J.A. Asenjo, I. Rapaport and B.A. Andrews. To appear in BMC Bionformatics 2009 10(6). European Molecular Biology Network (EMBNet) Conference 2008: 20th Anniversary Celebration, September 18-20, 2008, Martina Franca, Italy.
Continous modeling of metabolic networks with gene regulation: applications to native and recombinant yeast. P. Moisset, A. Cintolesi, I. Rapaport, B.A. Andrews and J.A. Asenjo. Submitted. III Escuela de Invierno en Análisis Estocástico y Aplicaciones. August 29 - September 2, 2005. Valparaíso, Chile.
A discrete mathematical model applied to genetic regulation and metabolic networks. J.A. Asenjo, P. Ramirez, I. Rapaport, J. Aracena, E. Goles y B.A. Andrews. J. Microbiology and Biotechnology Vol. 17, 2007, 3:496-510.New approaches for predicting protein retention time in hydrophobic interaction chromatography. M.E. Lienqueo, A. Mahn, G. Navarro, T. Perez-Acle, C. Salgado, I. Rapaport and J. Asenjo. Journal of Molecular Recognition 2006 Jul-Aug; 19(4): 260-269.
Predicting the behaviour of proteins in hydrophobic interacton chromatography 2: Using a statistical description of their surface amino acid distribution. C. Salgado, I. Rapaport and J. Asenjo. Journal of Chromatography A, 1107, (2006), 120-129.
Predicting the behaviour of proteins in hydrophobic interacton chromatography 1: Using the hydrophobic imbalance (HI) to describe their surface amino acid distribution. C. Salgado, I. Rapaport and J. Asenjo. Journal of Chromatography A, 1107, (2006), 110-119.
Prediction of retention times of proteins in hydrophobic interaction chromatography using only their amino acid composition C. Salgado, I. Rapaport and J. Asenjo. Journal of Chromatography A, 1098 (2005), 44-154.
Is it possible to predict the average surface hydrophobicity of a protein using only its amino acid composition? C. Salgado, I. Rapaport and J. Asenjo. Journal of Chromatography A, 1075 (2005), 133-143.
combinatorial optimization (fall 2008, 2004)
probability (fall 2010, spring 2009, 2008, 2007, 2005, 2003, 2002)introduction to algebra (fall 2007, 2005, 2003, 2002, 2001, 2000, 1999)
linear algebra (fall 2010, spring 2009, 2008, 2006, 2004, 2001, 2000, 1999)
calculability and computational complexity (fall 2006, 2003, 2001)
communication complexity (fall 2005, spring 2000)
calculus of several variables (fall 1999)
