Man

Ivan Rapaport Zimermann

Full Professor

Universidad de Chile

Santiago, Chile

Líneas de Investigación


Discrete Mathematics; Theoretical Computer Science; Distributed Computing; Cellular Automata; Network Dynamics

Educación

  •  Computer Science, ECOLE NORMALE SUPERIEURE DE LYON. Francia, 1998
  •  Mathematical engineering, UNIVERSIDAD DE CHILE. Chile, 1995

Experiencia Académica

  •   Full Professor Full Time

    UNIVERSIDAD DE CHILE

    Physical and Mathematical Sciences

    Santiago, Chile

    2022 - A la fecha

  •   Associate Professor Full Time

    UNIVERSIDAD DE CHILE

    Physical and Mathematical Sciences

    Santiago, Chile

    1999 - 2022

Experiencia Profesional

  •   Deputy Director Part Time

    Fondef

    Santiago, Chile

    2019 - 2021

Formación de Capital Humano


Guidance of students.

1.- Laura Leal. Current. PhD thesis in Mathematical Modeling, Universidad de Chile.

2.- Diego Ramírez. Master thesis in Mathematical Modeling, Universidad de Chile, 2020. "Detecting graph classes in the distributed interactive proof model".

3.- Ian Vidal. Master thesis in Mathematical Modeling, Universidad de Chile, 2019. "Multiple Traveling Salesman Problem with handling times on paths and spiders".

4.- Sebastián Pérez. Master thesis in Mathematical Modeling, Universidad de Chile, 2017. "The denegeracy problem in the congested clique model".

5.- Javiera Urrutia. Mathematical Engineering thesis, Universidad de Chile, 2013. "Local popularity in Barabasi-Albert networks: Implications to the study of the number-in-hand multiparty model of computation".

6.- Antonio Lizama. Mathematical Engineering thesis, Universidad de Chile, 2013. "The connectivity problem in the number-in-hand computational model".

7.- Pierre-Etienne Meunier. PhD thesis in Mathematical Modeling, Universidad de Chile, 2012. "Intrinsic universality in cellular automata".

8.- Raimundo Briceño. Mathematical Engineering thesis, Universidad de Chile, 2011. "Cellular automata and communication complexity".

9.- Rodolfo Carvajal. Mathematical Engineering thesis, Universidad de Chile, 2006. "Communities in graphs".

10.- Cristian Salgado. PhD thesis in Biotechnology, Universidad de Chile, 2005. "Prediction of the behavior of proteins in hydrophobic interaction chromatography"

11.- Cristóbal Rojas. Mathematical Engineering thesis, Universidad de Chile, 2003. "DNA tiles and self-assembly".


Difusión y Transferencia


Member of Scientific Committees (Conferences).

1.- 26th International Colloquium on Structural Information and Communication Complexity SIROCCO 2019, July 1-4, 2019, L’Aquila, Italy.

2.- 20th International Conference on Distributed Computing and Networking ICDCN 2019, June 4-7, 2019, Bangalore, India.

3.- 25th International Colloquium on Structural Information and Communication Complexity SIROCCO 2018, June 18-21, 2018, Ma’ale Hahamisha, Israel.

4.- 22nd International Workshop on Cellular Automata and Discrete Complex Systems. AUTOMATA 2016, June 15-17, 2016, Zurich, Switzerland.

5.- 12th Latin American Symposium on Theoretical Informatics LATIN 2016, April 11-15, 2016, Ensenada, Mexico.

6.- 8th Latin-American Algorithms, Graphs and Optimization Symposium LAGOS 2015, May 11-15, 2015, Praia dos Fontes, Ceará, Brasil.

7.- 7th Latin-American Algorithms, Graphs and Optimization Symposium LAGOS 2013, April 22-26 de abril de 2013, Playa del Carmen, Mexico.

8.- 10th Latin American Symposium on Theoretical Informatics LATIN 2012, April 16-20, 2012, Arequipa, Peru.

