| 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 | 2024-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874224 | 2023-02-07 | Paper |
| Distribution Constraints: The Chase for Distributed Data | 2023-02-07 | Paper |
| Algebraic and logical characterizations of deterministic linear time classes | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091125 | 2022-07-21 | Paper |
| The Ackermann Award 2018 | 2022-05-28 | Paper |
| Dynamic Complexity under Definable Changes | 2021-11-25 | Paper |
| Automata and finite model theory | 2021-11-12 | Paper |
| Work-sensitive dynamic complexity of formal languages | 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 | 2019-11-22 | Paper |
| Reasoning about XML constraints based on XML-to-relational mappings | 2019-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5376663 | 2019-05-17 | Paper |
| Reachability Is in DynFO | 2019-02-25 | Paper |
| Graph Connectivity, Monadic NP and built-in relations of moderate degree | 2019-01-10 | Paper |
| Dynamic Complexity under Definable Changes | 2018-07-18 | Paper |
| Parallel-Correctness and Transferability for Conjunctive Queries | 2018-05-17 | Paper |
| Conjunctive query containment over trees using schema information | 2018-02-28 | Paper |
| On bijections vs. unary functions | 2017-11-16 | Paper |
| Games for active XML revisited | 2017-09-20 | Paper |
| Static Analysis for Logic-Based Dynamic Programs | 2017-08-31 | Paper |
| Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation | 2017-07-14 | Paper |
| Finite state machines for strings over infinite alphabets | 2017-07-12 | Paper |
| Dynamic conjunctive queries | 2017-06-30 | Paper |
| Locality of order-invariant first-order formulas | 2017-06-13 | Paper |
| Games for Active XML Revisited. | 2017-06-13 | Paper |
| Expressiveness of hybrid temporal logic on data words | 2016-10-07 | Paper |
| Definable relations and first-order query languages over strings | 2015-11-12 | Paper |
| Two-variable logic on data trees and XML reasoning | 2015-11-11 | Paper |
| Generalized hypertree decompositions: NP-hardness and tractable variants | 2015-11-11 | Paper |
| Reachability is in DynFO | 2015-11-04 | Paper |
| Two-variable logic on data words | 2015-09-17 | Paper |
| The dynamic complexity of formal languages | 2015-09-17 | Paper |
| Existential second-order logic over graphs | 2015-08-01 | Paper |
| When is the evaluation of conjunctive queries tractable? | 2015-02-27 | Paper |
| On the quantifier-free dynamic complexity of reachability | 2015-01-30 | Paper |
| The price of query rewriting in ontology-based data access | 2014-06-10 | Paper |
| Validity of Tree Pattern Queries with Respect to Schema Information | 2013-09-20 | Paper |
| On the Quantifier-Free Dynamic Complexity of Reachability | 2013-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910704 | 2013-03-19 | Paper |
| Dynamic Communicating Automata and Branching High-Level MSCs | 2013-03-18 | Paper |
| Temporal logics on words with multiple data values | 2012-08-29 | Paper |
| Feasible Automata for Two-Variable Logic with Successor on Data Words | 2012-06-08 | Paper |
| The Dynamic Complexity of Formal Languages | 2012-04-24 | Paper |
| Two-variable logic with two order relations | 2012-04-03 | Paper |
| A note on the expressive power of linear orders | 2012-04-02 | Paper |
| Conjunctive query containment over trees | 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 | 2011-03-22 | Paper |
| Complexity of decision problems for XML schemas and chain regular expressions | 2010-09-06 | Paper |
| Two-variable logic with two order relations (extended abstract) | 2010-09-03 | Paper |
| The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey | 2010-09-03 | Paper |
| On notions of regularity for data languages | 2010-02-09 | Paper |
| Tree projections: Game characterization and computational aspects | 2010-01-07 | Paper |
| Volker Weber | 2010-01-06 | Paper |
| On the Hybrid Extension of CTL and CTL + | 2009-10-16 | Paper |
| Expressive Power of Pebble Automata | 2009-03-12 | Paper |
| Optimizing Conjunctive Queries over Trees Using Schema Information | 2009-02-03 | Paper |
| On Notions of Regularity for Data Languages | 2008-02-26 | Paper |
| On the complexity of XPath containment in the presence of disjunction, DTDs, and variables | 2007-10-11 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Bounded-Variable Fragments of Hybrid Logics | 2007-09-03 | Paper |
| Dynamic complexity theory revisited | 2007-08-23 | Paper |
| Automata for XML -- a survey | 2007-04-26 | Paper |
| Automated Deduction – CADE-20 | 2006-11-01 | Paper |
| Active context-free games | 2006-10-25 | Paper |
| The many faces of a translation | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Solving Equations in the Relational Algebra | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737911 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737894 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474840 | 2004-07-21 | Paper |
| On the power of tree-walking automata. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414544 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413449 | 2003-07-20 | Paper |
| Machine-Independent Characterizations and Complete Problems for Deterministic Linear Time | 2003-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779173 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536402 | 2002-11-04 | Paper |
| Query automata over finite trees | 2002-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754175 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754205 | 2001-11-11 | Paper |
| The descriptive complexity approach to LOGCFL | 2001-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263790 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3836531 | 1999-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251062 | 1999-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251045 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218949 | 1999-04-08 | Paper |
| Positive versions of polynomial time | 1999-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218118 | 1998-11-11 | Paper |
| Subclasses of binary NP | 1998-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381395 | 1998-04-01 | Paper |
| On winning Ehrenfeucht games and monadic NP | 1997-02-24 | Paper |
| The power of the middle bit of a \(\#\)P function | 1996-11-04 | Paper |
