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.
I am a member of
the Formal Methods and
Models department, in the LX and RATIO teams.
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
and the Parisian Master of Research in Computer Science.
More info in my CV in English / in French.
I am interested in logic
and its connection with algebra,
including but not limited to automata, algebraic language theory, infinite-duration games, finite model theory and database theory.
You can contact me by email (in French or in English) at x@u-bordeaux.fr where x = remi.morvan.
News
Recent talks
-
October 2022, "Journée M2F", Bordeaux
Approximation and semantic tree-width of Conjunctive Regular Path Queries. slides
-
June 2022, Highlights '22, Paris
Quantitative algebraic characterisations on truly infinite words.
slides
& Demonstration of knowledge-clustering.
-
June 2022, EJCIM '22,
Nice
Quantitative algebraic characterisations on truly infinite words.
slides
See all talks
Knowledge
I am overly enthusiastic about Thomas Colcombet's
knowledge LaTeX package, which allows you to
easily insert internal hyperlinks in your documents: see
this example!
Together with
Thomas Colcombet and
Aliaume Lopez,
we wrote a "nifty software tool" named knowledge-clustering,
an easy-to-use command-line tool to automate the use of knowledge.
You can also find in knowledge-examples
a tutorial on how to use both knowledge and knowledge-clustering, together with basic working examples
of documents.
I never thought I would meet someone this excited about knowledge!
Thomas C.
Talks
Approximation and semantic tree-width of conjunctive regular path queries:
7 Oct. 2022: Journée M2F, Bordeaux (8 min)
slides
Quantitative algebraic characterisations on truly infinite words:
1 July 2022: Highlights '22, Nice (8 min)
slides
8 June 2022: EJCIM '22, Nice (25 min)
slides
4 Jan. 2022: 6th ANR Delta meeting, online (20 min)
slides
First-order separation over countable ordinals:
5 April 2022: FoSSaCS '22, Munich (25 min)
slides
7 Oct. 2021: LX Seminar, Bordeaux (50 min)
slides
3 Sept. 2021: M2 internship defense, Paris (20 min)
slides
Universal algorithms for parity games and nested fixpoints:
28 June 2021: 5th ANR Delta meeting, Paris (20 min)
slides
16 Sept. 2020: Highlights '20, online (5 min)
slides
4 Sept. 2019: M1 internship defense, Cachan (20 min)
slides
Publications
2022
Universal Algorithms for Parity Games and Nested Fixpoints,
with Marcin Jurdziński
and K. S. Thejaswini,
Lecture Notes in Computer Science, volume 13660.
arXiv
hal
First-order separation over countable ordinals,
with
Thomas Colcombet
and
Sam van Gool,
FoSSaCS '22.
doi
arXiv
hal
2021
First-order separation of transfinite regular languages,
Internship report, MPRI, École normale supérieure Paris-Saclay.
doi
pdf
2019
A deterministic behaviour for realistic price dynamics,
with Philippe Mathieu,
Physica A: Statistical Mechanics and its Applications.
doi
pdf
