Professional Page of Victor Marsault

Slides used in talks associated with a publication (e.g. conference proceedings) may be found in page Publications.

Introduction to querying with RPQs : semantics in theory and practice.
Long presentation. Séminaire automate. Université Paris-Cité, France. 2023-09.

Using automata to realise additions.
Short presentation. Numeration worshop. Université de Liège, Belgium. 2023-05.

Query languages for property graphs: RPQs in theory and practice.
Long presentation. Séminaire Modèle et Algorithme. Université Gustave Eiffel, Champs-sur-Marne, France. 2022-11.

Introduction to property graphs: Data model and query languages.
Keynote. Action DOING, GDR MaDICS. Université Lyon 1, France. 2022-07.

Run-based semantics for RPQs.
Lightning talk. Highlights workshop. Université Paris-Cité, France. 2022-06.

Demonstration of Awali 2.1, a library for weighted automata and transducers.
Long presentation. Séminaire automate. Université Paris-Cité, France. 2022-01.

Introduction to View-Based Query Processing.
Long presentation. Séminaire du Département de mathématiques. Université de Liège, Belgium. 2019-10.

Demonstration of Awali 1.0.
Short presentation. Free Computational Mathematics Conference. CIRM, Luminy, France. 2019-02.

Formal semantics of Cypher: towards a standard language for querying property graphs.
Long presentation. GT Alga. Inria Nord Europe, Lille, France. 2018-10.

Formal semantics of the query-language Cypher.
Long presentation. Séminaire de l'équipe Valda. DI, ENS, Paris, France. 2018-05.

Formal semantics of the query-language Cypher.
Long presentation. Séminaire automate. IRIF, Université Paris-Cité, Paris, France. 2018-04.

Formal semantics of the query-language Cypher.
Long presentation. Séminaire de l'équipe LINKS. CRIStAL, Université de Lille, France. 2018-02.

An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention.
Long presentation. Séminaire automate. IRIF, Paris, France. 2017-03.

An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention.
Short presentation. Séminaire vérification. Université Libre de Bruxelles, Belgium. 2017-02.

The Successor Function for Minimal Words in Rational Base Numeration Systems.
Long presentation. Verification Seminar. Oxford, United Kingdom. 2016-06.

Breadth-first signature and numeration systems.
Long presentation. Séminaire automate. LIAFA, Université Paris 7, Paris, France. 2014-10.

Breadth-first serialisation of trees and rational languages.
Short presentation. Journées Montoises d'informatique théorique. Nancy, France. 2014-09.

Breadth-first serialisation of trees and rational languages.
Short presentation. Numeration and Substitution workshop. Debrecen, Hungary. 2014-07.

Rational base number systems: BLIP languages and finitely generated monoids.
Long presentation. Séminaire. Rouen, France. 2014-02.

Ultimate periodicity of b-recognisable sets: a quasilinear procedure.
Long presentation. Séminaire de Mathématiques Discrètes. Université de Liège, Belgium. 2014-01.

Rhythmic generation of infinite trees and languages.
Short presentation. Journée de rentrée de l'équipe automate. Université Paris 7, France. 2013-10.

Auto-similarity in rational base number systems.
Short presentation. Automata Theory and Symbolic Dynamics Workshop. Pacific Institute for the Mathematical Sciences, Vancouver, Canada. 2013-06.

On number sets rationally represented in a rational base number system.
Short presentation. Journées Montoises d'informatique théorique. Université catholique de Louvain, Louvain-la-Neuve, Belgium. 2012-09.

Toward a strutural proof of Honkala’s theorem.
Short presentation. Journée de rentrée de l'équipe Automate. LIAFA, Université Paris 7, Paris, France. 2011-10.

Last update : 2023.09.23