Olivier Gauwin

37 papers A* 4B 3C 5Journal 17Unranked 5
YearRankTypeTitle / Venue / Authors
2020 J jnl
Minimization of visibly pushdown automata is NP-complete.
Log. Methods Comput. Sci.
Olivier Gauwin, Anca Muscholl, Michael Raskin
2020 — book
Transductions: resources and characterizations.
Olivier Gauwin
2019 J jnl
Logical and Algebraic Characterizations of Rational Transductions.
Log. Methods Comput. Sci.
Emmanuel Filiot, Olivier Gauwin, Nathan Lhote
2019 J jnl
Minimization of visibly pushdown automata is NP-complete.
CoRR
Olivier Gauwin, Anca Muscholl, Michael A. Raskin
2019 J jnl
Streamability of nested word transductions.
Log. Methods Comput. Sci.
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2018 — conf
On Canonical Models for Rational Functions over Infinite Words.
FSTTCS
Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl
2018 J jnl
One-way definability of two-way word transducers.
Log. Methods Comput. Sci.
Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
2017 J jnl
Logical and Algebraic Characterizations of Rational Transductions.
CoRR
Emmanuel Filiot, Olivier Gauwin, Nathan Lhote
2017 J jnl
One-way definability of two-way word transducers.
CoRR
Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
2017 J jnl
Streamability of nested word transductions.
CoRR
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2017 A* conf
Untwisting two-way transducers in elementary time.
LICS
Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
2017 J jnl
Untwisting two-way transducers in elementary time.
CoRR
Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
2016 — conf
Aperiodicity of Rational Functions Is PSPACE-Complete.
FSTTCS
Emmanuel Filiot, Olivier Gauwin, Nathan Lhote
2016 A* conf
First-order definability of rational transductions: An algebraic approach.
LICS
Emmanuel Filiot, Olivier Gauwin, Nathan Lhote
2016 A* conf
Minimizing Resources of Sweeping and Streaming String Transducers.
ICALP
Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
2015 J jnl
Early nested word automata for XPath query answering on XML streams.
Theor. Comput. Sci.
Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui
2015 — conf
One-way Definability of Sweeping Transducer.
FSTTCS
Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis
2014 J jnl
Reasoning on BGP routing filters using tree automata.
Comput. Networks
Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin
2013 C conf
Early Nested Word Automata for XPath Query Answering on XML Streams.
CIAA
Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui
2013 J jnl
From Two-Way to One-Way Finite State Transducers
CoRR
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2013 A* conf
From Two-Way to One-Way Finite State Transducers.
LICS
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2013 B conf
Right-Universality of Visibly Pushdown Automata.
RV
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
2013 C conf
Visibly Pushdown Automata: Universality and Inclusion via Antichains.
LATA
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
2012 J jnl
An aperiodicity problem for multiwords.
RAIRO Theor. Informatics Appl.
Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen
2012 — ch.
Tree Automata.
Handbook of Finite State Based Models and Applications
Olivier Gauwin
2012 J jnl
Visibly pushdown automata on trees: universality and u-universality
CoRR
Véronique Bruyère, Marc Ducobu, Olivier Gauwin
2011 J jnl
Queries on Xml streams with bounded delay and concurrency.
Inf. Comput.
Olivier Gauwin, Joachim Niehren, Sophie Tison
2011 — conf
Streamability of Nested Word Transductions.
FSTTCS
Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2011 C conf
Streamable Fragments of Forward XPath.
CIAA
Olivier Gauwin, Joachim Niehren
2010 B conf
Efficient Enumeration for Conjunctive Queries over X-underbar Structures.
CSL
Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin
2009 C conf
Bounded Delay and Concurrency for Earliest Query Answering.
LATA
Olivier Gauwin, Joachim Niehren, Sophie Tison
2009 B conf
Earliest Query Answering for Deterministic Nested Word Automata.
FCT
Olivier Gauwin, Joachim Niehren, Sophie Tison
2009 — —
Streaming Tree Automata and XPath. (Flux XML, Requêtes XPath et Automates).
Olivier Gauwin
2008 — conf
Complexity of Earliest Query Answering with Streaming Tree Automata.
PLAN-X
Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison
2008 J jnl
Streaming tree automata.
Inf. Process. Lett.
Olivier Gauwin, Joachim Niehren, Yves Roos
2007 J jnl
Conciliation through Iterated Belief Merging.
J. Log. Comput.
Olivier Gauwin, Sébastien Konieczny, Pierre Marquis
2005 C conf
Conciliation and Consensus in Iterated Belief Merging.
ECSQARU
Olivier Gauwin, Sébastien Konieczny, Pierre Marquis