9.- 6th Latin-American Algorithms, Graphs and Optimization Symposium LAGOS 2011, March 28 - Abril 1, 2011, Bariloche, Argentina.

10.- 9th Latin American Symposium on Theoretical Informatics LATIN 2010, April 19-23, 2010, Oaxaca, Mexico.

11.- 4th Latin-American Algorithms, Graphs and Optimization Symposium LAGOS 2007, 25-29 November, 2007, Puerto Varas, Chile.


Premios y Distinciones

  •   Editor's Choice Edition 1999

    Discrete Applied Mathematics

    Estados Unidos, 1999

    Global Fixed Points Attractors of Circular Cellular Automata and Periodic Tilings of the Plane: Undecidability Results


 

Article (43)

A large diffusion and small amplification dynamics for density classification on graphs
Distributed maximal independent set computation driven by finite-state dynamics
Local certification of graphs with bounded genus
A Meta-Theorem for Distributed Certification
Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes
Compact Distributed Certification of Planar Graphs
Graph reconstruction in the congested clique
THE IMPACT OF LOCALITY IN THE BROADCAST CONGESTED CLIQUE MODEL
The role of randomness in the broadcast congested clique model
Two rounds are enough for reconstructing any graph (Class) in the congested clique model
Three notes on distributed property testing
Fixed-points in random Boolean networks: The impact of parallelism in the Barabási–Albert scale-free topology case
Robust Reconstruction of Barabasi-Albert Networks in the Broadcast Congested Clique Model
Allowing each node to communicate only once in a distributed system: shared whiteboard models
Strict Majority Bootstrap Percolation in the r-wheel
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Solving the density classification problem with a large diffusion and small amplification cellular automaton
Continuous modeling of metabolic networks with gene regulation in yeast and in vivo determination of rate parameters
Distributed computing of efficient routing schemes in generalized chordal graphs
Communication complexity and intrinsic universality in cellular automata
Communication complexity in number-conserving and monotone cellular automata
On Dissemination Thresholds in Regular and Irregular Graph Classes
Traced communication complexity of cellular automata
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Modeling heterocyst pattern formation in cyanobacteria
Minimal proper interval completions
A discrete mathematical model applied to genetic regulation and metabolic networks
New approaches for predicting protein retention time in hydrophobic interaction chromatography
Predicting the behaviour of proteins in hydrophobic interaction chromatography 1: Using the hydrophobic imbalance (HI) to describe their surface amino acid distribution
Predicting the behaviour of proteins in hydrophobic interaction chromatography 2. Using a statistical description of their surface amino acid distribution
Is it possible to predict the average surface hydrophobicity of a protein using only its amino acid composition?
Prediction of retention times of proteins in hydrophobic interaction chromatography using only their amino acid composition
AT-free graphs: linear bounds for the oriented diameter
Cellular automata and communication complexity
Complexity of approximating the oriented diameter of chordal graphs
Domino tilings and related models: space of configurations of domains with holes
Tiling with bars under tomographic constraints
k-pseudosnakes in large grids
The complexity of approximating the oriented diameter of chordal graphs - (Extended abstract)
Bilateral orientations and domination
Global fixed point attractors of circular cellular automata and periodoc tilings of the plane: undecidability results
Inducing an order on cellular automata by a grouping operation
Tiling allowing rotations only

Abstract (1)

Metabolomics of recombinant yeast: Gene expression, flux analysis and a mathematical model for gene regulation of metabolism

ConferencePaper (13)

On distributed merlin-arthur decision protocols
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model
Distributed testing of excluded subgraphs
The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model
Brief announcement: A hierarchy of congested clique models, from broadcast to unicast
Solving the induced subgraph problem in the randomized multiparty simultaneous messages model
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
Allowing each node to communicate only once in a distributed system: Shared whiteboard models
Adding a referee to an interconnection network: What can(not) be computed in one round
Average Long-Lived Memory less Consensus: The Three-Value Case
Average long-lived memoryless consensus: The three-value case
Small alliances in graphs
Tiling groups for Wang tiles

