default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrien Boiret
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Adrien Boiret, Cédric Eichler, Benjamin Nguyen, Sara Taki:
Graph rewriting primitives for semantic graph databases sanitization. Comput. Sci. Inf. Syst. 21(3): 1033-1054 (2024)- [c11]Yohan Boichut, Vincent Hugot, Adrien Boiret:
SAT-Based Automated Completion for Reachability Analysis. CIAA 2024: 79-93 - 2023
- [j3]Martin Berglund, Henrik Björklund, Johanna Björklund
, Adrien Boiret:
Transduction from trees to graphs through folding. Inf. Comput. 295(Part B): 105111 (2023) - 2022
- [c10]Adrien Boiret, Cédric Eichler, Benjamin Nguyen:
Privacy Operators for Semantic Graph Databases as Graph Rewriting. ADBIS (Short Papers) 2022: 366-377 - 2021
- [c9]Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez, Jean-François Raskin:
Active Learning of Sequential Transducers with Side Information About the Domain. DLT 2021: 54-65 - [i3]Raphaël Berthon, Adrien Boiret, Guillermo A. Pérez, Jean-François Raskin:
Active Learning of Sequential Transducers with Side Information about the Domain. CoRR abs/2104.11758 (2021)
2010 – 2019
- 2019
- [j2]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for unordered trees with data constraints. J. Comput. Syst. Sci. 104: 149-164 (2019) - 2018
- [c8]Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude:
Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method". FSTTCS 2018: 48:1-48:16 - [i2]Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude:
The "Hilbert Method" for Solving Transducer Equivalence Problems. CoRR abs/1806.04361 (2018) - 2017
- [j1]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Automata for unordered trees. Inf. Comput. 253: 304-335 (2017) - [c7]Vincent Hugot, Adrien Boiret, Joachim Niehren:
Equivalence of Symbolic Tree Transducers. DLT 2017: 109-121 - 2016
- [b1]Adrien Boiret:
Normalization and Learning of Transducers on Trees and Words. (Normalisation et Apprentissage de Transducteurs d'Arbres et de Mots). Lille University of Science and Technology, France, 2016 - [c6]Adrien Boiret, Raphaela Palenta:
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time. DLT 2016: 355-367 - [c5]Adrien Boiret, Aurélien Lemay, Joachim Niehren:
Learning Top-Down Tree Transducers with Regular Domain Inspection. ICGI 2016: 54-65 - [c4]Adrien Boiret:
Normal Form on Linear Tree-to-Word Transducers. LATA 2016: 439-451 - [i1]Adrien Boiret, Raphaela Palenta:
Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time. CoRR abs/1606.03758 (2016) - 2015
- [c3]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Logics for Unordered Trees with Data Constraints on Siblings. LATA 2015: 175-187 - 2014
- [c2]Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen:
Deterministic Automata for Unordered Trees. GandALF 2014: 189-202 - 2012
- [c1]Adrien Boiret, Aurélien Lemay, Joachim Niehren:
Learning Rational Functions. Developments in Language Theory 2012: 273-283
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-09-13 01:37 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:
