Olivier Gauwin

According to our database1, Olivier Gauwin
  • authored at least 30 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Streamability of nested word transductions.
CoRR, 2017

Logical and Algebraic Characterizations of Rational Transductions.
CoRR, 2017

One-way definability of two-way word transducers.
CoRR, 2017

Untwisting two-way transducers in elementary time.
CoRR, 2017

Untwisting two-way transducers in elementary time.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
First-order definability of rational transductions: An algebraic approach.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Minimizing Resources of Sweeping and Streaming String Transducers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Aperiodicity of Rational Functions Is PSPACE-Complete.
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.
Theor. Comput. Sci., 2015

One-way Definability of Sweeping Transducer.
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.
Computer Networks, 2014

2013
From Two-Way to One-Way Finite State Transducers
CoRR, 2013

Early Nested Word Automata for XPath Query Answering on XML Streams.
Proceedings of the Implementation and Application of Automata, 2013

Right-Universality of Visibly Pushdown Automata.
Proceedings of the Runtime Verification - 4th International Conference, 2013

From Two-Way to One-Way Finite State Transducers.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Visibly Pushdown Automata: Universality and Inclusion via Antichains.
Proceedings of the Language and Automata Theory and Applications, 2013

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

An aperiodicity problem for multiwords.
RAIRO - Theor. Inf. and Applic., 2012

Visibly pushdown automata on trees: universality and u-universality
CoRR, 2012

2011
Queries on Xml streams with bounded delay and concurrency.
Inf. Comput., 2011

Streamable Fragments of Forward XPath.
Proceedings of the Implementation and Application of Automata, 2011

Streamability of Nested Word Transductions.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010
Efficient Enumeration for Conjunctive Queries over X-underbar Structures.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

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

Bounded Delay and Concurrency for Earliest Query Answering.
Proceedings of the Language and Automata Theory and Applications, 2009

Earliest Query Answering for Deterministic Nested Word Automata.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

2008
Streaming tree automata.
Inf. Process. Lett., 2008

Complexity of Earliest Query Answering with Streaming Tree Automata.
Proceedings of the PLAN-X 2008, 2008

2007
Conciliation through Iterated Belief Merging.
J. Log. Comput., 2007

2005
Conciliation and Consensus in Iterated Belief Merging.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2005


  Loading...