| Publication | Date of Publication | Type |
|---|
| Bounded quantifier instantiation for checking inductive invariants | 2020-08-05 | Paper |
| Bounded quantifier instantiation for checking inductive invariants | 2019-09-13 | Paper |
| The $k$-Dimensional Weisfeiler-Leman Algorithm | 2019-07-22 | Paper |
| An \(n!\) lower bound on formula size | 2017-06-13 | Paper |
| Decidability of inferring inductive invariants | 2016-10-24 | Paper |
| Decentralizing SDN policies | 2016-09-29 | Paper |
| Modular reasoning about heap paths via effectively propositional formulas | 2014-04-10 | Paper |
| Solving geometry problems using a combination of symbolic and numerical reasoning | 2014-01-17 | Paper |
| Applicability conditions for plans with loops: computability results and algorithms | 2013-08-23 | Paper |
| Experimental descriptive complexity | 2012-07-16 | Paper |
| A new representation and associated algorithms for generalized planning | 2011-06-17 | Paper |
| Finding Reductions Automatically | 2010-09-03 | Paper |
| Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words | 2009-08-20 | Paper |
| Simulating reachability using first-order logic with applications to verification of linked data structures | 2009-06-30 | Paper |
| The complexity of satisfiability problems: Refining Schaefer's theorem | 2009-04-30 | Paper |
| First-Order and Temporal Logics for Nested Words | 2009-04-29 | Paper |
| Structure Theorem and Strict Alternation Hierarchy for FO2 on Words | 2009-03-05 | Paper |
| Constructing Specialized Shape Analyses for Uniform Change | 2008-04-04 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The Complexity of Decentralized Control of Markov Decision Processes | 2005-11-11 | Paper |
| Computer Aided Verification | 2005-08-25 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| First-order expressibility of languages with neutral letters or: The Crane Beach conjecture | 2005-05-12 | Paper |
| Tree canonization and transitive closure | 2003-01-14 | Paper |
| Embedding linkages on an integer lattice | 2002-05-21 | Paper |
| Descriptive complexity: a logician's approach to computation. | 2002-02-04 | Paper |
| Number of variables is equivalent to space | 2001-12-06 | Paper |
| On the unusual effectiveness of logic in computer science | 2001-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4267172 | 2001-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790381 | 2001-01-01 | Paper |
| Reachability logic: an efficient fragment of transitive closure logic | 2000-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942645 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247261 | 1999-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4227581 | 1999-02-24 | Paper |
| Dyn-FO: A parallel, dynamic complexity class | 1998-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359454 | 1997-10-08 | Paper |
| Reachability and the power of local ordering | 1997-09-29 | Paper |
| A First-Order Isomorphism Theorem | 1997-05-26 | Paper |
| The expressiveness of a family of finite set languages | 1997-02-27 | Paper |
| The complexity of iterated multiplication | 1995-04-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281518 | 1994-03-10 | Paper |
| An optimal lower bound on the number of variables for graph identification | 1993-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974868 | 1992-06-26 | Paper |
| On uniformity within \(NC^ 1\) | 1990-01-01 | Paper |
| Definability with bounded number of bound variables | 1989-01-01 | Paper |
| Expressibility and Parallel Complexity | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830533 | 1989-01-01 | Paper |
| Relativizing relativized computations | 1989-01-01 | Paper |
| Nondeterministic Space is Closed under Complementation | 1988-01-01 | Paper |
| Languages that Capture Complexity Classes | 1987-01-01 | Paper |
| Interpreting logics of knowledge in propositional dynamic logic | 1987-01-01 | Paper |
| Relational queries computable in polynomial time | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696516 | 1985-01-01 | Paper |
| Sparse sets in NP-P: EXPTIME versus NEXPTIME | 1985-01-01 | Paper |
| Upper and lower bounds for first order expressibility | 1982-01-01 | Paper |
| Number of quantifiers is better than number of tape cells | 1981-01-01 | Paper |
| McColm conjecture | N/A | Paper |
