| Publication | Date of Publication | Type |
|---|
| Randomness efficient noise stability and generalized small bias sets | 2026-03-23 | Paper |
Nearly optimal pseudorandomness from hardness
Journal of the ACM | 2024-06-06 | Paper |
| Almost Chor-Goldreich sources and adversarial random walks | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829272 (Why is no real title available?) | 2024-04-09 | Paper |
| Improved Extractors for Recognizable and Algebraic Sources | 2023-02-03 | Paper |
Extractors for weak random sources and their applications
Algorithm Theory — SWAT'98 | 2022-12-09 | Paper |
| Extractors for Images of Varieties | 2022-11-26 | Paper |
scientific article; zbMATH DE number 7561551 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
XOR lemmas for resilient functions against polynomials
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Simple optimal hitting sets for small-success RL
SIAM Journal on Computing | 2020-08-18 | Paper |
Pseudorandomness from shrinkage
Journal of the ACM | 2019-11-21 | Paper |
Certifiably pseudorandom financial derivatives
SIAM Journal on Computing | 2019-11-21 | Paper |
Explicit two-source extractors and resilient functions
Annals of Mathematics. Second Series | 2019-08-23 | Paper |
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
(available as arXiv preprint) | 2019-02-20 | Paper |
| scientific article; zbMATH DE number 6789272 (Why is no real title available?) | 2017-10-10 | Paper |
Explicit two-source extractors and resilient functions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Deterministic extractors for additive sources (extended abstract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Rectangles are nonnegative juntas
SIAM Journal on Computing | 2016-10-28 | Paper |
Lower bounds for leader election and collective coin-flipping in the perfect information model
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Low discrepancy sets yield approximate min-wise independent permutation families
Information Processing Letters | 2016-06-16 | Paper |
| scientific article; zbMATH DE number 6472644 (Why is no real title available?) | 2015-08-14 | Paper |
Mining circuit lower bound proofs for meta-algorithms
Computational Complexity | 2015-06-23 | Paper |
Expanders that beat the eigenvalue bound
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
More deterministic simulation in logspace
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Lower bounds for randomized mutual exclusion
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Loss-less condensers, unbalanced expanders, and extractors
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Linear degree extractors and the inapproximability of max clique and chromatic number
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Deterministic extractors for small-space sources
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Privacy amplification and nonmalleable extractors via character sums
SIAM Journal on Computing | 2014-07-30 | Paper |
Privacy amplification and non-malleable extractors via character sums
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Pseudorandom generators for combinatorial shapes
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Pseudorandom generators for combinatorial shapes
SIAM Journal on Computing | 2013-09-25 | Paper |
Pseudorandom generators for polynomial threshold functions
SIAM Journal on Computing | 2013-09-25 | Paper |
Robust pseudorandom generators
Automata, Languages, and Programming | 2013-08-06 | Paper |
Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More)
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation | 2011-08-19 | Paper |
Linear degree extractors and the inapproximability of max clique and chromatic number
Theory of Computing | 2011-05-24 | Paper |
Deterministic extractors for small-space sources
Journal of Computer and System Sciences | 2011-01-18 | Paper |
Testing low-degree polynomials over prime fields
Random Structures & Algorithms | 2010-11-09 | Paper |
Optimal testing of Reed-Muller codes
Property Testing | 2010-10-12 | Paper |
Small-Bias Spaces for Group Products
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
| scientific article; zbMATH DE number 5485538 (Why is no real title available?) | 2009-01-05 | Paper |
Extractor Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Interaction in Quantum Communication
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Extractors for Three Uneven-Length Sources
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Lossless condensers, unbalanced expanders, and extractors
Combinatorica | 2007-11-12 | Paper |
Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
SIAM Journal on Computing | 2007-10-22 | Paper |
Random Selection with an Adversarial Majority
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Extractors from Reed-Muller codes
Journal of Computer and System Sciences | 2006-07-12 | Paper |
Compression of samplable sources
Computational Complexity | 2006-02-08 | Paper |
Combinatorial bounds for list decoding
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model
SIAM Journal on Computing | 2002-09-29 | Paper |
Perfect information leader election in \(\log^*n+O(1)\) rounds
Journal of Computer and System Sciences | 2002-07-04 | Paper |
| scientific article; zbMATH DE number 1418263 (Why is no real title available?) | 2000-12-03 | Paper |
Asymptotically good codes correcting insertions, deletions, and transpositions
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Expanders that beat the eigenvalue bound: Explicit construction and applications
Combinatorica | 1999-12-08 | Paper |
Computing with Very Weak Random Sources
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256745 (Why is no real title available?) | 1999-03-01 | Paper |
Lower Bounds for Randomized Mutual Exclusion
SIAM Journal on Computing | 1998-09-21 | Paper |
| scientific article; zbMATH DE number 1097580 (Why is no real title available?) | 1998-07-19 | Paper |
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Combinatorica | 1998-03-26 | Paper |
| Multiple cover time | 1997-10-01 | Paper |
On Unapproximable Versions of $NP$-Complete Problems
SIAM Journal on Computing | 1997-06-09 | Paper |
Randomness is linear in space
Journal of Computer and System Sciences | 1996-07-16 | Paper |
Derandomized graph products
Computational Complexity | 1995-07-16 | Paper |
Optimal speedup of Las Vegas algorithms
Information Processing Letters | 1993-11-15 | Paper |
A Technique for Lower Bounding the Cover Time
SIAM Journal on Discrete Mathematics | 1992-06-28 | Paper |
On the time to traverse all edges of a graph
Information Processing Letters | 1992-06-26 | Paper |
Covering times of random walks on bounded degree trees and other graphs
Journal of Theoretical Probability | 1989-01-01 | Paper |
