This is a non-exhaustive list of my talks, usually with slides.

- 2018
- Continuous models of computation: computability, complexity, universality

École Normale SupérieureÉcole Normale Supérieure, Paris, 28 October 2018

45 min

- Strong Turing Completeness of Continuous Chemical Reaction Networks

IRIFInstitut de recherche en informatique fondamentale (IRIF), Paris, 15 October 2018

30 min

- Dynamical Systems: Computability, Verification, Analysis

WENDYWorkshop on Emergent Algorithms and Network Dynamics (WENDY), Paris, 10 October 2018

45 min

- Continuous models of computation: computability, complexity, universality

HighlightsHighlights of Logic, Games and Automata, Berlin, 21 September 2018

40 min

- Polynomial Invariants for Affine Programs

LICSLogic in Computer Science (LICS), Oxford, 10 July 2018

20 min

- A Truly Universal Polynomial Differential Equation

CUNY Kolchin Seminar in Differential AlgebraCUNY Kolchin Seminar in Differential Algebra, New-York, 11 May 2018

1:30

- Computational complexity of solving polynomial differential equations over unbounded domains

Joint CUNY Graduate Center-Courant Seminar in Symbolic-Numeric ComputingJoint CUNY Graduate Center-Courant Seminar in Symbolic-Numeric Computing, New-York, 10 May 2018

1:30

- Continuous models of computation: computability, complexity, universality

LISLaboratoire d’Informatique et Systèmes (LIS), Marseille, 29 January 2018

45 min

- 2017
- Some control problems in linear dynamical systems

LSVLaboratoire Spécification et Vérification (LSV), Cachan, 5 December 2017

45 min

- Rigorous numerical computation of polynomial differential equations over unbounded domains

Dagstuhl Seminar 17481 – Reliable Computation and Complexity on the RealsDagstuhl Seminar 17481 – Reliable Computation and Complexity on the Reals, Dagstuhl, 27 November 2017

30 min

- Continuous models of computation: computability, complexity, universality

Computer Science LogicComputer Science Logic, Stockholm, 22 August 2017

45 minAckermann Award 2017

- On generable functions and a universal ordinary differential equation

CCAInternational Conference on Computability and Complexity in Analysis (CCA), Daejeon, 26 July 2017

1 hourInvited Speaker

- A universal ordinary differential equation

FoCMFoundations of Computational Mathematics (FoCM), Barcelona, 19 July 2017

25 min

- A universal ordinary differential equation

ICALPInternational Colloquium on Automata, Languages and Programming (ICALP), Varsaw, 12 July 2017

25 min

- A universal ordinary differential equation

Journées CalculabilitésJournées Calculabilités, Orléans, 14 April 2017

35 min

- Continuous models of computation: computability, complexity, universality

École Normale SupérieureÉcole Normale Supérieure, Paris, 30 March 2017

1 hour

- Solvability of Matrix-Exponential Equations

GREYCGroupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen (GREYC), Caen, 28 March 2017

45 min

- Continuous models of computation: computability, complexity, universality

LIFOLaboratoire d'Informatique Fondamentale d'Orléans (LIFO), Orléans, 21 March 2017

1 hour

- Solvability of Matrix-Exponential Equations

LORIALaboratoire lorrain de recherche en informatique et ses applications (LORIA), Nancy, 2 March 2017

45 min

- 2016
- Solvability of Matrix-Exponential Equations

LICSLogic in Computer Science (LICS), New York, 8 July 2016

25 min

- Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length

ICALPInternational Colloquium on Automata, Languages and Programming (ICALP), Rome, July 2016

25 min

- On the complexity of some reachability problems

Seminar of the LIFEWARE team

INRIAINRIA, Saclay, 8 March 2016

1 hour