| Publication | Date of Publication | Type |
|---|
| Improved local testing for multiplicity codes | 2024-08-22 | Paper |
| Unbalanced expanders from multiplicity codes | 2024-08-22 | Paper |
| The plane test is a local tester for multiplicity codes | 2024-07-05 | Paper |
| Expander random walks: the general case and limitations | 2024-06-24 | Paper |
| Approximating iterated multiplication of stochastic matrices in small space | 2024-05-08 | Paper |
| Expander random walks: a Fourier-analytic approach | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084350 | 2023-10-31 | Paper |
| Error reduction for weighted PRGs against read once branching programs | 2023-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875499 | 2023-02-03 | Paper |
| On hitting-set generators for polynomials that vanish rarely | 2022-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092448 | 2022-07-21 | Paper |
| An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy | 2022-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002644 | 2021-07-28 | Paper |
| List-Decoding with Double Samplers | 2021-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121891 | 2020-09-22 | Paper |
| On the Entropy Loss and Gap of Condensers | 2019-12-16 | Paper |
| List Decoding with Double Samplers | 2019-10-15 | Paper |
| On approximating the eigenvalues of stochastic matrices in probabilistic logspace | 2017-10-18 | Paper |
| Explicit, almost optimal, epsilon-balanced codes | 2017-08-17 | Paper |
| An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy | 2017-08-17 | Paper |
| Approximate Quantum Error Correction for Correlated Noise | 2017-07-12 | Paper |
| The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent | 2017-04-25 | Paper |
| Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences | 2016-04-11 | Paper |
| Dense quantum coding and quantum finite automata | 2015-12-07 | Paper |
| On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace | 2015-10-27 | Paper |
| Provable unlinkability against traffic analysis with low message overhead | 2015-08-03 | Paper |
| On the de-randomization of space-bounded approximate counting problems | 2015-06-15 | Paper |
| Interaction in quantum communication and the complexity of set disjointness | 2015-02-27 | Paper |
| Loss-less condensers, unbalanced expanders, and extractors | 2015-02-27 | Paper |
| Extractor codes | 2015-02-27 | Paper |
| Short seed extractors against quantum storage | 2015-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934643 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191573 | 2014-10-06 | Paper |
| Quantum bit escrow | 2014-09-26 | Paper |
| Normal subgroup reconstruction and quantum computation using group representations | 2014-09-26 | Paper |
| Inverting well conditioned matrices in quantum logspace | 2014-08-07 | Paper |
| Constructing Small-Bias Sets from Algebraic-Geometric Codes | 2014-07-25 | Paper |
| Better short-seed quantum-proof extractors | 2012-03-13 | Paper |
| Short Seed Extractors against Quantum Storage | 2011-10-18 | Paper |
| A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002816 | 2011-05-24 | Paper |
| On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy | 2011-05-24 | Paper |
| Adiabatic quantum state generation and statistical zero knowledge | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3400474 | 2010-02-05 | Paper |
| Non-interactive timestamping in the bounded-storage model | 2009-05-08 | Paper |
| Worst-Case to Average-Case Reductions Revisited | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549716 | 2009-01-05 | Paper |
| Extractor Codes | 2008-12-21 | Paper |
| Interaction in Quantum Communication | 2008-12-21 | Paper |
| Improving the Alphabet-Size in Expander-Based Code Constructions | 2008-12-21 | Paper |
| An O (log( n ) 4/3 ) space algorithm for ( s, t ) connectivity in undirected graphs | 2008-05-05 | Paper |
| Adiabatic Quantum State Generation | 2008-03-28 | Paper |
| If NP languages are hard on the worst-case, then it is easy to find their hard instances | 2008-03-11 | Paper |
| On the power of quantum, one round, two prover interactive proof systems | 2008-01-21 | Paper |
| Lossless condensers, unbalanced expanders, and extractors | 2007-11-12 | Paper |
| Extractors from Reed-Muller codes | 2006-07-12 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Financial Cryptography | 2005-06-13 | Paper |
| Uniform hardness versus randomness tradeoffs for Arthur-Merlin games | 2005-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4817504 | 2004-09-24 | Paper |
| The Quantum Communication Complexity of Sampling | 2004-01-08 | Paper |
| The Hidden Subgroup Problem and Quantum Computation Using Group Representations | 2003-06-19 | Paper |
| Storing information with extractors. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536287 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4542537 | 2002-08-01 | Paper |
| Almost optimal dispersers | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941187 | 2002-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526986 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941879 | 2000-07-19 | Paper |
| Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators | 2000-03-19 | Paper |
| Extracting randomness: A survey and new constructions | 2000-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259976 | 1999-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234059 | 1999-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228480 | 1999-05-18 | Paper |
| A note on PCP vs. MIP | 1997-02-27 | Paper |
