| Conjunctive query containment over trees using schema information. | 1 | 0.35 | 2018 |
| Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages. | 0 | 0.34 | 2017 |
| On the Regularity and Learnability of Ordered DAG Languages. | 0 | 0.34 | 2017 |
| Predicting User Competence from Linguistic Data. | 0 | 0.34 | 2017 |
| Uniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey. | 1 | 0.34 | 2016 |
| Between a Rock and a Hard Place - Uniform Parsing for Hyperedge Replacement DAG Grammars. | 5 | 0.43 | 2016 |
| Efficient Incremental Evaluation of Succinct Regular Expressions | 8 | 0.47 | 2015 |
| Cuts in Regular Expressions. | 0 | 0.34 | 2013 |
| Validity of Tree Pattern Queries with Respect to Schema Information. | 9 | 0.50 | 2013 |
| On optimum left-to-right strategies for active context-free games | 2 | 0.40 | 2013 |
| On the Parameterized Complexity of Linear Context-Free Rewriting Systems | 2 | 0.37 | 2013 |
| A note on the complexity of deterministic tree-walking transducers. | 1 | 0.36 | 2013 |
| Shuffled languages - Representation and recognition. | 2 | 0.39 | 2013 |
| The tractability frontier for NFA minimization | 19 | 0.72 | 2012 |
| Recognizing shuffled languages | 7 | 0.51 | 2011 |
| Logik und Automaten: ein echtes Dreamteam | 0 | 0.34 | 2010 |
| On notions of regularity for data languages | 42 | 1.82 | 2010 |
| Incremental XPath evaluation | 4 | 0.41 | 2010 |
| Optimizing Conjunctive Queries over Trees Using Schema Information | 36 | 1.22 | 2008 |
| Conjunctive query containment over trees | 32 | 1.29 | 2007 |
| Shuffle expressions and words with nested data | 10 | 0.63 | 2007 |
| A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games | 44 | 2.66 | 2007 |
| Combinatorial structure and randomized subexponential algorithms for infinite games | 21 | 1.11 | 2005 |
| Memoryless determinacy of parity and mean payoff games: a simple proof | 24 | 1.66 | 2004 |
| State Verification | 1 | 0.35 | 2004 |
| A Discrete Subexponential Algorithm for Parity Games | 29 | 1.83 | 2003 |
| Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework | 11 | 0.91 | 2003 |
