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

- 2022
- On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices 20m

RPReachability Problems (RP), 18 October 2022

- The Membership Problem for Hypergeometric Sequences with Rational Parameters 20m

RPReachability Problems (RP), 17 October 2022

- Strong Turing Completeness of Continuous Chemical Reaction Networks 1h30m

University of TexasUniversity of Texas, 16 September 2022

- On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices 30m

ISSACInternational Symposium on Symbolic and Algebraic Computation (ISSAC), Lille, 6 July 2022

- Linear dynamical systems (overview, reachability, control, invariants, all-in-one) 3h

MOVEPSummer school on modelling and verification of parallel processes (MOVEP), Aalborg, 16 June 2022

- Zariski closure of finitely generated (semi)groups of matrices 45m

Workshop on Differential AlgebraWorkshop on Differential Algebra, Leibniz, 8 June 2022

- 2020
- A Survey on Analog Models of Computation (Video) 1h

CiEComputability in Europe (CiE), 30 June 2020

- Polynomial Invariants for Affine Programs 1h

IRIFInstitut de recherche en informatique fondamentale (IRIF), Paris, 6 April 2020

- A Truly Universal Polynomial Differential Equation 45m

DARTDifferential Algebra and Related Topics (DART), New-York, 14 February 2020

- Continuous models of computation: computability, complexity, universality 1h30m

IRIFInstitut de recherche en informatique fondamentale (IRIF), Paris, 27 January 2020

- 2019
- On the Decidability of Reachability in Linear Time-Invariant Systems 30m

Journées CalculabilitésJournées Calculabilités, 26 November 2019

- A (Truly) Universal Polynomial Differential Equation 45m

GT SDA2Systèmes Dynamiques, Automates et Algorithmes (GT SDA2), 21 June 2019

- A universal ordinary differential equation 1h

GT marchesGroupe de travail autour des marches dans le quart de plan (GT marches), 14 June 2019

- Continuous models of computation: computability, complexity, universality 45m

LACLLaboratoire d'Algorithmique, Complexité et Logique (LACL), Créteil, 14 June 2019

- Comment calculer avec un ordinateur analogique ? 50m

CIRMCentre International de Rencontres Mathématiques (CIRM), 7 May 2019

- Calculs analogiques: calculabilité et complexité 15m

IRIFInstitut de recherche en informatique fondamentale (IRIF), Paris, 24 April 2019

- On the Decidability of Reachability in Linear Time-Invariant Systems 25m

Hybrid Systems: Computation and Control (HSCC)International Conference on Hybrid Systems: Computation and Control (HSCC), 16 April 2019

- Continuous models of computation: computability, complexity, universality 45m

LIPNLaboratoire d'Informatique de Paris Nord (LIPN), Paris, 2 April 2019

- Continuous models of computation: computability, complexity, universality 45m

École Normale Supérieure de LyonÉcole Normale Supérieure de Lyon, Lyon, 26 March 2019

- Continuous models of computation: computability, complexity, universality 45m

IRIFInstitut de recherche en informatique fondamentale (IRIF), Paris, 21 January 2019

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

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

- Dynamical Systems: Computability, Verification, Analysis 30m

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

- Strong Turing Completeness of Continuous Chemical Reaction Networks 45m

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

- Continuous models of computation: computability, complexity, universality 40m

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

- Polynomial Invariants for Affine Programs 20m

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

- A Truly Universal Polynomial Differential Equation 1h30m

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

- Computational complexity of solving polynomial differential equations over unbounded domains 1h30m

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

- Continuous models of computation: computability, complexity, universality 45m

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

- 2017
- Some control problems in linear dynamical systems 45m

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

- Rigorous numerical computation of polynomial differential equations over unbounded domains 30m

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

- Continuous models of computation: computability, complexity, universality 45m

Computer Science LogicComputer Science Logic, Stockholm, 22 August 2017

Ackermann Award 2017

- On generable functions and a universal ordinary differential equation 1h

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

Invited Speaker

- A universal ordinary differential equation 25m

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

- A universal ordinary differential equation 25m

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

- A universal ordinary differential equation 35m

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

- Continuous models of computation: computability, complexity, universality 1h

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

- Solvability of Matrix-Exponential Equations 45m

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

- Continuous models of computation: computability, complexity, universality 1h

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

- Solvability of Matrix-Exponential Equations 45m

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

- 2016
- Solvability of Matrix-Exponential Equations 25m

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

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

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

- On the complexity of some reachability problems 1h

Seminar of the LIFEWARE team

INRIAINRIA, Saclay, 8 March 2016