- Validating Streaming XML Documents Luc Segou n
- FIRST-ORDER QUERY EVALUATION ON STRUCTURES OF BOUNDED WOJCIECH KAZANA AND LUC SEGOUFIN
- A DECIDABLE CHARACTERIZATION OF LOCALLY TESTABLE TREE THOMAS PLACE AND LUC SEGOUFIN
- Querying Spatial Databases via Topological Invariants Luc Segou n
- Reachability and Connectivity Queries in Constraint Michael Benedikty
- Expressive power of pebble automata Mikolaj Bojanczyk1,2
- TOWARDS A CHARACTERIZATION OF ORDER-INVARIANT QUERIES OVER TAME GRAPHS
- 1 Database theory: Query languages 1 Nicole Schweikardt1, Thomas Schwentick2, Luc Segoufin3 1Goethe-Universitat
- Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
- Future-looking logics on data words and trees Diego Figueira and Luc Segoufin
- Complementing deterministic tree-walking automata Anca Muscholl
- Representing and Querying XML with Incomplete Information SERGE ABITEBOUL and LUC SEGOUFIN
- On First-Order Topological Queries Martin Grohe
- When is the evaluation of conjunctive queries tractable ? Martin Grohe
- Complexity of pebble tree-walking automata Mathias Samuelides and Luc Segoufin
- Active Context-Free Games Anca Muscholl1, Thomas Schwentick2, and Luc Segoufin3
- Definable Relations and First-Order Query Languages over Strings Michael Benedikt
- Bottom-up automata on data trees and vertical XPath
- Enumeration of monadic second-order queries on trees. Wojciech Kazana and Luc Segoufin
- Active Context-Free Games Anca Muscholl1, Thomas Schwentick2, and Luc Segoufin3
- Guarded negation Vince Barany1
- FIRST-ORDER QUERY EVALUATION ON STRUCTURES OF BOUNDED WOJCIECH KAZANA AND LUC SEGOUFIN
- Constant-memory validation of streaming XML documents against DTDs
- Reachability and Connectivity Queries in Constraint Michael Benedikty
- Future-looking logics on data words and trees Diego Figueira and Luc Segoufin
- TOWARDS A CHARACTERIZATION OF ORDER-INVARIANT QUERIES OVER TAME GRAPHS
- Validating Streaming XML Documents Luc Segou n
- 1 Database theory: Query languages 1 Nicole Schweikardt1, Thomas Schwentick2, Luc Segoufin3 1Goethe-Universitat
- Enumeration of monadic second-order queries on trees WOJCIECH KAZANA and LUC SEGOUFIN
- When is the evaluation of conjunctive queries tractable ? Martin Grohe
- Unary negation Balder ten Cate1
- Transitive Closure Logic, Nested Tree Walking Automata, and XPath
- Expressive power of pebble automata Mikolaj Bojanczyk1,2
- Static Analysis of Active XML Systems Serge Abiteboul
- On First-Order Topological Queries Martin Grohe
- Locality from Circuit Lower Bounds Matthew Anderson
- Two-Variable Logic on Data Trees and XML Mikolaj Bojanczyk
- Regular tree languages definable in FO and in FOmod Michael Benedikt Luc Segoufin
- Definable Relations and First-Order Query Languages over Strings Michael Benedikt
- Piecewise testable tree languages Mikolaj Bojanczyk
- Complementing deterministic tree-walking automata Anca Muscholl
- Views and Queries: Determinacy and Rewriting Aleph One LLC
- Representing and Querying XML with Incomplete Information SERGE ABITEBOUL and LUC SEGOUFIN
- Addition-invariant FO and regularity Nicole Schweikardt
- Automata based verification over linearly ordered data domains
- Complexity of pebble tree-walking automata Mathias Samuelides and Luc Segoufin
- Querying Spatial Databases via Topological Invariants Luc Segou n
