default search action
Victor Marsault
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Claire David
, Nadime Francis
Distinct Shortest Walk Enumeration for RPQs. Proc. ACM Manag. Data 2(2): 100 (2024) - [i18]Victor Marsault:
Matching walks that are minimal with respect to edge inclusion. CoRR abs/2408.14048 (2024) - 2023
- [j7]Renzo Angles
PG-Schema: Schemas for Property Graphs. Proc. ACM Manag. Data 1(2): 198:1-198:25 (2023) - [c12]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault
A Researcher's Digest of GQL (Invited Talk). ICDT 2023: 1:1-1:22 - [c11]Claire David, Nadime Francis, Victor Marsault
Run-Based Semantics for RPQs. KR 2023: 178-187 - [c10]Nadime Francis
GPC: A Pattern Calculus for Property Graphs. PODS 2023: 241-250 - [i17]Nadime Francis, Victor Marsault:
Enumerating regular languages in radix order : Revisiting the Ackerman-Shallit algorithm. CoRR abs/2310.13309 (2023) - [i16]Claire David, Nadime Francis, Victor Marsault:
Distinct Shortest Walk Enumeration for RPQs. CoRR abs/2312.05505 (2023) - 2022
- [c9]Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault
Graph Pattern Matching in GQL and SQL/PGQ. SIGMOD Conference 2022: 2246-2258 - [i15]Nadime Francis, Amélie Gheerbrant, Paolo Guagliardo, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Liat Peterfreund, Alexandra Rogova, Domagoj Vrgoc:
GPC: A Pattern Calculus for Property Graphs. CoRR abs/2210.16580 (2022) - [i14]Renzo Angles, Angela Bonifati, Stefania Dumbrava, George Fletcher, Alastair Green, Jan Hidders, Bei Li, Leonid Libkin, Victor Marsault, Wim Martens, Filip Murlak, Stefan Plantikow, Ognjen Savkovic, Michael Schmidt, Juan Sequeda, Slawek Staworko, Dominik Tomaszuk, Hannes Voigt, Domagoj Vrgoc, Mingxi Wu, Dusan Zivkovic:
PG-Schema: Schemas for Property Graphs. CoRR abs/2211.10962 (2022) - [i13]Claire David, Victor Marsault, Nadime Francis:
Run-Based Semantics for RPQs. CoRR abs/2211.13313 (2022) - 2021
- [j6]Victor Marsault
On p/q-recognisable sets. Log. Methods Comput. Sci. 17(3) (2021) - [i12]Alin Deutsch, Nadime Francis, Alastair Green, Keith Hare, Bei Li, Leonid Libkin, Tobias Lindaaker, Victor Marsault
Graph Pattern Matching in GQL and SQL/PGQ. CoRR abs/2112.06217 (2021) - 2020
- [j5]Éric Duchêne, Victor Marsault, Aline Parreau, Michel Rigo:
Taking-and-merging games as rewrite games. Discret. Math. Theor. Comput. Sci. 22(4) (2020)
2010 – 2019
- 2019
- [j4]Victor Marsault
An efficient algorithm to decide periodicity of bbb-recognisable sets using LSDF convention. Log. Methods Comput. Sci. 15(3) (2019) - [j3]Alastair Green, Paolo Guagliardo, Leonid Libkin
Updating Graph Databases with Cypher. Proc. VLDB Endow. 12(12): 2242-2253 (2019) - [i11]Éric Duchêne, Victor Marsault
Taking-and-merging games as rewrite games. CoRR abs/1902.07011 (2019) - 2018
- [j2]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
On subtrees of the representation tree in rational base numeration systems. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [c8]Nadime Francis, Alastair Green, Paolo Guagliardo
Cypher: An Evolving Query Language for Property Graphs. SIGMOD Conference 2018: 1433-1445 - [i10]Victor Marsault
Logic characterisation of p/q-recognisable sets. CoRR abs/1801.08707 (2018) - [i9]Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Martin Schuster, Petra Selmer, Andrés Taylor:
Formal Semantics of the Language Cypher. CoRR abs/1802.09984 (2018) - 2017
- [j1]Victor Marsault, Jacques Sakarovitch:
The signature of rational languages. Theor. Comput. Sci. 658: 216-234 (2017) - [c7]Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. ICALP 2017: 118:1-118:14 - [i8]Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo:
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention. CoRR abs/1702.03715 (2017) - [i7]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
On subtrees of the representation tree in rational base numeration systems. CoRR abs/1706.08266 (2017) - [i6]Victor Marsault
An efficient algorithm to decide periodicity of b-recognisable sets using LSDF convention. CoRR abs/1708.06228 (2017) - 2016
- [b1]Victor Marsault:
Énumération et numération. (Enumeration and numeration). Télécom ParisTech, France, 2016 - [c6]Victor Marsault, Jacques Sakarovitch:
Trees and Languages with Periodic Signature. LATIN 2016: 605-618 - 2015
- [c5]Victor Marsault:
Surminimisation of Automata. DLT 2015: 352-363 - 2014
- [c4]Victor Marsault, Jacques Sakarovitch:
Breadth-First Serialisation of Trees and Rational Languages - (Short Paper). Developments in Language Theory 2014: 252-259 - [i5]Victor Marsault, Jacques Sakarovitch:
Rhythmic generation of infinite trees and languages. CoRR abs/1403.5190 (2014) - [i4]Victor Marsault, Jacques Sakarovitch:
Breadth-first serialisation of trees and rational languages. CoRR abs/1404.0798 (2014) - 2013
- [c3]Victor Marsault
On Sets of Numbers Rationally Represented in a Rational Base Number System. CAI 2013: 89-100 - [c2]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in Rational Base Number Systems. WORDS 2013: 34-45 - [c1]Victor Marsault, Jacques Sakarovitch:
Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure. Developments in Language Theory 2013: 362-373 - [i3]Victor Marsault, Jacques Sakarovitch:
Ultimate periodicity of b-recognisable sets : a quasilinear procedure. CoRR abs/1301.2691 (2013) - [i2]Shigeki Akiyama, Victor Marsault, Jacques Sakarovitch:
Auto-similarity in rational base number systems. CoRR abs/1305.6757 (2013) - 2012
- [i1]Victor Marsault
On sets of numbers rationally represented in a rational base number system. CoRR abs/1208.5412 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: