| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6126258 | 2024-04-09 | Paper |
| Quantum majority vote | 2022-11-21 | Paper |
| Resource-bounded kolmogorov complexity revisited | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090458 | 2022-07-18 | Paper |
| High entropy random selection protocols | 2021-03-26 | Paper |
| On the cutting edge of relativization: The resource bounded injury method | 2019-04-29 | Paper |
| Sparse selfreducible sets and nonuniform lower bounds | 2019-01-11 | Paper |
| The first peptides: the evolutionary transition between prebiotic amino acids and early proteins | 2018-12-11 | Paper |
| Results on resource-bounded measure | 2018-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4638074 | 2018-05-03 | Paper |
| Catalytic space: non-determinism and hierarchy | 2018-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601876 | 2018-01-24 | Paper |
| On the sparse set conjecture for sets with low density | 2017-12-04 | Paper |
| Compressibility and resource bounded measure | 2017-11-16 | Paper |
| The complexity of generating and checking proofs of membership | 2017-11-16 | Paper |
| Long-lived renaming made fast | 2017-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5278031 | 2017-07-12 | Paper |
| The garden-hose model | 2017-05-16 | Paper |
| Entanglement-Assisted Zero-Error Source-Channel Coding | 2017-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2969044 | 2017-03-13 | Paper |
| Quantum communication complexity advantage implies violation of a Bell inequality | 2017-02-16 | Paper |
| Distinguishing two probability ensembles with one sample from each ensemble | 2017-01-12 | Paper |
| Towards a reverse Newman's theorem in interactive information complexity | 2016-11-29 | Paper |
| Optimal routing tables | 2015-09-11 | Paper |
| Computing with a full memory | 2015-06-26 | Paper |
| Hardness of approximation for knapsack problems | 2015-05-29 | Paper |
| Near-Optimal and Explicit Bell Inequality Violations | 2014-10-06 | Paper |
| Reductions to the set of random strings: The resource-bounded case | 2014-09-05 | Paper |
| Violating the Shannon capacity of metric graphs with entanglement | 2014-07-25 | Paper |
| Entanglement-Assisted Zero-Error Source-Channel Coding | 2014-06-11 | Paper |
| Position-Based Quantum Cryptography: Impossibility and Constructions | 2014-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5414625 | 2014-05-07 | Paper |
| Learning Reductions to Sparse Sets | 2013-09-20 | Paper |
| On the importance of having an identity or, is consensus really universal? | 2013-06-07 | Paper |
| Learning parities in the mistake-bound model | 2013-04-04 | Paper |
| Reductions to the set of random strings: The resource-bounded case | 2012-09-25 | Paper |
| Security of Quantum Bit String Commitment Depends on the Information Measure | 2011-12-26 | Paper |
| Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial | 2011-12-26 | Paper |
| All Schatten spaces endowed with the Schur product are \(Q\)-algebras | 2011-12-14 | Paper |
| A generalized Grothendieck inequality and nonlocal correlations that require high entanglement | 2011-08-23 | Paper |
| Position-Based Quantum Cryptography: Impossibility and Constructions | 2011-08-12 | Paper |
| Non-uniform reductions | 2010-10-06 | Paper |
| Quantum verification of matrix products | 2010-08-16 | Paper |
| Does the polynomial hierarchy collapse if onto functions are invertible? | 2010-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396548 | 2009-09-19 | Paper |
| Unconditional Lower Bounds against Advice | 2009-07-14 | Paper |
| Quantum zero-error algorithms cannot be composed | 2009-04-28 | Paper |
| High Entropy Random Selection Protocols | 2009-02-17 | Paper |
| Quantum Property Testing | 2008-10-28 | Paper |
| Inverting Onto Functions and Polynomial Hierarchy | 2008-06-03 | Paper |
| Implications of superstrong non-locality for cryptography | 2008-05-22 | Paper |
| Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds | 2008-03-19 | Paper |
| Quantum lower bounds by polynomials | 2008-02-11 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Individual communication complexity | 2007-08-23 | Paper |
| Robust polynomials and quantum algorithms | 2007-08-23 | Paper |
| Enumerations of the Kolmogorov function | 2006-08-03 | Paper |
| Power from Random Strings | 2006-06-01 | Paper |
| Language compression and pseudorandom generators | 2006-02-08 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| What can be efficiently reduced to the Kolmogorov-random strings? | 2005-12-29 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Quantum Algorithms for Element Distinctness | 2005-09-16 | Paper |
| Some results on derandomization | 2005-04-19 | Paper |
| Mutual search | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471333 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542521 | 2004-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418651 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418680 | 2003-08-11 | Paper |
| Complexity measures and decision tree complexity: a survey. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542538 | 2002-08-01 | Paper |
| A lower bound for quantum search of an ordered list | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535080 | 2002-06-12 | Paper |
| Two oracles that force a big crunch | 2002-05-05 | Paper |
| Compressibility and Resource Bounded Measure | 2002-04-23 | Paper |
| Resource-Bounded Kolmogorov Complexity Revisited | 2002-04-23 | Paper |
| The communication complexity of enumeration, elimination, and selection | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766868 | 2002-01-28 | Paper |
| Time and space bounds for reversible simulation | 2002-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505702 | 2001-09-04 | Paper |
| Randomness is Hard | 2001-03-19 | Paper |
| Quantum Entanglement and Communication Complexity | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790418 | 2001-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501551 | 2000-09-04 | Paper |
| New applications of the incompressibility method. II | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258589 | 2000-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258567 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258582 | 2000-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252736 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938627 | 2000-04-25 | Paper |
| Kolmogorov Random Graphs and the Incompressibility Method | 2000-03-19 | Paper |
| Separating Complexity Classes Using Autoreducibility | 2000-03-19 | Paper |
| Two queries | 2000-01-17 | Paper |
| Hard sets are hard to find | 2000-01-17 | Paper |
| Space-efficient Routing Tables for Almost All Networks and the Incompressibility Method | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218523 | 1999-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258566 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4256650 | 1999-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250216 | 1999-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251044 | 1999-06-17 | Paper |
| Functions computable with nonadaptive queries to NP | 1998-08-24 | Paper |
| Splittings, Robustness, and Structure of Complete Sets | 1998-05-10 | Paper |
| An excursion to the Kolmogorov random strings | 1997-08-03 | Paper |
| \(p\)-selective self-reducible sets: a new characterization of P | 1997-03-31 | Paper |
| Random strings make hard instances | 1996-11-27 | Paper |
| SPARSE Reduces Conjunctively to TALLY | 1995-11-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281519 | 1994-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281494 | 1994-03-10 | Paper |
| The relative power of logspace and polynomial time reductions | 1994-01-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035688 | 1993-05-18 | Paper |
| Completeness for nondeterministic complexity classes | 1992-06-26 | Paper |
