| Publication | Date of Publication | Type |
|---|
| Dynamic constant time parallel graph algorithms with sub-linear work | 2024-12-03 | Paper |
| On the work of dynamic constant-time parallel algorithms for regular tree languages and context-free languages | 2024-12-03 | Paper |
| Work-efficient query evaluation with PRAMs | 2024-10-08 | Paper |
| Low-latency sliding window algorithms for formal languages | 2024-09-12 | Paper |
| Rewriting with acyclic queries: mind your head | 2024-04-25 | Paper |
| Rewriting with acyclic queries: mind your head | 2024-04-23 | Paper |
Rewriting with Acyclic Queries: Mind Your Head
Logical Methods in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7650849 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
Distribution Constraints: The Chase for Distributed Data
(available as arXiv preprint) | 2023-02-07 | Paper |
Algebraic and logical characterizations of deterministic linear time classes
Lecture Notes in Computer Science | 2022-11-09 | Paper |
| scientific article; zbMATH DE number 7561474 (Why is no real title available?) | 2022-07-21 | Paper |
| The Ackermann Award 2018 | 2022-05-28 | Paper |
Dynamic complexity under definable changes
ACM Transactions on Database Systems | 2021-11-25 | Paper |
| Automata and finite model theory | 2021-11-12 | Paper |
Work-sensitive dynamic complexity of formal languages
(available as arXiv preprint) | 2021-10-18 | Paper |
| A strategy for dynamic programs: start over and muddle through | 2020-05-27 | Paper |
| Winning strategies for streaming rewriting games | 2020-01-30 | Paper |
Parallel-correctness and containment for conjunctive queries with union and negation
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Reasoning about XML constraints based on XML-to-relational mappings
Theory of Computing Systems | 2019-09-05 | Paper |
A strategy for dynamic programs: start over and muddle through
(available as arXiv preprint) | 2019-05-17 | Paper |
Reachability is in DynFO
Journal of the ACM | 2019-02-25 | Paper |
Graph connectivity, monadic NP and built-in relations of moderate degree
Automata, Languages and Programming | 2019-01-10 | Paper |
Dynamic Complexity under Definable Changes
(available as arXiv preprint) | 2018-07-18 | Paper |
Parallel-correctness and transferability for conjunctive queries
Journal of the ACM | 2018-05-17 | Paper |
Conjunctive query containment over trees using schema information
Acta Informatica | 2018-02-28 | Paper |
On bijections vs. unary functions
STACS 96 | 2017-11-16 | Paper |
Games for active XML revisited
Theory of Computing Systems | 2017-09-20 | Paper |
Games for active XML revisited
Theory of Computing Systems | 2017-09-20 | Paper |
Static analysis for logic-based dynamic programs
(available as arXiv preprint) | 2017-08-31 | Paper |
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
(available as arXiv preprint) | 2017-07-14 | Paper |
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Dynamic conjunctive queries
Journal of Computer and System Sciences | 2017-06-30 | Paper |
Locality of order-invariant first-order formulas
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
| Games for active XML revisited | 2017-06-13 | Paper |
Expressiveness of hybrid temporal logic on data words
Electronic Notes in Theoretical Computer Science | 2016-10-07 | Paper |
Definable relations and first-order query languages over strings
Journal of the ACM | 2015-11-12 | Paper |
Two-variable logic on data trees and XML reasoning
Journal of the ACM | 2015-11-11 | Paper |
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM | 2015-11-11 | Paper |
Reachability is in DynFO
Automata, Languages, and Programming | 2015-11-04 | Paper |
Two-variable logic on data words
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
The dynamic complexity of formal languages
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Existential second-order logic over graphs: charting the tractability frontier
Journal of the ACM | 2015-08-01 | Paper |
When is the evaluation of conjunctive queries tractable?
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the quantifier-free dynamic complexity of reachability
Information and Computation | 2015-01-30 | Paper |
The price of query rewriting in ontology-based data access
Artificial Intelligence | 2014-06-10 | Paper |
Validity of tree pattern queries with respect to schema information
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
On the Quantifier-Free Dynamic Complexity of Reachability
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| A little bit infinite? On adding data to finitely labelled structures | 2013-03-19 | Paper |
Dynamic communicating automata and branching high-level MSCs
Language and Automata Theory and Applications | 2013-03-18 | Paper |
| Temporal logics on words with multiple data values | 2012-08-29 | Paper |
Temporal logics on words with multiple data values
(available as arXiv preprint) | 2012-08-29 | Paper |
Feasible automata for two-variable logic with successor on data words
Language and Automata Theory and Applications | 2012-06-08 | Paper |
| The dynamic complexity of formal languages | 2012-04-24 | Paper |
Two-variable logic with two order relations
Logical Methods in Computer Science | 2012-04-03 | Paper |
A note on the expressive power of linear orders
Logical Methods in Computer Science | 2012-04-02 | Paper |
Conjunctive query containment over trees
Journal of Computer and System Sciences | 2011-05-04 | Paper |
| Deterministic top-down tree automata: past, present, and future | 2011-03-30 | Paper |
| Counting in trees | 2011-03-30 | Paper |
Complexity of hybrid logics over transitive frames
Journal of Applied Logic | 2011-03-22 | Paper |
Complexity of decision problems for XML schemas and chain regular expressions
SIAM Journal on Computing | 2010-09-06 | Paper |
Two-variable logic with two order relations (extended abstract)
Computer Science Logic | 2010-09-03 | Paper |
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
Fields of Logic and Computation | 2010-09-03 | Paper |
On notions of regularity for data languages
Theoretical Computer Science | 2010-02-09 | Paper |
Tree projections: Game characterization and computational aspects
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Volker Weber
Journal of Logic, Language and Information | 2010-01-06 | Paper |
On the Hybrid Extension of CTL and CTL +
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Expressive Power of Pebble Automata
Automata, Languages and Programming | 2009-03-12 | Paper |
Optimizing Conjunctive Queries over Trees Using Schema Information
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On Notions of Regularity for Data Languages
Fundamentals of Computation Theory | 2008-02-26 | Paper |
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
Logical Methods in Computer Science | 2007-10-11 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Bounded-Variable Fragments of Hybrid Logics
STACS 2007 | 2007-09-03 | Paper |
Dynamic complexity theory revisited
Theory of Computing Systems | 2007-08-23 | Paper |
Automata for XML -- a survey
Journal of Computer and System Sciences | 2007-04-26 | Paper |
Automated Deduction – CADE-20
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Active context-free games
Theory of Computing Systems | 2006-10-25 | Paper |
The many faces of a translation
Journal of Computer and System Sciences | 2006-01-10 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Solving Equations in the Relational Algebra
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2087227 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087211 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079028 (Why is no real title available?) | 2004-07-21 | Paper |
On the power of tree-walking automata.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1953140 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1950751 (Why is no real title available?) | 2003-07-20 | Paper |
Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1834677 (Why is no real title available?) | 2002-11-25 | Paper |
| scientific article; zbMATH DE number 1759452 (Why is no real title available?) | 2002-11-04 | Paper |
Query automata over finite trees
Theoretical Computer Science | 2002-07-31 | Paper |
| scientific article; zbMATH DE number 1670851 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1670879 (Why is no real title available?) | 2001-11-11 | Paper |
The descriptive complexity approach to LOGCFL
Journal of Computer and System Sciences | 2001-10-14 | Paper |
| scientific article; zbMATH DE number 1342206 (Why is no real title available?) | 2000-04-25 | Paper |
| scientific article; zbMATH DE number 1375591 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1375591 (Why is no real title available?) | 1999-12-09 | Paper |
| scientific article; zbMATH DE number 1304331 (Why is no real title available?) | 1999-11-15 | Paper |
| scientific article; zbMATH DE number 1304315 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1223637 (Why is no real title available?) | 1999-04-08 | Paper |
Positive versions of polynomial time
Information and Computation | 1999-03-22 | Paper |
| scientific article; zbMATH DE number 1222579 (Why is no real title available?) | 1998-11-11 | Paper |
Subclasses of binary NP
Journal Of Logic And Computation | 1998-07-28 | Paper |
| scientific article; zbMATH DE number 1136084 (Why is no real title available?) | 1998-04-01 | Paper |
On winning Ehrenfeucht games and monadic NP
Annals of Pure and Applied Logic | 1997-02-24 | Paper |
The power of the middle bit of a \(\#\)P function
Journal of Computer and System Sciences | 1996-11-04 | Paper |
