| Publication | Date of Publication | Type |
|---|
Structural properties of nonautoreducible sets
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Fine separation of average time complexity classes
STACS 96 | 2017-11-16 | Paper |
Introduction to autoreducibility and mitoticity
Computability and Complexity | 2017-04-04 | Paper |
| scientific article; zbMATH DE number 6691435 (Why is no real title available?) | 2017-03-03 | Paper |
A thirty year old conjecture about promise problems
Computational Complexity | 2016-11-30 | Paper |
A thirty year old conjecture about promise problems
Automata, Languages, and Programming | 2013-08-12 | Paper |
Autoreducibility of complete sets for log-space and polynomial-time reductions
Automata, Languages, and Programming | 2013-08-06 | Paper |
Computability and complexity theory.
Texts in Computer Science | 2011-10-18 | Paper |
THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS
International Journal of Foundations of Computer Science | 2009-06-30 | Paper |
Non-mitotic sets
Theoretical Computer Science | 2009-05-28 | Paper |
The Informational Content of Canonical Disjoint NP-Pairs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
The complexity of unions of disjoint sets
Journal of Computer and System Sciences | 2008-11-19 | Paper |
Splitting NP-Complete Sets
SIAM Journal on Computing | 2008-10-28 | Paper |
Non-mitotic Sets
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Redundancy in Complete Sets
STACS 2006 | 2008-03-19 | Paper |
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Theoretical Computer Science | 2007-10-18 | Paper |
The Complexity of Unions of Disjoint Sets
STACS 2007 | 2007-09-03 | Paper |
Autoreducibility, mitoticity, and immunity
Journal of Computer and System Sciences | 2007-05-30 | Paper |
Properties of NP‐Complete Sets
SIAM Journal on Computing | 2007-05-03 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Canonical disjoint NP-pairs of propositional proof systems
Theoretical Computer Science | 2007-02-26 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Reductions between disjoint NP-pairs
Information and Computation | 2005-09-02 | Paper |
Disjoint NP-Pairs
SIAM Journal on Computing | 2005-02-21 | Paper |
Bi-immunity separates strong NP-completeness notions
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2086403 (Why is no real title available?) | 2004-08-11 | Paper |
Distributionally hard languages
Theory of Computing Systems | 2002-09-11 | Paper |
Separation of NP-completeness notions
SIAM Journal on Computing | 2002-04-23 | Paper |
Computability and complexity theory
Texts in Computer Science | 2001-02-19 | Paper |
| scientific article; zbMATH DE number 1555921 (Why is no real title available?) | 2001-01-24 | Paper |
Adaptive versus nonadaptive queries to NP and P-selective sets
Computational Complexity | 2000-09-26 | Paper |
Complete distributional problems, hard languages, and resource-bounded measure
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1398071 (Why is no real title available?) | 2000-02-03 | Paper |
Fine Separation of Average-Time Complexity Classes
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1332676 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
Adaptive mesh refinement for localised phenomena
Computers & Structures | 1999-06-27 | Paper |
| 3D adaptive mesh refinement | 1999-03-09 | Paper |
A hierarchy based on output multiplicity
Theoretical Computer Science | 1999-01-12 | Paper |
Multi-mesh and adaptivity in 3D shape optimization
Computers & Structures | 1998-11-01 | Paper |
Oracles That Compute Values
SIAM Journal on Computing | 1998-02-10 | Paper |
\(p\)-Selective sets and reducing search to decision vs. self-reducibility
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Computing Solutions Uniquely Collapses the Polynomial Hierarchy
SIAM Journal on Computing | 1996-10-16 | Paper |
NONDETERMINISTICALLY SELECTIVE SETS
International Journal of Foundations of Computer Science | 1996-08-13 | Paper |
Boundary layers in uniform and variable thickness plates with rectangular and curved planforms using the finite strip method
Communications in Numerical Methods in Engineering | 1996-01-30 | Paper |
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences | 1995-02-13 | Paper |
Two‐dimensional transient dynamic analysis with adaptive mesh refinement
Communications in Numerical Methods in Engineering | 1995-01-02 | Paper |
| scientific article; zbMATH DE number 512846 (Why is no real title available?) | 1994-03-10 | Paper |
Hard promise problems and nonuniform complexity
Theoretical Computer Science | 1993-09-16 | Paper |
| scientific article; zbMATH DE number 47207 (Why is no real title available?) | 1993-01-23 | Paper |
A survey of one-way functions in complexity theory
Mathematical Systems Theory | 1992-09-27 | Paper |
Oracles for structural properties: The isomorphism problem and public-key cryptography
Journal of Computer and System Sciences | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 58287 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 18529 (Why is no real title available?) | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4213444 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4106765 (Why is no real title available?) | 1989-01-01 | Paper |
Complexity Measures for Public-Key Cryptosystems
SIAM Journal on Computing | 1988-01-01 | Paper |
Natural Self-Reducible Sets
SIAM Journal on Computing | 1988-01-01 | Paper |
Promise problems complete for complexity classes
Information and Computation | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4010508 (Why is no real title available?) | 1987-01-01 | Paper |
Qualitative relativizations of complexity classes
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Hard-core theorems for complexity classes
Journal of the ACM | 1985-01-01 | Paper |
The complexity of promise problems with applications to public-key cryptography
Information and Control | 1984-01-01 | Paper |
Quantitative Relativizations of Complexity Classes
SIAM Journal on Computing | 1984-01-01 | Paper |
Characterizations of reduction classes modulo oracle conditions
Mathematical Systems Theory | 1984-01-01 | Paper |
Positive Relativizations of Complexity Classes
SIAM Journal on Computing | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3811467 (Why is no real title available?) | 1982-01-01 | Paper |
Reductions on NP and p-selective sets
Theoretical Computer Science | 1982-01-01 | Paper |
Analogues of semirecursive sets and effective reducibilities to the study of NP complexity
Information and Control | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3831293 (Why is no real title available?) | 1982-01-01 | Paper |
Some observations on NP real numbers and P-selective sets
Journal of Computer and System Sciences | 1981-01-01 | Paper |
P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
Mathematical Systems Theory | 1979-01-01 | Paper |
A second step toward the polynomial hierarchy
Theoretical Computer Science | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3655913 (Why is no real title available?) | 1979-01-01 | Paper |
Polynomial Time Enumeration Reducibility
SIAM Journal on Computing | 1978-01-01 | Paper |
Inclusion complete tally languages and the Hartmanis-Berman conjecture
Mathematical Systems Theory | 1977-01-01 | Paper |
A comparison of polynomial time reducibilities
Theoretical Computer Science | 1975-01-01 | Paper |
Turing machines and the spectra of first-order formulas
Journal of Symbolic Logic | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3592966 (Why is no real title available?) | 1974-01-01 | Paper |
Relativized Halting Problems
Mathematical Logic Quarterly | 1974-01-01 | Paper |
| Sets of Formulas Valid in Finite Structures | 1973-01-01 | Paper |
Completeness of calculii for axiomatically defined classes of algebras
Algebra Universalis | 1972-01-01 | Paper |
Arithmetical Reducibilities II
Mathematical Logic Quarterly | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3591972 (Why is no real title available?) | 1972-01-01 | Paper |
Applications of Forcing to the Degree-Theory of the Arithmetical Hierarchy
Proceedings of the London Mathematical Society | 1972-01-01 | Paper |
Arithmetical Reducibilities I
Mathematical Logic Quarterly | 1971-01-01 | Paper |
