| Publication | Date of Publication | Type |
|---|
| Full abstraction and the Context Lemma (preliminary report) | 2022-08-16 | Paper |
| Deciding true concurrency equivalences on finite safe nets (preliminary report) | 2019-03-29 | Paper |
| Cosmological lower bound on the circuit complexity of a small problem in logic | 2015-12-07 | Paper |
| Classes of computable functions defined by bounds on computation | 2014-03-14 | Paper |
| Coping with errors in binary search procedures (Preliminary Report) | 2014-03-14 | Paper |
| On time-space classes and their relation to the theory of real addition | 2014-03-14 | Paper |
| Reminiscences | 2008-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150251 | 2002-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4490765 | 2000-07-20 | Paper |
| Bisimulation can't be traced | 1998-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353635 | 1997-09-10 | Paper |
| Deciding true concurrency equivalences on safe, finite nets | 1997-09-09 | Paper |
| Full Abstraction and the Context Lemma | 1997-02-24 | Paper |
| Characterization of realizable space complexities | 1995-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3142162 | 1993-12-05 | Paper |
| Experimenting with process equivalence | 1992-09-27 | Paper |
| The semantics of second-order lambda calculus | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4730757 | 1989-01-01 | Paper |
| On time versus space III | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3714051 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680264 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3680263 | 1985-01-01 | Paper |
| Equations between Regular Terms and an Application to Process Logic | 1985-01-01 | Paper |
| Can message buffers be axiomatized in linear temporal logic? | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347263 | 1984-01-01 | Paper |
| Equivalences among logics of programs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216628 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3316584 | 1983-01-01 | Paper |
| Termination assertions for recursive programs: Completeness and axiomatic definability | 1983-01-01 | Paper |
| The complexity of the word problems for commutative semigroups and polynomial ideals | 1982-01-01 | Paper |
| $\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas | 1982-01-01 | Paper |
| What is a model of the lambda calculus? | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3968454 | 1982-01-01 | Paper |
| Axiomatic Definitions of Programming Languages | 1982-01-01 | Paper |
| Expressing program looping in regular dynamic logic | 1982-01-01 | Paper |
| The Complexity of the Finite Containment Problem for Petri Nets | 1981-01-01 | Paper |
| Definability in dynamic logic | 1981-01-01 | Paper |
| Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919070 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3923593 | 1981-01-01 | Paper |
| Coping with errors in binary search procedures | 1980-01-01 | Paper |
| On time-space classes and their relation to the theory of real addition | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197342 | 1979-01-01 | Paper |
| Separating Nondeterministic Time Complexity Classes | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195945 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4152749 | 1976-01-01 | Paper |
| Relativization of the Theory of Computational Complexity | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138127 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4090322 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133967 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4135489 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4161258 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055196 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4041107 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131648 | 1973-01-01 | Paper |
| Program size in restricted programming languages | 1972-01-01 | Paper |
| A Classification of the Recursive Functions | 1972-01-01 | Paper |
| Real-Time Simulation of Multihead Tape Units | 1972-01-01 | Paper |
| Computational speed-up by effective operators | 1972-01-01 | Paper |
| Time-restricted sequence generation | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5633662 | 1970-01-01 | Paper |
| A Note on Star-Free Events | 1969-01-01 | Paper |
| Sequential Boolean Equations | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775469 | 1969-01-01 | Paper |
| Counter machines and counter languages | 1968-01-01 | Paper |
