## Je soutiendrai publiquement ma thèse le jeudi 02 juillet, (plus d'infos)

## Matthieu Perrinel

Third year PhD student with Patrick Baillot in the team inside LIP (ENS Lyon).matthieu.perrinelens-lyon.org

Mon CV

matthieu.perrinelens-lyon.org

Mon CV

The focus of my work is Implicit Computational Complexity: the field whose aim is to characterize complexity classes by syntactic restrictions on a model of computation. The tools I am used to working with include: linear logic, proof-nets, interaction nets, context semantics.

- 2012, P. Lescanne, M. Perrinel [pdf]

**"Backward" coinduction, Nash equilibrium and the rationality of escalation***Acta Informatica*, May 2012, Volume 49, Issue 3, pp 117-137. - 2014, M. Perrinel [pdf]

**On paths-based criteria for polynomial time complexity in proof-nets***Post-proceedings of FOPARA (Foundations and Practice of Ressource Analysis)*(To be published). - 2014, M. Perrinel [pdf]

**Context semantics and interaction nets***Proceedings of CSL-LICS (Computer Science Logic-Logic in Computer Science)*.

- M. Perrinel [pdf]

**Stratified Nested Linear Logic** - M. Perrinel [pdf]

**Strong polynomial bound for light linear logic by levels (long version)**

- Initiation to algorithmics and programmation (L1, 28h)
- Pratice of Unix (L2, 15h)
- Foundations of Databases (L3, 37h)
- Finite Automata (L3, 25h)