About me
Since September 2021, I am a Ph.D. student at LaBRI, Université de Bordeaux, under the supervision of Diego Figueira and Nathanaël Fijalkow. Before that, from 2017 to 2021, I was a student at the Department of Computer Science of the École normale supérieure Paris-Saclay: I obtained the agrégation de mathématiques, an M.Ed. in Mathematics, and an M.Sc. in Computer Science.
Curriculum vitae: in French or in English.
Where to find me
You can send me an email at x@u-bordeaux.fr
where x
= remi.morvan
(in French or in English). You can also visit me in my office (number 325)
in LaBRI.
News
- January 2022: I gave a talk at the ANR Delta meeting, on Separation over infinite words slides.
- December 2021: Our paper First-order separation over countable ordinals, written with Thomas Colcombet, Sam van Gool and the package knowledge, was accepted at FoSSaCS 2022.
- October 2021: I gave a talk at the LX seminar, on First-order separation over countable ordinals slides.
- September 2021: Now a Ph.D. student at LaBRI!
Research
I am interested in automata, logics and games.
From March 2019 to July 2019, I did an internship (internship defense) at the Department of Computer Science, at the University of Warwick, under the supervision of Marcin Jurdziński, on recursive algorithms for parity games.
Then, between March 2021 and August 2021, I studied the separation of transfinite regular languages (regular languages of words indexed by countable ordinals) by first-order logic (internship defense & internship report) under the supervision of Thomas Colcombet and Sam van Gool at IRIF, Université de Paris.
Publications
Talks
| Date | Event | Title | Resources |
|---|---|---|---|
| 4 Jan. 2022 | 6th ANR Delta meeting, online | Separation over infinite words | slides |
| 7 Oct. 2021 | LX seminar, Bordeaux | First-order separation over countable ordinals | slides |
| 3 Sept. 2021 | M2 internship defense, Paris | Definability & separability of regular languages in first-order logic | slides |
| 28 June 2021 | 5th ANR Delta meeting, Paris | Universal algorithms for parity games and nested fixpoints | slides |
| 16 Sept. 2020 | Highlights 2020, online | An attractor decomposition meta-algorithm for parity games | slides |
| 4 Sept. 2019 | M1 internship defense, Cachan | Solving parity games: Universal trees and hierarchical decompositions | slides |
Teaching
In 2021–2022, I am giving exercises sessions (TD) at Université de Bordeaux for the following classes:
- Complexity and Computability (for Master 1 students) ;
- Proofs & Logics (for Bachelor 3 students) ;
- Digital literacy (for Bachelor 1 students).
In 2020–2021, I gave oral exams (khôlles) to first-year students in prépa, in mathematics, at Lycée Saint-Louis, Paris. You can download the exercises I gave, in French.