| Publication | Date of Publication | Type |
|---|
| Structural Properties of Nonautoreducible Sets | 2019-12-06 | Paper |
| Fine separation of average time complexity classes | 2017-11-16 | Paper |
| Introduction to Autoreducibility and Mitoticity | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2965519 | 2017-03-03 | Paper |
| A thirty year old conjecture about promise problems | 2016-11-30 | Paper |
| A Thirty Year Old Conjecture about Promise Problems | 2013-08-12 | Paper |
| Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions | 2013-08-06 | Paper |
| Computability and complexity theory. | 2011-10-18 | Paper |
| THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS | 2009-06-30 | Paper |
| Non-mitotic sets | 2009-05-28 | Paper |
| The Informational Content of Canonical Disjoint NP-Pairs | 2009-03-06 | Paper |
| The complexity of unions of disjoint sets | 2008-11-19 | Paper |
| Splitting NP-Complete Sets | 2008-10-28 | Paper |
| Non-mitotic Sets | 2008-04-24 | Paper |
| Redundancy in Complete Sets | 2008-03-19 | Paper |
| Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy | 2007-10-18 | Paper |
| The Complexity of Unions of Disjoint Sets | 2007-09-03 | Paper |
| Autoreducibility, mitoticity, and immunity | 2007-05-30 | Paper |
| Properties of NP‐Complete Sets | 2007-05-03 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Canonical disjoint NP-pairs of propositional proof systems | 2007-02-26 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| Reductions between disjoint NP-pairs | 2005-09-02 | Paper |
| Disjoint NP-Pairs | 2005-02-21 | Paper |
| Bi-immunity separates strong NP-completeness notions | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736858 | 2004-08-11 | Paper |
| Distributionally hard languages | 2002-09-11 | Paper |
| Separation of NP-Completeness Notions | 2002-04-23 | Paper |
| Computability and complexity theory | 2001-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525684 | 2001-01-24 | Paper |
| Adaptive versus nonadaptive queries to NP and P-selective sets | 2000-09-26 | Paper |
| Complete distributional problems, hard languages, and resource-bounded measure | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937192 | 2000-02-03 | Paper |
| Fine Separation of Average-Time Complexity Classes | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259998 | 1999-09-08 | Paper |
| Adaptive mesh refinement for localised phenomena | 1999-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4213690 | 1999-03-09 | Paper |
| A hierarchy based on output multiplicity | 1999-01-12 | Paper |
| Multi-mesh and adaptivity in 3D shape optimization | 1998-11-01 | Paper |
| Oracles That Compute Values | 1998-02-10 | Paper |
| \(p\)-Selective sets and reducing search to decision vs. self-reducibility | 1997-03-31 | Paper |
| Computing Solutions Uniquely Collapses the Polynomial Hierarchy | 1996-10-16 | Paper |
| NONDETERMINISTICALLY SELECTIVE SETS | 1996-08-13 | Paper |
| Boundary layers in uniform and variable thickness plates with rectangular and curved planforms using the finite strip method | 1996-01-30 | Paper |
| A taxonomy of complexity classes of functions | 1995-02-13 | Paper |
| Two‐dimensional transient dynamic analysis with adaptive mesh refinement | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281541 | 1994-03-10 | Paper |
| Hard promise problems and nonuniform complexity | 1993-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3998345 | 1993-01-23 | Paper |
| Oracles for structural properties: The isomorphism problem and public-key cryptography | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005173 | 1992-09-27 | Paper |
| A survey of one-way functions in complexity theory | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3975932 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359757 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3830942 | 1989-01-01 | Paper |
| Promise problems complete for complexity classes | 1988-01-01 | Paper |
| Complexity Measures for Public-Key Cryptosystems | 1988-01-01 | Paper |
| Natural Self-Reducible Sets | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760533 | 1987-01-01 | Paper |
| Qualitative relativizations of complexity classes | 1985-01-01 | Paper |
| Hard-core theorems for complexity classes | 1985-01-01 | Paper |
| The complexity of promise problems with applications to public-key cryptography | 1984-01-01 | Paper |
| Quantitative Relativizations of Complexity Classes | 1984-01-01 | Paper |
| Characterizations of reduction classes modulo oracle conditions | 1984-01-01 | Paper |
| Positive Relativizations of Complexity Classes | 1983-01-01 | Paper |
| Reductions on NP and p-selective sets | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3036702 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3659676 | 1982-01-01 | Paper |
| Analogues of semirecursive sets and effective reducibilities to the study of NP complexity | 1982-01-01 | Paper |
| Some observations on NP real numbers and P-selective sets | 1981-01-01 | Paper |
| A second step toward the polynomial hierarchy | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3855156 | 1979-01-01 | Paper |
| P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP | 1979-01-01 | Paper |
| Polynomial Time Enumeration Reducibility | 1978-01-01 | Paper |
| Inclusion complete tally languages and the Hartmanis-Berman conjecture | 1977-01-01 | Paper |
| A comparison of polynomial time reducibilities | 1975-01-01 | Paper |
| Relativized Halting Problems | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162480 | 1974-01-01 | Paper |
| Turing machines and the spectra of first-order formulas | 1974-01-01 | Paper |
| Sets of Formulas Valid in Finite Structures | 1973-01-01 | Paper |
| Completeness of calculii for axiomatically defined classes of algebras | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4159038 | 1972-01-01 | Paper |
| Arithmetical Reducibilities II | 1972-01-01 | Paper |
| Applications of Forcing to the Degree-Theory of the Arithmetical Hierarchy | 1972-01-01 | Paper |
| Arithmetical Reducibilities I | 1971-01-01 | Paper |
