( en | de | ru )

 

Disambiguation of "Lemay, Aurélien"

Author of the publication

copydeleteadd this publication to your clipboard
Interactive Path Query Specification on Graph Databases.

, , and . EDBT, page 505-508. OpenProceedings.org, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Aurélien Carlier

Aurélien Leroux

Aurélien Thierry

Aurélien Wailly

Aurélien Froger

 

Other publications of authors with the same name

Retrieving valid matches for XML keyword search., , and . SAC, page 1536-1540. ACM, (2009)Query induction with schema-guided pruning strategies., , , and . J. Mach. Learn. Res., 14 (1): 927-964 (2013)Learning Regular Languages Using RFSA., , and . ALT, volume 2225 of Lecture Notes in Computer Science, page 348-363. Springer, (2001)Learning Path Queries on Graph Databases., , and . EDBT, page 109-120. OpenProceedings.org, (2015)Residual Finite State Automata., , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 144-157. Springer, (2001)ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search., , and . DASFAA, volume 5463 of Lecture Notes in Computer Science, page 543-548. Springer, (2009)Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead., , and . MFCS, volume 170 of LIPIcs, page 38:1-38:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Learning Regular Languages Using Non Deterministic Finite Automata., , and . ICGI, volume 1891 of Lecture Notes in Computer Science, page 39-50. Springer, (2000)Residual Finite State Automata., , and . Fundam. Informaticae, 51 (4): 339-368 (2002)A Paradigm for Learning Queries on Big Data., , , and . Data4U@VLDB, page 7. ACM, (2014)