Aurélien Lemay

According to our database1, Aurélien Lemay authored at least 35 papers between 2000 and 2017.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
gMark: Schema-Driven Generation of Graphs and Queries.
IEEE Trans. Knowl. Data Eng., 2017

gMark: Schema-Driven Generation of Graphs and Queries.
Proceedings of the 33rd IEEE International Conference on Data Engineering, 2017

2016
Generating Flexible Workloads for Graph Databases.
PVLDB, 2016

Learning Top-Down Tree Transducers with Regular Domain Inspection.
Proceedings of the 13th International Conference on Grammatical Inference, 2016

2015
Controlling Diversity in Benchmarking Graph Databases.
CoRR, 2015

Sublinear DTD Validity.
Proceedings of the Language and Automata Theory and Applications, 2015

Interactive Path Query Specification on Graph Databases.
Proceedings of the 18th International Conference on Extending Database Technology, 2015

Learning Path Queries on Graph Databases.
Proceedings of the 18th International Conference on Extending Database Technology, 2015

2014
A Paradigm for Learning Queries on Big Data.
Proceedings of the First International Workshop on Bringing the Value of "Big Data" to Users, 2014

Learning Sequential Tree-to-Word Transducers.
Proceedings of the Language and Automata Theory and Applications, 2014

2013
Approximate membership for regular languages modulo the edit distance.
Theor. Comput. Sci., 2013

Query induction with schema-guided pruning strategies.
Journal of Machine Learning Research, 2013

2012
Learning Rational Functions.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Normalization of Sequential Top-Down Tree-to-Word Transducers.
Proceedings of the Language and Automata Theory and Applications, 2011

2010
A learning algorithm for top-down XML transformations.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009
Efficient inclusion checking for deterministic tree automata and XML Schemas.
Inf. Comput., 2009

Retrieving valid matches for XML keyword search.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Equivalence of Deterministic Nested Word to Word Transducers.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Retrieving meaningful relaxed tightest fragments for XML keyword search.
Proceedings of the EDBT 2009, 2009

ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search.
Proceedings of the Database Systems for Advanced Applications, 2009

2008
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs.
Proceedings of the Language and Automata Theory and Applications, 2008

Schema-Guided Induction of Monadic Queries.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2008

2007
Interactive learning of node selecting tree transducer.
Machine Learning, 2007

2006
Identification of biRFSA languages.
Theor. Comput. Sci., 2006

Residual Finite Tree Automata
CoRR, 2006

Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2006

2004
Learning regular languages using RFSAs.
Theor. Comput. Sci., 2004

Learning Node Selecting Tree Transducer from Completely Annotated Examples.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2004

2003
Residual Finite Tree Automata.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
Residual Finite State Automata.
Fundam. Inform., 2002

Learning Probabilistic Residual Finite State Automata.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

Some Classes of Regular Languages Identifiable in the Limit from Positive Data.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001
Residual Finite State Automata.
Proceedings of the STACS 2001, 2001

Learning Regular Languages Using RFSA.
Proceedings of the Algorithmic Learning Theory, 12th International Conference, 2001

2000
Learning Regular Languages Using Non Deterministic Finite Automata.
Proceedings of the Grammatical Inference: Algorithms and Applications, 2000


  Loading...