| Publication | Date of Publication | Type |
|---|
| Resource-bounded kolmogorov complexity revisited | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5072480 | 2022-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967210 | 2019-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4619826 | 2019-02-07 | Paper |
| Measure, category and learning theory | 2019-01-10 | Paper |
| Results on resource-bounded measure | 2018-07-04 | Paper |
| Resource-bounded instance complexity | 2017-12-04 | Paper |
| Beyond PNP=NEXP | 2017-12-04 | Paper |
| New non-uniform lower bounds for uniform classes | 2017-10-10 | Paper |
| Robust simulations and significant separations | 2017-09-28 | Paper |
| The Golden Ticket | 2017-07-20 | Paper |
| Complexity with Rod | 2017-04-04 | Paper |
| Optimality and domination in repeated games with bounded players | 2016-09-01 | Paper |
| Time-space lower bounds for satisfiability | 2015-12-04 | Paper |
| Nondeterministic Separations | 2015-09-30 | Paper |
| Testing Closeness of Discrete Distributions | 2014-02-17 | Paper |
| Learning Reductions to Sparse Sets | 2013-09-20 | Paper |
| The Golden Ticket | 2013-04-02 | Paper |
| Inseparability and strong hypotheses for disjoint NP pairs | 2012-12-07 | Paper |
| Inseparability and Strong Hypotheses for Disjoint NP Pairs. | 2012-01-23 | Paper |
| Robust simulations and significant separations | 2011-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002771 | 2011-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002806 | 2011-05-24 | Paper |
| Extracting Kolmogorov complexity with applications to dimension zero-one laws | 2011-04-28 | Paper |
| Complexity classes of equivalence problems revisited | 2011-04-28 | Paper |
| Infeasibility of instance compression and succinct PCPs for NP | 2011-01-18 | Paper |
| Gaming prediction markets: equilibrium strategies with a market maker | 2010-11-08 | Paper |
| Beyond NP | 2010-08-16 | Paper |
| Hierarchies for semantic classes | 2010-08-16 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| Does the polynomial hierarchy collapse if onto functions are invertible? | 2010-03-05 | Paper |
| Sophistication revisited | 2009-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395967 | 2009-09-15 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| Unconditional Lower Bounds against Advice | 2009-07-14 | Paper |
| On the complexity of succinct zero-sum games | 2009-06-17 | Paper |
| The Complexity of Forecast Testing | 2009-05-18 | Paper |
| Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws | 2009-03-12 | Paper |
| Efficient learning algorithms yield circuit lower bounds | 2009-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549693 | 2009-01-05 | Paper |
| Quantum Property Testing | 2008-10-28 | Paper |
| Inverting Onto Functions and Polynomial Hierarchy | 2008-06-03 | Paper |
| Kolmogorov Complexity with Error | 2008-03-19 | Paper |
| Linear Advice for Randomized Logarithmic Space | 2008-03-19 | Paper |
| Proving SAT does not have small circuits with an application to the two queries problem | 2008-03-11 | Paper |
| Efficient Learning Algorithms Yield Circuit Lower Bounds | 2007-09-14 | Paper |
| Very Sparse Leaf Languages | 2007-09-05 | Paper |
| Infinitely‐Often Autoreducible Sets | 2007-06-26 | Paper |
| Circuit lower bounds à la Kolmogorov | 2006-10-10 | Paper |
| A tight lower bound for restricted PIR protocols | 2006-09-28 | Paper |
| Enumerations of the Kolmogorov function | 2006-08-03 | Paper |
| Computational depth: Concept and applications | 2006-04-28 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time | 2005-10-28 | Paper |
| Computation in a distributed information market | 2005-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465360 | 2005-08-22 | Paper |
| Prediction and dimension | 2005-06-13 | Paper |
| Some results on derandomization | 2005-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046719 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471333 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471376 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470510 | 2004-07-01 | Paper |
| Separability and one-way functions | 2004-05-27 | Paper |
| Inverting onto functions. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449181 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2776270 | 2004-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418651 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418680 | 2003-08-11 | Paper |
| An oracle builder's toolkit | 2003-07-29 | Paper |
| Uniformly hard languages. | 2003-05-25 | Paper |
| One complexity theorist's view of quantum computing | 2003-05-14 | Paper |
| Distributionally hard languages | 2002-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542538 | 2002-08-01 | Paper |
| Relativized worlds with an infinite hierarchy | 2002-07-25 | Paper |
| Two oracles that force a big crunch | 2002-05-05 | Paper |
| Resource-Bounded Kolmogorov Complexity Revisited | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230324 | 2002-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503828 | 2001-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499288 | 2001-03-05 | Paper |
| Time-space tradeoffs for satisfiability | 2001-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527045 | 2001-01-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525727 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790383 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501551 | 2000-09-04 | Paper |
| On the power of multi-prover interactive protocols | 2000-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258567 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258587 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252736 | 2000-04-26 | Paper |
| Separating Complexity Classes Using Autoreducibility | 2000-03-19 | Paper |
| Two queries | 2000-01-17 | Paper |
| Complexity limitations on quantum computation | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258566 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258585 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251044 | 1999-06-17 | Paper |
| On coherence, random-self-reducibility, and self-correction | 1999-01-03 | Paper |
| L-Printable Sets | 1998-09-21 | Paper |
| On the relative sizes of learnable sets | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381383 | 1998-05-12 | Paper |
| Gap-definability as a closure property | 1997-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359457 | 1997-10-08 | Paper |
| On resource-bounded instance complexity | 1997-02-27 | Paper |
| Generic separations | 1996-07-16 | Paper |
| The Isomorphism Conjecture Holds Relative to an Oracle | 1996-04-24 | Paper |
| PP is closed under truth-table reductions | 1996-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281550 | 1995-10-09 | Paper |
| Gap-definable counting classes | 1994-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4314041 | 1994-11-30 | Paper |
| The power of adaptiveness and additional queries in random-self- reductions | 1994-09-01 | Paper |
| Algebraic methods for interactive proof systems | 1994-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4289278 | 1994-05-24 | Paper |
| \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs | 1994-05-08 | Paper |
| Extremes in the degrees of inferability | 1994-05-03 | Paper |
| Random-Self-Reducibility of Complete Sets | 1993-12-20 | Paper |
| Interactive proof systems and alternating time-space complexity | 1993-12-15 | Paper |
| Arithmetization: A new method in structural complexity theory | 1993-10-10 | Paper |
| Non-deterministic exponential time has two-prover interactive protocols | 1993-10-10 | Paper |
| Addendum to: Non-deterministic exponential time has two-prower interactive protocols | 1993-08-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035675 | 1993-05-18 | Paper |
| On the power of two-local random reductions | 1993-05-16 | Paper |
| Are there interactive protocols for co-NP languages? | 1988-01-01 | Paper |
