| Publication | Date of Publication | Type |
|---|
| The Complexity of Poset Games | 2022-06-28 | Paper |
| The complexity of regex crosswords | 2022-06-13 | Paper |
| Bipartite Perfect Matching is in Quasi-NC | 2021-06-29 | Paper |
| Complexity of regex crosswords | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967182 | 2019-07-03 | Paper |
| Weakly useful sequences | 2019-01-10 | Paper |
| Results on resource-bounded measure | 2018-07-04 | Paper |
| Beyond PNP=NEXP | 2017-12-04 | Paper |
| Bipartite perfect matching is in quasi-NC | 2017-09-29 | Paper |
| Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games | 2016-01-11 | Paper |
| Quantum Algorithms for a Set of Group Theoretic Problems | 2015-07-06 | Paper |
| ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM | 2014-07-04 | Paper |
| Functions that preserve p-randomness | 2014-01-16 | Paper |
| Fixed-Parameter Extrapolation and Aperiodic Order | 2012-12-12 | Paper |
| Monochromatic Boxes in Colored Grids | 2012-03-15 | Paper |
| A Statement in Combinatorics that is Independent of ZFC (an exposition) | 2012-01-05 | Paper |
| Functions that preserve p-randomness | 2011-08-19 | Paper |
| Rectangle Free Coloring of Grids | 2010-05-20 | Paper |
| The complexity of learning SUBSEQ(A) | 2009-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395956 | 2009-09-15 | Paper |
| The complexity of finding SUBSEQ\((A)\) | 2009-09-02 | Paper |
| Efficient Universal Quantum Circuits | 2009-07-23 | Paper |
| The Complexity of Learning SUBSEQ (A) | 2008-09-04 | Paper |
| On the Complexity of the Hidden Subgroup Problem | 2008-05-27 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Every polynomial-time 1-degree collapses if and only if P = PSPACE | 2005-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4668728 | 2005-04-15 | Paper |
| Inverting onto functions. | 2004-03-14 | Paper |
| PP-lowness and a simple definition of AWPP | 2003-08-26 | Paper |
| An oracle builder's toolkit | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551212 | 2002-09-08 | Paper |
| Two oracles that force a big crunch | 2002-05-05 | Paper |
| Hyper-polynomial hierarchies and the polynomial jump | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230324 | 2002-01-17 | Paper |
| Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy | 2000-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937192 | 2000-02-03 | Paper |
| Bounded Immunity and Btt-Reductions | 1999-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259998 | 1999-09-08 | Paper |
| Oracles That Compute Values | 1998-02-10 | Paper |
| Gap-definability as a closure property | 1997-11-18 | Paper |
| The Isomorphism Conjecture Holds Relative to an Oracle | 1996-04-24 | Paper |
| Almost weakly 2-generic sets | 1996-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281550 | 1995-10-09 | Paper |
| Gap-definable counting classes | 1994-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281541 | 1994-03-10 | Paper |
