| Publication | Date of Publication | Type |
|---|
| Nonuniform reductions and NP-completeness | 2022-07-26 | Paper |
| Polynomial-time random oracles and separating complexity classes | 2022-03-14 | Paper |
| Nonuniform reductions and NP-completeness | 2020-08-05 | Paper |
| Nondeterminisic sublinear time has measure 0 in P | 2019-06-27 | Paper |
| Autoreducibility of NP-complete sets under strong hypotheses | 2018-04-18 | Paper |
| Autoreducibility of NP-complete sets | 2018-01-24 | Paper |
| On the NP-Completeness of the Minimum Circuit Size Problem. | 2017-07-13 | Paper |
| The arithmetical complexity of dimension and randomness | 2017-07-12 | Paper |
| Kolmogorov complexity in randomness extraction | 2015-09-24 | Paper |
| Exact learning algorithms, betting games, and circuit lower bounds | 2015-09-24 | Paper |
| Unions of disjoint NP-complete sets | 2015-09-07 | Paper |
| Strong reductions and isomorphism of complete sets | 2015-02-24 | Paper |
| Base invariance of feasible dimension | 2014-04-11 | Paper |
| Learning Reductions to Sparse Sets | 2013-09-20 | Paper |
| Length-increasing reductions for PSPACE-completeness | 2013-09-20 | Paper |
| Limitations of efficient reducibility to the Kolmogorov random strings | 2013-01-30 | Paper |
| Collapsing and separating completeness notions under average-case and worst-case hypotheses | 2012-12-07 | Paper |
| Kolmogorov complexity in randomness extraction | 2012-10-24 | Paper |
| Collapsing and separating completeness notions under average-case and worst-case hypotheses | 2012-01-23 | Paper |
| Dimension, halfspaces, and the density of hard sets | 2011-11-30 | Paper |
| Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds | 2011-11-08 | Paper |
| Unions of disjoint NP-complete sets | 2011-08-17 | Paper |
| Exact learning algorithms, betting games, and circuit lower bounds | 2011-07-06 | Paper |
| Extracting Kolmogorov complexity with applications to dimension zero-one laws | 2011-04-28 | Paper |
| Lower bounds for reducibility to the Kolmogorov random strings | 2010-07-29 | Paper |
| Resource-bounded strong dimension versus resource-bounded category | 2009-12-04 | Paper |
| Scaled dimension and the Kolmogorov complexity of Turing-hard sets | 2009-05-08 | Paper |
| Gales suffice for constructive dimension | 2009-03-23 | Paper |
| Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws | 2009-03-12 | Paper |
| Comparing Reductions to NP-Complete Sets | 2009-03-12 | Paper |
| Dimension, Halfspaces, and the Density of Hard Sets | 2009-03-06 | Paper |
| Hardness hypotheses, derandomization, and circuit complexity | 2008-08-20 | Paper |
| Effective Strong Dimension in Algorithmic Information and Computational Complexity | 2008-06-19 | Paper |
| Strong Reductions and Isomorphism of Complete Sets | 2008-04-24 | Paper |
| Partial bi-immunity, scaled dimension, and NP-completeness | 2008-04-03 | Paper |
| Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets | 2008-03-19 | Paper |
| Upward separations and weaker hypotheses in resource-bounded measure | 2008-01-07 | Paper |
| Online Learning and Resource‐Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets | 2008-01-03 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| Comparing reductions to NP-complete sets | 2007-05-14 | Paper |
| Why computational complexity requires stricter martingales | 2006-10-25 | Paper |
| Dimension, entropy rates, and compression | 2006-06-30 | Paper |
| Hausdorff dimension and oracle constructions | 2006-04-28 | Paper |
| Entropy rates and finite-state dimension | 2006-03-20 | Paper |
| Correspondence principles for effective dimensions | 2006-02-08 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| Small Spans in Scaled Dimension | 2005-02-21 | Paper |
| Scaled dimension and nonuniform complexity | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737189 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737188 | 2004-08-11 | Paper |
| The size of SPP | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449182 | 2004-02-08 | Paper |
| Fractal dimension and logarithmic loss unpredictability. | 2003-08-17 | Paper |
| MAX3SAT is exponentially hard to approximate if NP has positive dimension. | 2003-01-21 | Paper |
