Conciliation and Consensus in Iterated Belief Merging. - Olivier Gauwin; Sébastien Konieczny; Pierre Marquis (ECSQARU, 2005)

Conciliation through Iterated Belief Merging. - Olivier Gauwin; Sébastien Konieczny; Pierre Marquis (J. Log. Comput., 2007)

Complexity of Earliest Query Answering with Streaming Tree Automata. - Olivier Gauwin; Anne-Cécile Caron; Joachim Niehren; Sophie Tison (PLAN-X, 2008)

Streaming tree automata. - Olivier Gauwin; Joachim Niehren; Yves Roos (Inf. Process. Lett., 2008)

Earliest Query Answering for Deterministic Nested Word Automata. - Olivier Gauwin; Joachim Niehren; Sophie Tison (FCT, 2009)

Bounded Delay and Concurrency for Earliest Query Answering. - Olivier Gauwin; Joachim Niehren; Sophie Tison (LATA, 2009)

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

Efficient Enumeration for Conjunctive Queries over X-underbar Structures. - Guillaume Bagan; Arnaud Durand 001; Emmanuel Filiot; Olivier Gauwin (CSL, 2010)

Streamable Fragments of Forward XPath. - Olivier Gauwin; Joachim Niehren (CIAA, 2011)

Queries on Xml streams with bounded delay and concurrency. - Olivier Gauwin; Joachim Niehren; Sophie Tison (Inf. Comput., 2011)

Visibly pushdown automata on trees: universality and u-universality - Véronique Bruyère; Marc Ducobu; Olivier Gauwin (CoRR, 2012)

An aperiodicity problem for multiwords. - Véronique Bruyère; Olivier Carton; Alexandre Decan; Olivier Gauwin; Jef Wijsen (RAIRO Theor. Informatics Appl., 2012)

Tree Automata. - Olivier Gauwin (Handbook of Finite State Based Models and Applications, 2012)

Visibly Pushdown Automata: Universality and Inclusion via Antichains. - Véronique Bruyère; Marc Ducobu; Olivier Gauwin (LATA, 2013)

From Two-Way to One-Way Finite State Transducers. - Emmanuel Filiot; Olivier Gauwin; Pierre-Alain Reynier; Frédéric Servais (LICS, 2013)

Right-Universality of Visibly Pushdown Automata. - Véronique Bruyère; Marc Ducobu; Olivier Gauwin (RV, 2013)

Reasoning on BGP routing filters using tree automata. - Caroline Battaglia; Véronique Bruyère; Olivier Gauwin; Cristel Pelsser; Bruno Quoitin (Comput. Networks, 2014)

One-way Definability of Sweeping Transducer. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (FSTTCS, 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)

Aperiodicity of Rational Functions Is PSPACE-Complete. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote (FSTTCS, 2016)

Minimizing Resources of Sweeping and Streaming String Transducers. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (ICALP, 2016)

First-order definability of rational transductions: An algebraic approach. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote (LICS, 2016)

Untwisting two-way transducers in elementary time. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (LICS, 2017)

On Canonical Models for Rational Functions over Infinite Words. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote; Anca Muscholl (FSTTCS, 2018)

One-way definability of two-way word transducers. - Félix Baschenis; Olivier Gauwin; Anca Muscholl; Gabriele Puppis (Log. Methods Comput. Sci., 2018)

Logical and Algebraic Characterizations of Rational Transductions. - Emmanuel Filiot; Olivier Gauwin; Nathan Lhote (Log. Methods Comput. Sci., 2019)

Streamability of nested word transductions. - Emmanuel Filiot; Olivier Gauwin; Pierre-Alain Reynier; Frédéric Servais (Log. Methods Comput. Sci., 2019)

Transductions: resources and characterizations. - Olivier Gauwin (2020)

Minimization of visibly pushdown automata is NP-complete. - Olivier Gauwin; Anca Muscholl; Michael Raskin (Log. Methods Comput. Sci., 2020)