Errata (1)

Communication Complexity and Intrinsic Universality in Cellular Automata (vol 412, pg 2, 2011)

Proyecto (13)

Testing and Detecting Fixed Patterns in Distributed Systems (Fondecyt 1170021)
Information and Coordination in Networks (Millennium Nucleus)
Intrinsic universality and communication complexity in cellular automata
Intrinsic Universality in Cellular Automata (Fondecyt 1130061)
Understanding Cellular Automata: A Communication Complexity Perspective (Fondecyt 1090156)
Understanding cellular automata=> a communication complexity perspetive
Networks (Conicyt Program Anillo)
Networks in mathematics and engineering sciences
Tilings=> flips and self-assembly
Cellular automata, tilings and graphs
Cellular Automata, Tilings and Graphs (Fondecyt 1020611)
Cellular automata and tilings
Cellular Automata and Tilings (Fondecyt 1990611)
60
Ivan Rapaport

Full Professor

Mathematical Engineering

Universidad de Chile

Santiago, Chile

10
Pedro Montealegre

Profesor Asistente

Universidad Adolfo Ibáñez

santiago, Chile

9
Juan Asenjo

Professor

CHEMICAL AND BIOTECHNOLOGY ENGINEERING

University of Chile

SANTIAGO, Chile

9
martin matamala

Full Professor

Mathematical engineering

DEPARTAMENTO DE INGENIERIA MATEMATICA, FACULTAD DE CIENCIAS FÍSICAS Y MATEMATICAS, UNIVERSIDAD DE CHILE

santiago, Chile

7
Eric Goles

Full Professor

Facultad de Ingeniería y Ciencias

Universidad Adolfo Ibáñez

Santiago, Chile

5
Karol Suchan

Profesor Asociado

Facultad de Ingeniería y Ciencias

Universidad Diego Portales

Santiago, Chile

4
Axel Osses

Profesor Titular

Departamento de Ingeniería Matemática

Universidad de Chile

Santiago, Chile

3
Barbara Andrews

FULL PROFESSOR

CHEMICAL ENGINEERING AND BIOTECHNOLOGY

UNIVERSIDAD DE CHILE

SANTIAGO, Chile

3
Pablo Moisset de Espanés

Investigador asociado

FCFM

CeBiB, Universidad de Chile

Santiago, Chile

2
Maria Lienqueo

FULL PROFESSOR

OF CHEMICAL AND BIOTECHNOLOGY ENGINEERING

UNIVERSIDAD DE CHILE

Santiago, Chile

2
Tomas Perez-Acle

Full Professor

Computational Biology Lab

Fundación Ciencia para la Vida

Santiago, Chile

1
Ziomara Gerdtzen

Profesora Asociada

Departamento de Ingeniería Química, Biotecnología y Materiales

Universidad de Chile

Santiago, Chile

1
Daniela Vaisman

Ingeniera de Proyectos

Centro de Biotecnología y Bioingeniería

Santiago, Chile

1
Julio Aracena

Full Professor

Ingeniería Martemática

Universidad de Concepción

Concepción, Chile

1
Andrés Moreira

Profesor Auxiliar

Informatica

Universidad Tecnica Federico Santa Maria

Santiago, Chile

1
Daniel Remenik

Associate Professor

Depto. de Ingeniería Matemática

Universidad de Chile

Santiago, Chile

1
ANDREA MAHN

Profesor Titular

Ingeniería Química

UNIVERSIDAD DE SANTIAGO DE CHILE

Santiago, Chile

1
José Salgado

Associate Professor

Chemical Engineering, Biotechnology and Materials

UNIVERSIDAD DE CHILE

Santiago, Chile

1
Angela Cintolesi Makuc

Postdoctorado

Centro de Modelamiento Matemático

Universidad de Chile

Santiago, Chile