default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAurélien Lemay
Person information
- affiliation: University of Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c26]Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek
:
Inference of Shape Graphs for Graph Databases. ICDT 2022: 14:1-14:20- 2021
- [i3]Benoît Groz, Aurélien Lemay, Slawek Staworko, Piotr Wieczorek:
Inference of Shape Expression Schemas Typed RDF Graphs. CoRR abs/2107.04891 (2021) - 2020
- [c25]Paul Gallot, Aurélien Lemay, Sylvain Salvati:
Linear High-Order Deterministic Tree Transducers with Regular Look-Ahead. MFCS 2020: 38:1-38:13
2010 – 2019
- 2018
- [b1]Aurélien Lemay:
Machine Learning Techniques for Semistructured Data. (Techniques d'Apprentissage Automatique pour les Données Semistructurées). University of Lille, France, 2018 - 2017
- [j9]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): 856-869 (2017) - [c24]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: 63-64 - 2016
- [j8]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): 1457-1460 (2016) - [c23]Adrien Boiret, Aurélien Lemay, Joachim Niehren:
Learning Top-Down Tree Transducers with Regular Domain Inspection. ICGI 2016: 54-65 - 2015
- [c22]Angela Bonifati, Radu Ciucanu, Aurélien Lemay:
Learning Path Queries on Graph Databases. EDBT 2015: 109-120 - [c21]Angela Bonifati, Radu Ciucanu, Aurélien Lemay:
Interactive Path Query Specification on Graph Databases. EDBT 2015: 505-508 - [c20]Antoine Ndione, Aurélien Lemay, Joachim Niehren:
Sublinear DTD Validity. LATA 2015: 739-751 - [i2]Guillaume Bagan, Angela Bonifati, Radu Ciucanu, George H. L. Fletcher, Aurélien Lemay, Nicky Advokaat:
Controlling Diversity in Benchmarking Graph Databases. CoRR abs/1511.08386 (2015) - 2014
- [c19]Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi:
Learning Sequential Tree-to-Word Transducers. LATA 2014: 490-502 - [c18]Angela Bonifati, Radu Ciucanu, Aurélien Lemay, Slawek Staworko:
A Paradigm for Learning Queries on Big Data. Data4U@VLDB 2014: 7 - 2013
- [j7]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): 927-964 (2013) - [j6]Antoine Ndione, Aurélien Lemay, Joachim Niehren:
Approximate membership for regular languages modulo the edit distance. Theor. Comput. Sci. 487: 37-49 (2013) - 2012
- [c17]Adrien Boiret, Aurélien Lemay, Joachim Niehren:
Learning Rational Functions. Developments in Language Theory 2012: 273-283 - 2011
- [c16]Grégoire Laurence, Aurélien Lemay, Joachim Niehren, Slawek Staworko, Marc Tommasi:
Normalization of Sequential Top-Down Tree-to-Word Transducers. LATA 2011: 354-365 - 2010
- [c15]Aurélien Lemay, Sebastian Maneth, Joachim Niehren:
A learning algorithm for top-down XML transformations. PODS 2010: 285-296
2000 – 2009
- 2009
- [j5]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): 1181-1208 (2009) - [c14]Lingbo Kong, Rémi Gilleron, Aurélien Lemay:
ValidMatch: Retrieving More Reasonable SLCA-Based Result for XML Keyword Search. DASFAA 2009: 543-548 - [c13]Lingbo Kong, Rémi Gilleron, Aurélien Lemay:
Retrieving meaningful relaxed tightest fragments for XML keyword search. EDBT 2009: 815-826 - [c12]Slawomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren:
Equivalence of Deterministic Nested Word to Word Transducers. FCT 2009: 310-322 - [c11]Lingbo Kong, Rémi Gilleron, Aurélien Lemay:
Retrieving valid matches for XML keyword search. SAC 2009: 1536-1540 - 2008
- [c10]Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Schema-Guided Induction of Monadic Queries. ICGI 2008: 15-28 - [c9]Jérôme Champavère, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Efficient Inclusion Checking for Deterministic Tree Automata and DTDs. LATA 2008: 184-195 - 2007
- [j4]Julien Carme, Rémi Gilleron, Aurélien Lemay, Joachim Niehren:
Interactive learning of node selecting tree transducer. Mach. Learn. 66(1): 33-67 (2007) - 2006
- [j3]Michel Latteux, Aurélien Lemay, Yves Roos, Alain Terlutte:
Identification of biRFSA languages. Theor. Comput. Sci. 356(1-2): 212-223 (2006) - [c8]Aurélien Lemay, Joachim Niehren, Rémi Gilleron:
Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples. ICGI 2006: 253-267 - [i1]Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi:
Residual Finite Tree Automata. CoRR abs/cs/0609015 (2006) - 2004
- [j2]François Denis, Aurélien Lemay, Alain Terlutte:
Learning regular languages using RFSAs. Theor. Comput. Sci. 313(2): 267-294 (2004) - [c7]Julien Carme, Aurélien Lemay, Joachim Niehren:
Learning Node Selecting Tree Transducer from Completely Annotated Examples. ICGI 2004: 91-102 - 2003
- [c6]Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi:
Residual Finite Tree Automata. Developments in Language Theory 2003: 171-182 - 2002
- [j1]François Denis, Aurélien Lemay, Alain Terlutte:
Residual Finite State Automata. Fundam. Informaticae 51(4): 339-368 (2002) - [c5]François Denis, Aurélien Lemay, Alain Terlutte:
Some Classes of Regular Languages Identifiable in the Limit from Positive Data. ICGI 2002: 63-76 - [c4]Yann Esposito, Aurélien Lemay, François Denis, Pierre Dupont:
Learning Probabilistic Residual Finite State Automata. ICGI 2002: 77-91 - 2001
- [c3]François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using RFSA. ALT 2001: 348-363 - [c2]François Denis, Aurélien Lemay, Alain Terlutte:
Residual Finite State Automata. STACS 2001: 144-157 - 2000
- [c1]François Denis, Aurélien Lemay, Alain Terlutte:
Learning Regular Languages Using Non Deterministic Finite Automata. ICGI 2000: 39-50
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-04-24 23:03 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:
