Skip to content

Aurlien Lemay

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

19

Venues

13

Active years

2001–2022

Best venue rank

A*

Where they publish

Papers

19 indexed papers, newest first.

YearVenueTitleAuthors
2022ICDTInference of Shape Graphs for Graph Databases.Benot Groz, Aurlien Lemay, Slawek Staworko, Piotr Wieczorek
2020MFCSLinear High-Order Deterministic Tree Transducers with Regular Look-Ahead.Paul Gallot, Aurlien Lemay, Sylvain Salvati
2017ICDEgMark: Schema-Driven Generation of Graphs and Queries.Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurlien Lemay, Nicky Advokaat
2015EDBTLearning Path Queries on Graph Databases.Angela Bonifati, Radu Ciucanu, Aurlien Lemay
2015EDBTInteractive Path Query Specification on Graph Databases.Angela Bonifati, Radu Ciucanu, Aurlien Lemay
2015LATASublinear DTD Validity.Antoine Ndione, Aurlien Lemay, Joachim Niehren
2014LATALearning Sequential Tree-to-Word Transducers.Grgoire Laurence, Aurlien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2014VLDBA Paradigm for Learning Queries on Big Data.Angela Bonifati, Radu Ciucanu, Aurlien Lemay, Slawek Staworko
2012DLTLearning Rational Functions.Adrien Boiret, Aurlien Lemay, Joachim Niehren
2011LATANormalization of Sequential Top-Down Tree-to-Word Transducers.Grgoire Laurence, Aurlien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
2010PODSA learning algorithm for top-down XML transformations.Aurlien Lemay, Sebastian Maneth, Joachim Niehren
2009DASFAAValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search.Lingbo Kong, Rmi Gilleron, Aurlien Lemay
2009EDBTRetrieving meaningful relaxed tightest fragments for XML keyword search.Lingbo Kong, Rmi Gilleron, Aurlien Lemay
2009FCTEquivalence of Deterministic Nested Word to Word Transducers.Slawomir Staworko, Grgoire Laurence, Aurlien Lemay, Joachim Niehren
2009SACRetrieving valid matches for XML keyword search.Lingbo Kong, Rmi Gilleron, Aurlien Lemay
2008LATAEfficient Inclusion Checking for Deterministic Tree Automata and DTDs.Jrme Champavre, Rmi Gilleron, Aurlien Lemay, Joachim Niehren
2003DLTResidual Finite Tree Automata.Julien Carme, Rmi Gilleron, Aurlien Lemay, Alain Terlutte, Marc Tommasi
2001ALTLearning Regular Languages Using RFSA.Franois Denis, Aurlien Lemay, Alain Terlutte
2001STACSResidual Finite State Automata.Franois Denis, Aurlien Lemay, Alain Terlutte