| Publication | Date of Publication | Type |
|---|
On representations of irrational numbers and the computational complexity of converting between such representations
The Bulletin of Symbolic Logic | 2025-12-30 | Paper |
| Multiphase-linear ranking functions and their relation to recurrent sets | 2024-04-19 | Paper |
| On representations of real numbers and the computational complexity of converting between such representations | 2023-04-14 | Paper |
On multiphase-linear ranking functions
(available as arXiv preprint) | 2022-08-12 | Paper |
scientific article; zbMATH DE number 7471667 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471667 (Why is no real title available?) | 2022-02-09 | Paper |
| The hardness of finding linear ranking functions for lasso programs | 2021-06-24 | Paper |
The hardness of finding linear ranking functions for lasso programs
(available as arXiv preprint) | 2021-06-24 | Paper |
scientific article; zbMATH DE number 7215283 (Why is no real title available?)
(available as arXiv preprint) | 2020-06-26 | Paper |
| scientific article; zbMATH DE number 7215283 (Why is no real title available?) | 2020-06-26 | Paper |
| Tight worst-case bounds for polynomial loop programs | 2020-01-28 | Paper |
Lower bounds on algebraic random access machines
Automata, Languages and Programming | 2019-01-10 | Paper |
Complexity of Bradley-Manna-Sipma lexicographic ranking functions
(available as arXiv preprint) | 2018-03-01 | Paper |
| Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract) | 2017-01-30 | Paper |
Backing up in singly linked lists
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Worst-case and amortised optimality in union-find (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Ranking functions for linear-constraint loops
Journal of the ACM | 2015-08-14 | Paper |
Mortality of iterated piecewise affine functions over the integers: decidability and complexity
Computability | 2015-07-01 | Paper |
The size-change principle for program termination
Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
On the \textsc{Linear Ranking} problem for integer linear-constraint loops
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-11-27 | Paper |
scientific article; zbMATH DE number 6292628 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
On the edge of decidability in complexity analysis of loop programs
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
On the termination of integer loops
Lecture Notes in Computer Science | 2012-06-15 | Paper |
Corrigendum to ``A simple and efficient union-find-delete algorithm
Theoretical Computer Science | 2012-05-14 | Paper |
Monotonicity constraints in characterizations of PSPACE
Journal of Logic and Computation | 2012-05-07 | Paper |
Monotonicity constraints for termination in the integer domain
Logical Methods in Computer Science | 2012-04-02 | Paper |
SAT-based termination analysis using monotonicity constraints over the integers
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
A simple and efficient union-find-delete algorithm
Theoretical Computer Science | 2011-02-02 | Paper |
Size-change termination, monotonicity constraints and ranking functions
Logical Methods in Computer Science | 2010-07-27 | Paper |
Ranking Functions for Size-Change Termination II
Logical Methods in Computer Science | 2009-06-30 | Paper |
Size-Change Termination, Monotonicity Constraints and Ranking Functions
Computer Aided Verification | 2009-06-30 | Paper |
Tighter constant-factor time hierarchies
Information Processing Letters | 2009-04-28 | Paper |
A complexity tradeoff in ranking-function termination proofs
Acta Informatica | 2009-03-26 | Paper |
Backing up in singly linked lists
Journal of the ACM | 2008-12-21 | Paper |
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
Logic and Theory of Algorithms | 2008-06-19 | Paper |
A SAT-Based Approach to Size Change Termination with Global Ranking Functions
Tools and Algorithms for the Construction and Analysis of Systems | 2008-04-11 | Paper |
Element distinctness on one-tape Turing machines: a complete solution
Acta Informatica | 2004-12-09 | Paper |
| scientific article; zbMATH DE number 1953270 (Why is no real title available?) | 2003-07-27 | Paper |
Improved bounds for functions related to busy beavers
Theory of Computing Systems | 2002-05-30 | Paper |
Lower bounds for dynamic data structures on algebraic RAMs
Algorithmica | 2002-05-21 | Paper |
Topological lower bounds on algebraic random access machines
SIAM Journal on Computing | 2002-04-23 | Paper |
A generalization of a lower bound technique due to Fredman and Saks
Algorithmica | 2001-09-19 | Paper |
Computational complexity via programming languages: Constant factors do matter
Acta Informatica | 2000-12-07 | Paper |
| scientific article; zbMATH DE number 1339956 (Why is no real title available?) | 1999-09-22 | Paper |
When can we sort in \(o(n\log n)\) time?
Journal of Computer and System Sciences | 1997-08-03 | Paper |
| scientific article; zbMATH DE number 1003282 (Why is no real title available?) | 1997-04-23 | Paper |
A note on busy beavers and other creatures
Mathematical Systems Theory | 1996-08-05 | Paper |
On the power of the shift instruction
Information and Computation | 1995-05-28 | Paper |
Unit-cost pointers versus logarithmic-cost addresses
Theoretical Computer Science | 1994-09-25 | Paper |
On pointers versus addresses
Journal of the ACM | 1994-08-21 | Paper |
