Victor Marsault

Orcid: 0000-0002-2325-6004

According to our database1, Victor Marsault authored at least 28 papers between 2013 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distinct Shortest Walk Enumeration for RPQs.
Proc. ACM Manag. Data, 2024

Matching walks that are minimal with respect to edge inclusion.
CoRR, 2024

2023
PG-Schema: Schemas for Property Graphs.
Proc. ACM Manag. Data, 2023

Enumerating regular languages in radix order : Revisiting the Ackerman-Shallit algorithm.
CoRR, 2023

GPC: A Pattern Calculus for Property Graphs.
Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2023

Run-Based Semantics for RPQs.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

A Researcher's Digest of GQL (Invited Talk).
Proceedings of the 26th International Conference on Database Theory, 2023

2022
Graph Pattern Matching in GQL and SQL/PGQ.
Proceedings of the SIGMOD '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
On p/q-recognisable sets.
Log. Methods Comput. Sci., 2021

2020
Taking-and-merging games as rewrite games.
Discret. Math. Theor. Comput. Sci., 2020

2019
Updating Graph Databases with Cypher.
Proc. VLDB Endow., 2019

An efficient algorithm to decide periodicity of bbb-recognisable sets using LSDF convention.
Log. Methods Comput. Sci., 2019

2018
On subtrees of the representation tree in rational base numeration systems.
Discret. Math. Theor. Comput. Sci., 2018

Formal Semantics of the Language Cypher.
CoRR, 2018

Logic characterisation of p/q-recognisable sets.
CoRR, 2018

Cypher: An Evolving Query Language for Property Graphs.
Proceedings of the 2018 International Conference on Management of Data, 2018

2017
The signature of rational languages.
Theor. Comput. Sci., 2017

An efficient algorithm to decide periodicity of b-recognisable sets using LSDF convention.
CoRR, 2017

An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Énumération et numération. (Enumeration and numeration).
PhD thesis, 2016

Trees and Languages with Periodic Signature.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Surminimisation of Automata.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014
Breadth-first serialisation of trees and rational languages.
CoRR, 2014

Rhythmic generation of infinite trees and languages.
CoRR, 2014

Breadth-First Serialisation of Trees and Rational Languages - (Short Paper).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Auto-similarity in Rational Base Number Systems.
Proceedings of the Combinatorics on Words - 9th International Conference, 2013

On Sets of Numbers Rationally Represented in a Rational Base Number System.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013


  Loading...