Rémi Morvan

Contact: x@u-bordeaux.fr where x = remi.morvan

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, in the Formal Methods and Models department, in the LX and RATIO teams.

CV: in English / in French.
Contact: x@u-bordeaux.fr where x = remi.morvan (in French or in English).

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.

Open problem on the complexity of the homomorphism problem.

News

Feb. 2023: Visit @ MIMUW, Warsaw.
Dec. 2022: Elected as president of the AFoDIB (association for PhD students in computer science in Bordeaux).
Oct. 2022: Visiting Pablo Barceló, Juan L. Reutter & Miguel Romero Orth in Santiago, Chile.
July 2022: Elected as PhD. students' substitute representative at the Mathematics & Computer Science Doctoral School (EDMI) council.

Recent publications

November 2022: Approximation and Semantic Tree-width of Conjunctive Regular Path Queries,
with Diego Figueira,
ICDT 2023. arXiv
August 2022: Universal Algorithms for Parity Games and Nested Fixpoints,
with Marcin Jurdziński and K. S. Thejaswini,
Lecture Notes in Computer Science, volume 13660. doi arXiv
December 2021: First-order separation over countable ordinals,
with Thomas Colcombet and Sam van Gool,
FoSSaCS '22. doi arXiv

See all publications

Recent talks

February 2023, Verification seminar @ IRIF, Paris
Universal algorithms for parity games and nested fixpoints
January 2023, MoVe Seminar, Marseille
Approximation and semantic tree-width of Conjunctive Regular Path Queries. slides
also given at LINKS Seminar slides
and M2F Seminar slides
and journée M2F (short talk).
June 2022, Highlights '22, Paris
Quantitative algebraic characterisations on truly infinite words. slides
& Demonstration of knowledge-clustering.

See all talks

Knowledge (links)

the knowledge LaTeX package;
knowledge-clustering: an easy-to-use command-line tool to automate the use of knowledge;
knowledge-examples: a minimal example for knowledge and a tutorial for both knowledge and knowledge-clustering.

I never thought I would meet someone this excited about knowledge! Thomas C.

Talks

Approximation and semantic tree-width of conjunctive regular path queries:
12 Jan. 2023: MoVe Seminar, Marseille (50 min) slides
9 Dec. 2022: LINKS Seminar, Lille (50 min) slides
6 Dec. 2022: M2F Seminar, Bordeaux (50 min) slides
7 Oct. 2022: Journée M2F, Bordeaux (8 min) slides

Quantitative algebraic characterisations on truly infinite words:
1 July 2022: Highlights '22, Paris (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:
13 Feb 2023: Verification seminar @ IRIF, Paris (50 min)
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

2023

Approximation and Semantic Tree-width of Conjunctive Regular Path Queries,
with Diego Figueira,
ICDT 2023. arXiv

2022

Universal Algorithms for Parity Games and Nested Fixpoints,
with Marcin Jurdziński and K. S. Thejaswini,
Lecture Notes in Computer Science, volume 13660. doi arXiv

First-order separation over countable ordinals,
with Thomas Colcombet and Sam van Gool,
FoSSaCS '22. doi arXiv

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