| Publication | Date of Publication | Type |
|---|
| Quantum expectation transformers for cost analysis | 2024-12-06 | Paper |
| \( \alpha\)-avoidance | 2024-10-21 | Paper |
Herbrand complexity and the epsilon calculus with equality
Archive for Mathematical Logic | 2024-01-18 | Paper |
Type-based analysis of logarithmic amortised complexity
Mathematical Structures in Computer Science | 2023-02-06 | Paper |
| Automated Expected Amortised Cost Analysis of Probabilistic Data Structures | 2022-12-07 | Paper |
| ATLAS: automated amortised complexity analysis of self-adjusting data structures | 2022-03-25 | Paper |
Runtime complexity analysis of logically constrained rewriting
(available as arXiv preprint) | 2022-03-23 | Paper |
| Kruskal's tree theorem for acyclic term graphs | 2021-12-07 | Paper |
Kruskal's tree theorem for acyclic term graphs
(available as arXiv preprint) | 2021-12-07 | Paper |
| The Epsilon Calculus with Equality and Herbrand Complexity | 2019-04-25 | Paper |
| MædMax: a maximal ordered completion tool | 2018-10-18 | Paper |
Automated amortised resource analysis for term rewrite systems
(available as arXiv preprint) | 2018-07-09 | Paper |
From Jinja bytecode to term rewriting: a complexity reflecting transformation
Information and Computation | 2018-06-14 | Paper |
| Complexity of acyclic term graph rewriting | 2017-10-17 | Paper |
| Multivariate amortised resource analysis for term rewrite systems | 2017-07-12 | Paper |
| Leftmost outermost revisited | 2017-07-12 | Paper |
KBOs, ordinals, subrecursive hierarchies and all that
Journal Of Logic And Computation | 2017-05-17 | Paper |
Analysing the complexity of functional programs: higher-order meets first-order
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
Analysing the complexity of functional programs: higher-order meets first-order
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming | 2017-05-10 | Paper |
| The structure of interaction | 2017-02-02 | Paper |
A combination framework for complexity
(available as arXiv preprint) | 2017-02-01 | Paper |
| Tyrolean Complexity Tool: Features and Usage. | 2017-02-01 | Paper |
The complexity of interaction
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2016-10-24 | Paper |
A combination framework for complexity
Information and Computation | 2016-05-03 | Paper |
A new order-theoretic characterisation of the polytime computable functions
Theoretical Computer Science | 2015-05-26 | Paper |
Automated Complexity Analysis Based on Context-Sensitive Rewriting
Lecture Notes in Computer Science | 2014-07-24 | Paper |
Amortised resource analysis and typed polynomial interpretations
Lecture Notes in Computer Science | 2014-07-24 | Paper |
Polynomial path orders
Logical Methods in Computer Science | 2013-11-28 | Paper |
| Complexity analysis of term rewriting based on matrix and context dependent interpretations | 2012-10-19 | Paper |
| Closing the gap between runtime complexity and polytime computability | 2012-04-25 | Paper |
| Termination proofs in the dependency pair framework May induce multiple recursive derivational complexity | 2012-04-24 | Paper |
| A path order for rewrite systems that compute exponential time functions | 2012-04-24 | Paper |
A path order for rewrite systems that compute exponential time functions
(available as arXiv preprint) | 2012-04-24 | Paper |
The derivational complexity induced by the dependency pair method
Logical Methods in Computer Science | 2012-04-02 | Paper |
On transfinite Knuth-Bendix orders
Lecture Notes in Computer Science | 2011-07-29 | Paper |
Joint spectral radius theory for automated complexity analysis of rewrite systems
Algebraic Informatics | 2011-07-08 | Paper |
Tableaux for Reasoning about Atomic Updates
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Characterising space complexity classes via Knuth-Bendix orders
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Complexity analysis by graph rewriting
Functional and Logic Programming | 2010-05-04 | Paper |
The Hydra battle and Cichon's principle
Applicable Algebra in Engineering, Communication and Computing | 2009-10-19 | Paper |
The Derivational Complexity Induced by the Dependency Pair Method
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Dependency Pairs and Polynomial Path Orders
Rewriting Techniques and Applications | 2009-06-30 | Paper |
The Hydra Battle Revisited
Rewriting, Computation and Proof | 2009-03-06 | Paper |
Complexity, Graphs, and the Dependency Pair Method
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Automated Complexity Analysis Based on the Dependency Pair Method
Automated Reasoning | 2008-11-27 | Paper |
Automated Implicit Computational Complexity Analysis (System Description)
Automated Reasoning | 2008-11-27 | Paper |
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Derivational Complexity of Knuth-Bendix Orders Revisited
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Complexity Analysis by Rewriting
Functional and Logic Programming | 2008-04-11 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Ackermann's substitution method (remixed)
Annals of Pure and Applied Logic | 2006-09-14 | Paper |
Herbrand's theorem and term induction
Archive for Mathematical Logic | 2006-05-26 | Paper |
The epsilon calculus and Herbrand complexity
Studia Logica | 2006-03-17 | Paper |
| scientific article; zbMATH DE number 2043536 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1948175 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1841838 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1696762 (Why is no real title available?) | 2002-07-22 | Paper |
