Olivier Gauwin

According to our database, Olivier Gauwin authored at least 29 papers between 2005 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Minimization of visibly pushdown automata is NP-complete.

Olivier Gauwin, Anca Muscholl, Michael Raskin

Log. Methods Comput. Sci., 2020

Transductions: resources and characterizations.

Olivier Gauwin

, 2020

2019

Streamability of nested word transductions.

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais

Log. Methods Comput. Sci., 2019

Logical and Algebraic Characterizations of Rational Transductions.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote

Log. Methods Comput. Sci., 2019

2018

One-way definability of two-way word transducers.

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis

Log. Methods Comput. Sci., 2018

On Canonical Models for Rational Functions over Infinite Words.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

2017

Untwisting two-way transducers in elementary time.

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016

First-order definability of rational transductions: An algebraic approach.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Minimizing Resources of Sweeping and Streaming String Transducers.

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Aperiodicity of Rational Functions Is PSPACE-Complete.

Emmanuel Filiot, Olivier Gauwin, Nathan Lhote

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Early nested word automata for XPath query answering on XML streams.

Denis Debarbieux, Olivier Gauwin, Joachim Niehren, Tom Sebastian, Mohamed Zergaoui

Theor. Comput. Sci., 2015

One-way Definability of Sweeping Transducer.

Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis

Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014

Reasoning on BGP routing filters using tree automata.

Caroline Battaglia, Véronique Bruyère, Olivier Gauwin, Cristel Pelsser, Bruno Quoitin

Comput. Networks, 2014

2013

Right-Universality of Visibly Pushdown Automata.

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

Proceedings of the Runtime Verification - 4th International Conference, 2013

From Two-Way to One-Way Finite State Transducers.

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Visibly Pushdown Automata: Universality and Inclusion via Antichains.

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

Proceedings of the Language and Automata Theory and Applications, 2013

2012

Tree Automata.

Olivier Gauwin

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

An aperiodicity problem for multiwords.

Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen

RAIRO Theor. Informatics Appl., 2012

Visibly pushdown automata on trees: universality and u-universality

Véronique Bruyère, Marc Ducobu, Olivier Gauwin

CoRR, 2012

2011

Queries on Xml streams with bounded delay and concurrency.

Olivier Gauwin, Joachim Niehren, Sophie Tison

Inf. Comput., 2011

Streamable Fragments of Forward XPath.

Olivier Gauwin, Joachim Niehren

Proceedings of the Implementation and Application of Automata, 2011

2010

Efficient Enumeration for Conjunctive Queries over X-underbar Structures.

Guillaume Bagan, Arnaud Durand, Emmanuel Filiot, Olivier Gauwin

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

2009

Streaming Tree Automata and XPath. (Flux XML, Requêtes XPath et Automates).

Olivier Gauwin

PhD thesis, 2009

Bounded Delay and Concurrency for Earliest Query Answering.

Olivier Gauwin, Joachim Niehren, Sophie Tison

Proceedings of the Language and Automata Theory and Applications, 2009

Earliest Query Answering for Deterministic Nested Word Automata.

Olivier Gauwin, Joachim Niehren, Sophie Tison

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008

Streaming tree automata.

Olivier Gauwin, Joachim Niehren, Yves Roos

Inf. Process. Lett., 2008

Complexity of Earliest Query Answering with Streaming Tree Automata.

Olivier Gauwin, Anne-Cécile Caron, Joachim Niehren, Sophie Tison

Proceedings of the PLAN-X 2008, 2008

2007

Conciliation through Iterated Belief Merging.

Olivier Gauwin, Sébastien Konieczny, Pierre Marquis

J. Log. Comput., 2007

2005

Conciliation and Consensus in Iterated Belief Merging.

Olivier Gauwin, Sébastien Konieczny, Pierre Marquis

Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005