These seminars are common with the Plume team (ENS Lyon) and are held in the seminar room, second floor of the building Le Chablais, on the Bourget-du-lac (Savoy) site or at ENS Lyon.

## Next seminar:

**Wednesday 28th February 2018 at 10h
**
Eric Goles
(Engineering Faculty of the Adolfo Ibanez University, Santiago, Chile),
*Dynamics and Complexity of Majority Automata: application to some discrete social models*

Abstract:(Hide abstracts)

A Majority Automata consists of applying over the vertices of a undirected graph (with states 0’s and 1’s) an operator that chooses the most represented state among the neighbors of a vertex. This rule is applied in parallel over all the nodes of the graph. When the graph is a regular lattice ( in one or more dimensions) it is called the Majority Cellular Automata. In this seminar we will study the computational complexity of the following prediction problem: PRED: Given an initial configuration and a specific site initially at state a ( 0 or 1), is there a time step T≥1 such that this site changes state? The complexity of PRED is characterized by the possibility to find an algorithm that give the answer faster than the running of the automata simulation in a serial computer. More precisely, if we are able to determine an algorithm running in a parallel computer in polylog time (class NC). Otherwise, the problem may be P-Complete ( one of the most dificult in class P of Polynomial problems) or … worse. We will applied this kind of results to the discrete Schelling’s segregation model. Also we will present the Sakoda’s Social Discret model.

The seminar of the team LIMD is under the responsibility of
Sebastien Tavenas.

**Settings:**
See with
increasing date
.
Hide abstracts

Other years: 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017,
all years together.

# Year 2018

**Thursday 17th May 2018 at 10h
**
Séminaire Chocola
(ENS Lyon),
*TBA*

**Thursday 5th April 2018 at 10h
**
Séminaire Chocola
(ENS Lyon),
*TBA*

**Thursday 29th March 2018 at 10h
**
Maxime Lucas
(Nantes),
*TBA*

**Thursday 22nd March 2018 at 10h
**
Oleg Karpenkov
(Department of Mathematical Sciences, University of Liverpool),
*TBA*

**Wednesday 21st March 2018 at 10h
**
Buket Eren
(Galatasaray University, Istambul, Turquie.),
*TBA*

**Thursday 15th March 2018 at 10h
**
Séminaire Chocola
(ENS Lyon),
*TBA*

**Thursday 8th March 2018 at 10h
**
Étienne Miquey
(Nantes),
*TBA*

**Wednesday 28th February 2018 at 10h
**
Eric Goles
(Engineering Faculty of the Adolfo Ibanez University, Santiago, Chile),
*Dynamics and Complexity of Majority Automata: application to some discrete social models*

Abstract:(Hide abstracts)

A Majority Automata consists of applying over the vertices of a undirected graph (with states 0’s and 1’s) an operator that chooses the most represented state among the neighbors of a vertex. This rule is applied in parallel over all the nodes of the graph. When the graph is a regular lattice ( in one or more dimensions) it is called the Majority Cellular Automata. In this seminar we will study the computational complexity of the following prediction problem: PRED: Given an initial configuration and a specific site initially at state a ( 0 or 1), is there a time step T≥1 such that this site changes state? The complexity of PRED is characterized by the possibility to find an algorithm that give the answer faster than the running of the automata simulation in a serial computer. More precisely, if we are able to determine an algorithm running in a parallel computer in polylog time (class NC). Otherwise, the problem may be P-Complete ( one of the most dificult in class P of Polynomial problems) or … worse. We will applied this kind of results to the discrete Schelling’s segregation model. Also we will present the Sakoda’s Social Discret model.

**Thursday 8th February 2018 at 10h
**
Séminaire Chocola
(ENS Lyon),
*TBA*

Abstract:(Hide abstracts)

TBA

**Thursday 1st February 2018 at 10h
**
Thomas Rubiano
(LIPN, Paris 13),
*Implicit Computational Complexity meets Compilers*

Abstract:(Hide abstracts)

Complexity theory helps us predict and control resources, usually time and space, consumed by programs. Static analysis on specific syntactic criterion allows us to categorize some programs. A common approach is to observe the program’s data’s behavior. For instance, the detection of non-size-increasing programs is based on a simple principle : counting memory allocation and deallocation, particularly in loops. This way, we can detect programs which compute within a constant amount of space. This method can easily be expressed as property on control flow graphs. Because analyses on data's behaviour are syntactic, they can be done at compile time. Because they are only static, those analyses are not always computable or easily computable and approximations need are needed. ``Size-Change Principle'' from C. S. Lee, N. D. Jones et A. M. Ben-Amram presented a method to predict termination by observing resources evolution and a lot of research came from this theory. Until now, these implicit complexity theories were essentially applied on more or less toy languages. This thesis applies implicit computational complexity methods into ``real life'' programs by manipulating intermediate representation languages in compilers. This give an accurate idea of the actual expressivity of these analyses and show that implicit computational complexity and compilers communities can fuel each other fruitfully. As we show in this thesis, the methods developed are quite generals and open the way to several new applications.

**Thursday 25th January 2018 at 10h
**
Youssef Fares
(Amiens),
*Autour de la conjecture de Poonen sur les polynômes quadratiques*

Abstract:(Hide abstracts)

Soit c un nombre rationnel. Considérons le polynôme φ(X) = X^2 - c. On s’intéressse aux cycles de φ dans Q. Plus précisément, on s’intéresse à l’une des conjectures de Poonen selon laquelle tout cycle de φ dans Q admet une longueur au plus égale à 3. Dans notre exposé, on discutera de cette conjecture et on rappellera les résultats connus. En suite, on utilisera des moyens arithmetiques, combinatoriaux et analytiques simples pour étudier des cas particuliers de ce problème. Les outils utilisés dans cet exposé sont accessibles aux étudiants de master 2.

The seminar of the team LIMD is under the responsibility of
Sebastien Tavenas.

**Settings:**
See with
increasing date
.
Hide abstracts

Other years: 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017,
all years together.