Olivier Gauwin

Publication Activity (10 Years)

Years Active: 2005-2020
Publications (10 Years): 16

Top Venues

CoRR

Log. Methods Comput. Sci.

LICS

FSTTCS

Lille University of Science and Technology, France (PHD)

Education History

Lille University of Science and Technology, France

PHD

Publications

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

Olivier Gauwin.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Olivier Gauwin