| Publication | Date of Publication | Type |
|---|
| Nearly optimal pseudorandomness from hardness | 2024-06-06 | Paper |
| Almost Chor-Goldreich sources and adversarial random walks | 2024-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126271 | 2024-04-09 | Paper |
| Improved Extractors for Recognizable and Algebraic Sources | 2023-02-03 | Paper |
| Extractors for weak random sources and their applications | 2022-12-09 | Paper |
| Extractors for Images of Varieties | 2022-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091215 | 2022-07-21 | Paper |
| XOR lemmas for resilient functions against polynomials | 2021-01-19 | Paper |
| Simple Optimal Hitting Sets for Small-Success RL | 2020-08-18 | Paper |
| Pseudorandomness from Shrinkage | 2019-11-21 | Paper |
| Certifiably Pseudorandom Financial Derivatives | 2019-11-21 | Paper |
| Explicit two-source extractors and resilient functions | 2019-08-23 | Paper |
| Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions | 2019-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368741 | 2017-10-10 | Paper |
| Explicit two-source extractors and resilient functions | 2017-09-29 | Paper |
| Deterministic Extractors for Additive Sources | 2017-05-19 | Paper |
| Rectangles are nonnegative juntas | 2016-10-28 | Paper |
| Lower bounds for leader election and collective coin-flipping in the perfect information model | 2016-09-29 | Paper |
| Low discrepancy sets yield approximate min-wise independent permutation families | 2016-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501846 | 2015-08-14 | Paper |
| Mining circuit lower bound proofs for meta-algorithms | 2015-06-23 | Paper |
| Expanders that beat the eigenvalue bound | 2015-05-07 | Paper |
| Efficient construction of a small hitting set for combinatorial rectangles in high dimension | 2015-05-07 | Paper |
| More deterministic simulation in logspace | 2015-05-07 | Paper |
| Lower bounds for randomized mutual exclusion | 2015-05-07 | 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 |
| Linear degree extractors and the inapproximability of max clique and chromatic number | 2014-11-25 | Paper |
| Deterministic extractors for small-space sources | 2014-11-25 | Paper |
| Pseudorandom generators for polynomial threshold functions | 2014-08-13 | Paper |
| Privacy Amplification and Nonmalleable Extractors Via Character Sums | 2014-07-30 | Paper |
| Pseudorandom generators for combinatorial shapes | 2014-06-05 | Paper |
| Pseudorandom generators for polynomial threshold functions | 2013-09-25 | Paper |
| Pseudorandom generators for combinatorial shapes | 2013-09-25 | Paper |
| Robust Pseudorandom Generators | 2013-08-06 | Paper |
| Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) | 2011-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3002782 | 2011-05-24 | Paper |
| Deterministic extractors for small-space sources | 2011-01-18 | Paper |
| Testing low-degree polynomials over prime fields | 2010-11-09 | Paper |
| Optimal Testing of Reed-Muller Codes | 2010-10-12 | Paper |
| Small-Bias Spaces for Group Products | 2009-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549710 | 2009-01-05 | Paper |
| Extractor Codes | 2008-12-21 | Paper |
| Interaction in Quantum Communication | 2008-12-21 | Paper |
| Extractors for Three Uneven-Length Sources | 2008-11-27 | Paper |
| Lossless condensers, unbalanced expanders, and extractors | 2007-11-12 | Paper |
| Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography | 2007-10-22 | Paper |
| Random Selection with an Adversarial Majority | 2007-09-04 | Paper |
| Extractors from Reed-Muller codes | 2006-07-12 | Paper |
| Compression of samplable sources | 2006-02-08 | Paper |
| Combinatorial bounds for list decoding | 2005-05-11 | Paper |
| Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model | 2002-09-29 | Paper |
| Perfect information leader election in \(\log^*n+O(1)\) rounds | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941822 | 2000-12-03 | Paper |
| Asymptotically good codes correcting insertions, deletions, and transpositions | 2000-09-07 | Paper |
| Expanders that beat the eigenvalue bound: Explicit construction and applications | 1999-12-08 | Paper |
| Computing with Very Weak Random Sources | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228481 | 1999-03-01 | Paper |
| Lower Bounds for Randomized Mutual Exclusion | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4372786 | 1998-07-19 | Paper |
| Efficient construction of a small hitting set for combinatorial rectangles in high dimension | 1998-03-26 | Paper |
| Multiple cover time | 1997-10-01 | Paper |
| On Unapproximable Versions of $NP$-Complete Problems | 1997-06-09 | Paper |
| Randomness is linear in space | 1996-07-16 | Paper |
| Derandomized graph products | 1995-07-16 | Paper |
| Optimal speedup of Las Vegas algorithms | 1993-11-15 | Paper |
| A Technique for Lower Bounding the Cover Time | 1992-06-28 | Paper |
| On the time to traverse all edges of a graph | 1992-06-26 | Paper |
| Covering times of random walks on bounded degree trees and other graphs | 1989-01-01 | Paper |
