| Tight Worst-Case Bounds for Polynomial Loop Programs. | 0 | 0.34 | 2019 |
| TIGHT POLYNOMIAL WORST-CASE BOUNDS FOR LOOP PROGRAMS | 0 | 0.34 | 2019 |
| Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets. | 0 | 0.34 | 2018 |
| Multiphase-Linear Ranking Functions and their Relation to Recurrent Sets. | 0 | 0.34 | 2018 |
| A Comment on Budach's Mouse-in-an-Octant Problem | 1 | 0.36 | 2013 |
| Ranking Functions for Linear-Constraint Loops | 20 | 0.77 | 2013 |
| On the linear ranking problem for integer linear-constraint loops | 28 | 0.95 | 2013 |
| Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract). | 0 | 0.34 | 2013 |
| Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]. | 0 | 0.34 | 2012 |
| Monotonicity Constraints in Characterizations of PSPACE | 2 | 0.39 | 2012 |
| Bounded Termination of Monotonicity-Constraint Transition Systems | 2 | 0.44 | 2012 |
| On the Termination of Integer Loops | 15 | 0.82 | 2012 |
| Computational Models with No Linear Speedup. | 0 | 0.34 | 2012 |
| On The Edge Of Decidability In Complexity Analysis Of Loop Programs | 0 | 0.34 | 2012 |
| A simple and efficient Union–Find–Delete algorithm | 1 | 0.35 | 2011 |
| SAT-based termination analysis using monotonicity constraints over the integers. | 3 | 0.43 | 2011 |
| Monotonicity Constraints for Termination in the Integer Domain | 12 | 0.66 | 2011 |
| On Decidable Growth-Rate Properties Of Imperative Programs | 2 | 0.36 | 2010 |
| Size-Change Termination, Monotonicity Constraints and Ranking Functions | 14 | 0.75 | 2009 |
| A complexity tradeoff in ranking-function termination proofs | 5 | 0.46 | 2009 |
| The Euler Path to Static Level-Ancestors | 3 | 0.52 | 2009 |
| Ranking Functions for Size-Change Termination II | 9 | 0.64 | 2009 |
| A SAT-based approach to size change termination with global ranking functions | 20 | 0.78 | 2008 |
| Size-change termination with difference constraints | 18 | 0.83 | 2008 |
| Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time | 15 | 0.69 | 2008 |
| Program termination analysis in polynomial time | 23 | 1.21 | 2007 |
| The Church-Turing thesis and its look-alikes | 2 | 0.53 | 2005 |
| A complexity-theoretic proof of a Recursion-Theoretic Theorem | 0 | 0.34 | 2004 |
| Element distinctness on one-tape Turing machines: a complete solution | 2 | 0.39 | 2003 |
| Tighter constant-factor time hierarchies | 0 | 0.34 | 2003 |
| Improved Bounds for Functions Related to Busy Beavers | 3 | 0.50 | 2002 |
| Lower Bounds for Dynamic Data Structures on Algebraic RAMs | 3 | 0.60 | 2002 |
| General size-change termination and lexicographic descent | 8 | 0.49 | 2002 |
| Topological Lower Bounds on Algebraic Random Access Machines | 8 | 0.54 | 2001 |
| A Generalization of a Lower Bound Technique due to Fredman and Saks | 7 | 0.60 | 2001 |
| Computational complexity via programming languages: constant factors do matter | 7 | 0.68 | 2000 |
| Worst-case and amortised optimality in union-find (extended abstract) | 7 | 0.53 | 1999 |
| A precise version of a time hierarchy theorem | 6 | 0.59 | 1999 |
| Backing up in singly linked lists | 6 | 0.51 | 1999 |
| CONS-Free Programs with Tree Input (Extended Abstract) | 1 | 0.36 | 1998 |
| Introducing: Reasonable Complete Programming Languages | 0 | 0.34 | 1998 |
| A Note on Busy Beavers and Other Creatures | 2 | 0.46 | 1996 |
| On Data Structure Tradeoffs and an Application to Union-Find | 1 | 0.34 | 1995 |
| What is a “pointer machine”? | 26 | 1.32 | 1995 |
| On the Power of the Shift Instruction | 7 | 0.66 | 1995 |
| Lower Bounds on Algebraic Random Access Machines (Extended Abstract) | 0 | 0.34 | 1995 |
| The subtree max gap problem with application to parallel string covering | 7 | 0.80 | 1994 |
| Unit-cost pointers versus logarithmic-cost addresses | 0 | 0.34 | 1994 |
| When Can We Sort in o(n log n) Time? | 6 | 1.36 | 1993 |
| On pointers versus addresses | 19 | 1.44 | 1992 |
