| Publication | Date of Publication | Type |
|---|
| On representations of real numbers and the computational complexity of converting between such representations | 2023-04-14 | Paper |
| On multiphase-linear ranking functions | 2022-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5028427 | 2022-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4995357 | 2021-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5114822 | 2020-06-26 | Paper |
| Tight worst-case bounds for polynomial loop programs | 2020-01-28 | Paper |
| Lower bounds on algebraic random access machines | 2019-01-10 | Paper |
| Complexity of Bradley-Manna-Sipma lexicographic ranking functions | 2018-03-01 | Paper |
| Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract) | 2017-01-30 | Paper |
| Worst-case and amortised optimality in union-find (extended abstract) | 2016-09-29 | Paper |
| Backing up in singly linked lists | 2016-09-29 | Paper |
| Ranking Functions for Linear-Constraint Loops | 2015-08-14 | Paper |
| Mortality of iterated piecewise affine functions over the integers: Decidability and complexity | 2015-07-01 | Paper |
| The size-change principle for program termination | 2015-03-17 | Paper |
| On the linear ranking problem for integer linear-constraint loops | 2014-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414602 | 2014-05-06 | Paper |
| ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS | 2013-06-06 | Paper |
| On the Termination of Integer Loops | 2012-06-15 | Paper |
| Corrigendum to ``A simple and efficient union-find-delete algorithm | 2012-05-14 | Paper |
| Monotonicity Constraints in Characterizations of PSPACE | 2012-05-07 | Paper |
| Monotonicity Constraints for Termination in the Integer Domain | 2012-04-02 | Paper |
| SAT-based termination analysis using monotonicity constraints over the integers | 2011-08-16 | Paper |
| A simple and efficient union-find-delete algorithm | 2011-02-02 | Paper |
| Size-Change Termination, Monotonicity Constraints and Ranking Functions | 2010-07-27 | Paper |
| Ranking Functions for Size-Change Termination II | 2009-06-30 | Paper |
| Size-Change Termination, Monotonicity Constraints and Ranking Functions | 2009-06-30 | Paper |
| Tighter constant-factor time hierarchies | 2009-04-28 | Paper |
| A complexity tradeoff in ranking-function termination proofs | 2009-03-26 | Paper |
| Backing up in singly linked lists | 2008-12-21 | Paper |
| Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time | 2008-06-19 | Paper |
| A SAT-Based Approach to Size Change Termination with Global Ranking Functions | 2008-04-11 | Paper |
| Element distinctness on one-tape Turing machines: a complete solution | 2004-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414722 | 2003-07-27 | Paper |
| Improved bounds for functions related to busy beavers | 2002-05-30 | Paper |
| Lower bounds for dynamic data structures on algebraic RAMs | 2002-05-21 | Paper |
| Topological Lower Bounds on Algebraic Random Access Machines | 2002-04-23 | Paper |
| A generalization of a lower bound technique due to Fredman and Saks | 2001-09-19 | Paper |
| Computational complexity via programming languages: Constant factors do matter | 2000-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265618 | 1999-09-22 | Paper |
| When can we sort in \(o(n\log n)\) time? | 1997-08-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3128912 | 1997-04-23 | Paper |
| A note on busy beavers and other creatures | 1996-08-05 | Paper |
| On the power of the shift instruction | 1995-05-28 | Paper |
| Unit-cost pointers versus logarithmic-cost addresses | 1994-09-25 | Paper |
| On pointers versus addresses | 1994-08-21 | Paper |
