Aurélien Lemay

Publication Activity (10 Years)

Years Active: 2000-2022
Publications (10 Years): 11

Top Topics

Frequent Subgraphs

Regular Expressions

Top Venues

Proc. VLDB Endow.

Publications

Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
Inference of Shape Graphs for Graph Databases. ICDT (2022)
Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
Inference of Shape Expression Schemas Typed RDF Graphs. CoRR (2021)
Paul Gallot, Aurélien Lemay, Sylvain Salvati
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. MFCS (2020)
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
gMark: Schema-Driven Generation of Graphs and Queries. ICDE (2017)
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
gMark: Schema-Driven Generation of Graphs and Queries. IEEE Trans. Knowl. Data Eng. 29 (4) (2017)
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
Generating Flexible Workloads for Graph Databases. Proc. VLDB Endow. 9 (13) (2016)
Adrien Boiret, Aurélien Lemay, Joachim Niehren
Learning Top-Down Tree Transducers with Regular Domain Inspection. ICGI (2016)
Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat
Controlling Diversity in Benchmarking Graph Databases. CoRR (2015)
Angela Bonifati, Radu Ciucanu, Aurélien Lemay
Learning Path Queries on Graph Databases. EDBT (2015)
Angela Bonifati, Radu Ciucanu, Aurélien Lemay
Interactive Path Query Specification on Graph Databases. EDBT (2015)
Antoine Ndione, Aurélien Lemay, Joachim Niehren
Sublinear DTD Validity. LATA (2015)
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
Learning Sequential Tree-to-Word Transducers. LATA (2014)
Angela Bonifati, Radu Ciucanu, Aurélien Lemay, Slawek Staworko
A Paradigm for Learning Queries on Big Data. Data4U@VLDB (2014)
Antoine Ndione, Aurélien Lemay, Joachim Niehren
Approximate membership for regular languages modulo the edit distance. Theor. Comput. Sci. 487 (2013)
Joachim Niehren, Jérôme Champavère, Aurélien Lemay, Rémi Gilleron
Query induction with schema-guided pruning strategies. J. Mach. Learn. Res. 14 (1) (2013)
Adrien Boiret, Aurélien Lemay, Joachim Niehren
Learning Rational Functions. Developments in Language Theory (2012)
Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi
Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA (2011)
Aurélien Lemay, Sebastian Maneth, Joachim Niehren
A learning algorithm for top-down XML transformations. PODS (2010)
Lingbo Kong, Rémi Gilleron, Aurélien Lemay
Retrieving meaningful relaxed tightest fragments for XML keyword search. EDBT (2009)
Lingbo Kong, Rémi Gilleron, Aurélien Lemay
ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. DASFAA (2009)
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Efficient inclusion checking for deterministic tree automata and XML Schemas. Inf. Comput. 207 (11) (2009)
Lingbo Kong, Rémi Gilleron, Aurélien Lemay
Retrieving valid matches for XML keyword search. SAC (2009)
Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
Equivalence of Deterministic Nested Word to Word Transducers. FCT (2009)
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA (2008)
Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Schema-Guided Induction of Monadic Queries. ICGI (2008)
Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren
Interactive learning of node selecting tree transducer. Mach. Learn. 66 (1) (2007)
Aurélien Lemay, Joachim Niehren, Rémi Gilleron
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI (2006)
Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
Residual Finite Tree Automata CoRR (2006)
Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte
Identification of biRFSA languages. Theor. Comput. Sci. 356 (1-2) (2006)
François Denis, Aurélien Lemay, Alain Terlutte
Learning regular languages using RFSAs. Theor. Comput. Sci. 313 (2) (2004)
Julien Carme, Aurélien Lemay, Joachim Niehren
Learning Node Selecting Tree Transducer from Completely Annotated Examples. ICGI (2004)
Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi
Residual Finite Tree Automata. Developments in Language Theory (2003)
François Denis, Aurélien Lemay, Alain Terlutte
Residual Finite State Automata. Fundam. Informaticae 51 (4) (2002)
Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont
Learning Probabilistic Residual Finite State Automata. ICGI (2002)
François Denis, Aurélien Lemay, Alain Terlutte
Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI (2002)
François Denis, Aurélien Lemay, Alain Terlutte
Learning Regular Languages Using RFSA. ALT (2001)
François Denis, Aurélien Lemay, Alain Terlutte
Residual Finite State Automata. STACS (2001)
François Denis, Aurélien Lemay, Alain Terlutte
Learning Regular Languages Using Non Deterministic Finite Automata. ICGI (2000)