ivan rapaport
rapaport at dim.uchile.cl

associate professor
departamento de
ingeniería matemática
facultad de ciencias
físicas y matemáticas
universidad de chile

events   education





events

escuela de verano en matemáticas discretas 2014 || valparaíso, chile

workshop on algorithms and dynamics for games and optimization 2013 || playa blanca, chile

escuela de invierno en matemáticas discretas 2013 || la leonera, chile

cimpa 2013 || san luis, argentina

lagos 2013 || playa del carmen, mexico

encuentro discreto 2013 || df, mexico

escuela de primavera dim-cmm 2013 || santiago, chile

automata 2012 & jac 2012 || la marana, corsica, france

jornadas matemáticas zona sur 2012 || concepción, chile

latin 2012 || arequipa, peru

disco 2011 || valparaíso, chile

automata 2011 || santiago, chile

lagos 2011 || bariloche, argentina

jac 2010 || turku, finland

latin 2010 || oaxaca, mexico

escuela de primavera dim-cmm 2009 || santiago, chile

csp 2008 || cork, ireland

escuela de verano en matemáticas discretas 2008 || valparaíso, chile

escuela de verano en matemáticas discretas 2007 || valparaíso, chile

escuela de verano en matemáticas discretas 2006 || valparaíso, chile

escuela de verano dim-cmm 2005 || santiago, chile


education

ph.d. in computer science.
ecole normale superieure de lyon, france
(1998)

engineer. major in mathematics.
universidad de chile
(1995)


interests

discrete mathematics - theory of computing

cellular automata - distributed computing


publications

Strict majority bootstrap percolation in the r-wheel M. Kiwi , P. Moisset, I. Rapaport, S. Rica and G. Theyssier. Information Processing Letters 114/6 (2014), 277-281.

Solving the density classification problem with a large diffusion and small amplification cellular automaton. R. Briceño, P. Moisset, A. Osses and I. Rapaport. Physica D 261 (2013) 70-80.

Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata R. Briceño and I. Rapaport. Theoretical Computer Science 468 (2013) 1-11.

Allowing each node to communicate only once in a distributed system: shared whiteboard models. F. Becker, A. Kosowski, N. Nisse, I. Rapaport and K. Suchan. Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architecture (SPAA 2012), 11-17, June 25-27, 2012, Pittsburgh, Pennsylvania, USA.

Adding a referee to an interconnection network: What can(not) be computed in one round? F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan and I. Todinca. Proceedings of the 25th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2011), IEEE Computer Society (2011), 508-514, May 16-20, 2011, Anchorage, Alaska, USA.

Reconstruire un graphe en une ronde. F. Becker, M. Matamala, N. Nisse, I. Rapaport, K. Suchan and I. Todinca. Proceedings of the 13es Rencontres Francophones sur les Aspects Algorithmiques de Telecommunications (ALGOTEL 2011), May 23-26, 2011, Cap Esterel, France.

Communication complexity in number-preserving and monotone cellular automata. E. Goles, A. Moreira and I. Rapaport. Theoretical Computer Sience 412/29 (2011), 3616-3628.

Communication complexity and intrinsic universality in cellular automata. E. Goles, P.-E. Meunier, I. Rapaport and G. Theyssier. Theoretical Computer Science 412/1-2 (2011), 2-21.

Average long-lived memoryless consensus: the three-value case. I. Rapaport and E. Remila. Proceedings of the 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2010), Lecture Notes in Computer Science 6058 (2010), 114-126, June 7-11, 2010, Sirence, Turkey.

Traced communication complexity of cellular automata. E. Goles, P. Guillon and I. Rapaport. Theoretical Computer Science 412/30 (2011), 3906-3916. 15th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2009), October 10-12, 2009, Sao Jose dos Campos, Sao Paulo, Brazil.

Distributed computing of efficient routing schemes in generalized chordal graphs. N. Nisse, I. Rapaport and K. Suchan. Theoretical Computer Science 444 (2012), 17-27. 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.

Modeling heterocyst pattern formation in cyanobacteria. Z.P. Gerdtzen, J.C. Salgado, A. Osses, J.A. Asenjo, I. Rapaport and B.A. Andrews. BMC Bionformatics 2009 10(6). European Molecular Biology Network (EMBNet) Conference 2008: 20th Anniversary Celebration, September 18-20, 2008, Martina Franca, Italy.

Communications in cellular automata E. Goles, P.-E. Meunier, I. Rapaport and G. Theyssier. Electronic Proceedings of Theoretical Computer Science. International Workshop on the Complexity of Simple Programs (CSP 2008), 103-116, 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. Remila. 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 (2011) 59: 16-34. 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, Mexico.

Self-Assemblying classes of shapes, fast and with minimal number of tiles. F. Becker, E. Remila 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 diameter F. 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. Remila. Theoretical Computer Science 319 (2004), 83-101. IV Simposio Chileno de Matematicas, November 12-15, 2002,
Punta Arenas, Chile.

Tiling with bars under tomographic constraints
C. Durr, E. Goles, I. Rapaport and E. Remila. 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, Cancun, Mexico.

Tiling groups for Wang tiles C. Moore, I. Rapaport and E. Remila. 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: Journes d'Hiver a 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.

Continuous modeling of metabolic networks with gene regulation in yeast and in vivo determination of rate parameters. P. Moisset, D. Vaisman, A. Cintolesi, J. Urrutia, I. Rapaport, B.A. Andrews and J. A. Asenjo. Biotechnology and Bioengineering 2012 Sep;109(9):2325-39.

A discrete mathematical model applied to genetic regulation and metabolic networks. J.A. Asenjo, P. Ramirez, I. Rapaport, J. Aracena, E. Goles and 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.


students

antonio lizama
2013, mathematical engineering

javiera urrutia
2013, mathematical engineering

pierre-etienne meunier
2012, PhD, mathematical modeling

raimundo briceño
2011, mathematical engineering

rodolfo carvajal
2006, mathematical engineering

cristian salgado
2005, PhD, chemical engineering

cristobal rojas
2004, mathematical engineering


postdocs

kevin perrot, 2013-2014


teaching

distributed computing
2014, 2012

combinatorial optimization
2010, 2008, 2004

probability
2013, 2012, 2010, 2009, 2008, 2007, 2005, 2003, 2002

introduction to algebra
2014, 2013, 2012, 2011, 2007, 2005, 2003, 2002, 2001, 2000, 1999

linear algebra
2011, 2010, 2009, 2008, 2006, 2004, 2001, 2000, 1999

calculability and computational complexity
2006, 2003, 2001

communication complexity
2005, 2000

multivariable calculus
1999


pictures