default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Gauwin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[b2]Olivier Gauwin:
Transductions: resources and characterizations. University of Bordeaux, France, 2020- [j10]Olivier Gauwin, Anca Muscholl, Michael Raskin
:
Minimization of visibly pushdown automata is NP-complete. Log. Methods Comput. Sci. 16(1) (2020)
2010 – 2019
- 2019
- [j9]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. Log. Methods Comput. Sci. 15(2) (2019) - [j8]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. Log. Methods Comput. Sci. 15(4) (2019) - [i7]Olivier Gauwin, Anca Muscholl, Michael A. Raskin:
Minimization of visibly pushdown automata is NP-complete. CoRR abs/1907.09563 (2019) - 2018
- [j7]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way definability of two-way word transducers. Log. Methods Comput. Sci. 14(4) (2018) - [c17]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl:
On Canonical Models for Rational Functions over Infinite Words. FSTTCS 2018: 30:1-30:17 - 2017
- [c16]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Untwisting two-way transducers in elementary time. LICS 2017: 1-12 - [i6]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Untwisting two-way transducers in elementary time. CoRR abs/1701.02502 (2017) - [i5]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Logical and Algebraic Characterizations of Rational Transductions. CoRR abs/1705.03726 (2017) - [i4]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way definability of two-way word transducers. CoRR abs/1706.01668 (2017) - [i3]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of nested word transductions. CoRR abs/1707.00527 (2017) - 2016
- [c15]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
Aperiodicity of Rational Functions Is PSPACE-Complete. FSTTCS 2016: 13:1-13:15 - [c14]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
Minimizing Resources of Sweeping and Streaming String Transducers. ICALP 2016: 114:1-114:14 - [c13]Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
First-order definability of rational transductions: An algebraic approach. LICS 2016: 387-396 - 2015
- [j6]Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early nested word automata for XPath query answering on XML streams. Theor. Comput. Sci. 578: 100-125 (2015) - [c12]Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis:
One-way Definability of Sweeping Transducer. FSTTCS 2015: 178-191 - 2014
- [j5]Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin:
Reasoning on BGP routing filters using tree automata. Comput. Networks 65: 232-254 (2014) - 2013
- [c11]Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Visibly Pushdown Automata: Universality and Inclusion via Antichains. LATA 2013: 190-201 - [c10]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. LICS 2013: 468-477 - [c9]Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Right-Universality of Visibly Pushdown Automata. RV 2013: 76-93 - [c8]Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui:
Early Nested Word Automata for XPath Query Answering on XML Streams. CIAA 2013: 292-305 - [i2]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
From Two-Way to One-Way Finite State Transducers. CoRR abs/1301.5197 (2013) - 2012
- [j4]Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen:
An aperiodicity problem for multiwords. RAIRO Theor. Informatics Appl. 46(1): 33-50 (2012) - [r1]Olivier Gauwin:
Tree Automata. Handbook of Finite State Based Models and Applications 2012: 69-85 - [i1]Véronique Bruyère, Marc Ducobu, Olivier Gauwin:
Visibly pushdown automata on trees: universality and u-universality. CoRR abs/1205.2841 (2012) - 2011
- [j3]Olivier Gauwin, Joachim Niehren, Sophie Tison:
Queries on Xml streams with bounded delay and concurrency. Inf. Comput. 209(3): 409-442 (2011) - [c7]Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais:
Streamability of Nested Word Transductions. FSTTCS 2011: 312-324 - [c6]Olivier Gauwin, Joachim Niehren:
Streamable Fragments of Forward XPath. CIAA 2011: 3-15 - 2010
- [c5]Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin:
Efficient Enumeration for Conjunctive Queries over X-underbar Structures. CSL 2010: 80-94
2000 – 2009
- 2009
- [b1]Olivier Gauwin:
Streaming Tree Automata and XPath. (Flux XML, Requêtes XPath et Automates). Lille University of Science and Technology, France, 2009 - [c4]Olivier Gauwin, Joachim Niehren, Sophie Tison:
Earliest Query Answering for Deterministic Nested Word Automata. FCT 2009: 121-132 - [c3]Olivier Gauwin, Joachim Niehren, Sophie Tison:
Bounded Delay and Concurrency for Earliest Query Answering. LATA 2009: 350-361 - 2008
- [j2]Olivier Gauwin, Joachim Niehren, Yves Roos:
Streaming tree automata. Inf. Process. Lett. 109(1): 13-17 (2008) - [c2]Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison:
Complexity of Earliest Query Answering with Streaming Tree Automata. PLAN-X 2008 - 2007
- [j1]Olivier Gauwin, Sébastien Konieczny, Pierre Marquis:
Conciliation through Iterated Belief Merging. J. Log. Comput. 17(5): 909-937 (2007) - 2005
- [c1]Olivier Gauwin, Sébastien Konieczny, Pierre Marquis:
Conciliation and Consensus in Iterated Belief Merging. ECSQARU 2005: 514-526
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-25 05:55 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:
