| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5020650 | 2022-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994683 | 2021-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4621149 | 2019-02-08 | Paper |
| Proving the Correctness of Unfold/Fold Program Transformations Using Bisimulation | 2015-12-07 | Paper |
| Asymptotic Speedups, Bisimulation and Distillation (Work in Progress) | 2015-12-03 | Paper |
| A flow calculus of mwp -bounds for complexity analysis | 2015-09-17 | Paper |
| Programs=data=first-class citizens in a computational world | 2015-08-21 | Paper |
| Constant time factors do matter | 2015-05-07 | Paper |
| The size-change principle for program termination | 2015-03-17 | Paper |
| Proving correctness of compiler optimizations by temporal logic | 2015-03-17 | Paper |
| Programming in Biomolecular Computation | 2014-03-21 | Paper |
| Fifty years of the spectrum problem: survey and new results | 2013-01-17 | Paper |
| Size-Change Termination and Transition Invariants | 2010-10-01 | Paper |
| Rewriting Techniques and Applications | 2009-04-30 | Paper |
| Call-by-value Termination in the Untyped lambda-calculus | 2008-08-07 | Paper |
| Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time | 2008-06-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5435634 | 2008-01-14 | Paper |
| Programming Languages and Systems | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5472907 | 2006-06-19 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Compiler optimization correctness by temporal logic | 2005-03-15 | Paper |
| Transformation by interpreter specialisation | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4823134 | 2004-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440317 | 2003-12-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539593 | 2002-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537517 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529769 | 2002-05-06 | Paper |
| The expressive power of higher-order types or, life without CONS | 2002-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511266 | 2001-10-30 | Paper |
| Computational complexity via programming languages: Constant factors do matter | 2000-12-07 | Paper |
| LOGSPACE and PTIME characterized by programming languages | 2000-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938556 | 2000-03-27 | Paper |
| A partial evaluator for the untyped lambda-calculus | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265595 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265618 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259964 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222767 | 1998-12-10 | Paper |
| A positive supercompiler | 1997-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5287559 | 1993-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038724 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010358 | 1992-09-27 | Paper |
| Static semantics, types, and binding time analysis | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826542 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787457 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3709872 | 1986-01-01 | Paper |
| A method for detecting structure in polyhedra | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3657413 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922128 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3939216 | 1981-01-01 | Paper |
| A Note on the Complexity of General $D0L$ Membership | 1981-01-01 | Paper |
| Complexity of some problems concerningL systems | 1979-01-01 | Paper |
| The Complexity of Finite Memory Programs with Recursion | 1978-01-01 | Paper |
| Parsers for indexed grammars | 1978-01-01 | Paper |
| TEMPO: A unified treatment of binding time and parameter passing concepts in programming languages | 1978-01-01 | Paper |
| Corrigendum: Context free languages and rudimentary attributes | 1978-01-01 | Paper |
| Complete problems for deterministic polynomial time | 1977-01-01 | Paper |
| Even Simple Programs Are Hard To Analyze | 1977-01-01 | Paper |
| Complexity of some problems in Petri nets | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138164 | 1977-01-01 | Paper |
| Recognition of deterministic ETOL languages in logarithmic space | 1977-01-01 | Paper |
| Corrigendum: Space-bounded reducibility among combinatorial problems | 1977-01-01 | Paper |
| A note on linear time simulation of deterministic two-way pushdown automata | 1977-01-01 | Paper |
| New problems complete for nondeterministic log space | 1976-01-01 | Paper |
| Space-bounded reducibility among combinatorial problems | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134928 | 1975-01-01 | Paper |
| Turing machines and the spectra of first-order formulas | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4153609 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041559 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4159038 | 1972-01-01 | Paper |
| A note on the index of a context-free language | 1970-01-01 | Paper |
| Context-free languages and rudimentary attributes | 1969-01-01 | Paper |
| Classes of automata and transitive closure | 1968-01-01 | Paper |
