| Publication | Date of Publication | Type |
|---|
| Structural complexity theory: Recent surprises | 2022-12-09 | Paper |
| Separation of complexity classes | 2015-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904143 | 2013-01-28 | Paper |
| Turing Machine-Inspired Computer Science Results | 2012-08-14 | Paper |
| On the computing paradigm and computational complexity | 2010-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431362 | 2003-10-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431223 | 2003-10-21 | Paper |
| Observations About the Development of Theoretical Computer Science | 2002-11-25 | Paper |
| Computation times of NP sets of different densities | 2002-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776606 | 2002-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4380143 | 1998-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763511 | 1995-04-18 | Paper |
| On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line | 1995-01-15 | Paper |
| The random oracle hypothesis is false | 1994-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4299863 | 1994-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005200 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975135 | 1992-06-26 | Paper |
| Space bounded computations: Review and new separation results | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712652 | 1992-06-25 | Paper |
| One-way functions and the nonisomorphism of NP-complete sets | 1991-01-01 | Paper |
| New developments in structural complexity theory | 1990-01-01 | Paper |
| Robust machines accept easy sets | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823798 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830532 | 1989-01-01 | Paper |
| The Boolean Hierarchy II: Applications | 1989-01-01 | Paper |
| Complexity classes without machines: on complete languages for UP | 1988-01-01 | Paper |
| On sparse oracles separating feasible complexity classes | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795226 | 1988-01-01 | Paper |
| The Boolean Hierarchy I: Structural Properties | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3783559 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811710 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811711 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742716 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3801071 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3802608 | 1986-01-01 | Paper |
| Independence results about context-free languages and lower bounds | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3696516 | 1985-01-01 | Paper |
| Sparse sets in NP-P: EXPTIME versus NEXPTIME | 1985-01-01 | Paper |
| On Goedel speed-up and succinctness of language representations | 1983-01-01 | Paper |
| On sparse sets in NP-P | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3315500 | 1983-01-01 | Paper |
| A note on natural complete sets and Goedel numberings | 1982-01-01 | Paper |
| Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3888527 | 1980-01-01 | Paper |
| On the Succinctness of Different Representations of Languages | 1980-01-01 | Paper |
| Relations between diagonalization, proof systems, and complexity gaps | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197341 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4199562 | 1979-01-01 | Paper |
| On log-tape isomorphisms of complete sets | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162663 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182501 | 1976-01-01 | Paper |
| Computational complexity of formal translations | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4109294 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4182500 | 1975-01-01 | Paper |
| On Simple Goedel Numberings and Translations | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4055193 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4770003 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775857 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778264 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4122837 | 1973-01-01 | Paper |
| On non-determinacy in simple computing devices | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672170 | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5681534 | 1971-01-01 | Paper |
| The use of lists in the study of undecidable problems in automata theory | 1971-01-01 | Paper |
| Computational complexity of random access stored program machines | 1971-01-01 | Paper |
| An Overview of the Theory of Computational Complexity | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5639367 | 1971-01-01 | Paper |
| What makes some language theory problems undecidable | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5180413 | 1970-01-01 | Paper |
| A note on one-way and two-way automata | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628112 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5632147 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5636862 | 1970-01-01 | Paper |
| Two memory bounds for the recognition of primes by automata | 1969-01-01 | Paper |
| Two memory bounds for the recognition of primes by automata | 1969-01-01 | Paper |
| On the Complexity of Undecidable Problems in Automata Theory | 1969-01-01 | Paper |
| Tape-reversal bounded Turing machine computations | 1968-01-01 | Paper |
| Computational Complexity of One-Tape Turing Machine Computations | 1968-01-01 | Paper |
| On the Recognition of Primes by Automata | 1968-01-01 | Paper |
| Homomorphic images of linear sequential machines | 1967-01-01 | Paper |
| Sets of Numbers Defined by Finite Automata | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5536282 | 1967-01-01 | Paper |
| On Memory Requirements for Context-Free Language Recognition | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5583856 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5535414 | 1966-01-01 | Paper |
| Complete Sets of Functions of Two and Three Binary Variables | 1966-01-01 | Paper |
| On the Computational Complexity of Algorithms | 1965-01-01 | Paper |
| Two Tests for the Linearity of Sequential Machines | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5601828 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5608485 | 1965-01-01 | Paper |
| Pair algebra and its application to automata theory | 1964-01-01 | Paper |
| Pair algebra and its application to automata theory | 1964-01-01 | Paper |
| A Study of Feedback and Errors in Sequential Machines | 1963-01-01 | Paper |
| The Multiple-Category Bayes Decision Procedure | 1963-01-01 | Paper |
| Regularity preserving modifications of regular expressions | 1963-01-01 | Paper |
| Loop-free structure of sequential machines | 1962-01-01 | Paper |
| Some dangers in state reduction of sequential machines | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5547174 | 1962-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5720602 | 1961-01-01 | Paper |
| Symbolic analysis of a decomposition of information processing machines | 1960-01-01 | Paper |
| Lattice Theory of Generalized Partitions | 1959-01-01 | Paper |
| The application of some basic inequalities for entropy | 1959-01-01 | Paper |
| On the Lattice of Topologies | 1958-01-01 | Paper |
| A Note on the Lattice of Geometries | 1957-01-01 | Paper |
| Two Embedding Theorems for Finite Lattices | 1956-01-01 | Paper |
