| Spectral Sparsification via Bounded-Independence Sampling. | 0 | 0.34 | 2020 |
| Randomness Efficient Noise Stability and Generalized Small Bias Sets. | 0 | 0.34 | 2020 |
| XOR lemmas for resilient functions against polynomials | 0 | 0.34 | 2020 |
| Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. | 0 | 0.34 | 2019 |
| Improved Extractors for Recognizable and Algebraic Sources. | 0 | 0.34 | 2018 |
| Simple Optimal Hitting Sets for Small-Success $\mathbf{RL}$. | 0 | 0.34 | 2018 |
| Simple Optimal Hitting Sets for Small-Success RL | 0 | 0.34 | 2018 |
| Existence of Simple Extractors. | 0 | 0.34 | 2018 |
| Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. | 0 | 0.34 | 2016 |
| New Extractors for Interleaved Sources. | 0 | 0.34 | 2016 |
| Bitcoin Beacon. | 0 | 0.34 | 2016 |
| Robust Fourier and Polynomial Curve Fitting | 2 | 0.39 | 2016 |
| Mining Circuit Lower Bound Proofs for Meta-Algorithms | 13 | 0.58 | 2015 |
| Deterministic Extractors for Additive Sources: Extended Abstract. | 0 | 0.34 | 2015 |
| Deterministic Extractors for Additive Sources. | 0 | 0.34 | 2014 |
| Non-malleable Codes against Constant Split-State Tampering | 37 | 1.25 | 2014 |
| Privacy Amplification and Nonmalleable Extractors Via Character Sums. | 14 | 0.58 | 2014 |
| Rectangles Are Nonnegative Juntas. | 20 | 1.11 | 2014 |
| On Low Discrepancy Samplings in Product Spaces of Motion Groups. | 2 | 0.54 | 2014 |
| Pseudorandom Generators for Combinatorial Shapes | 6 | 0.48 | 2013 |
| Robust pseudorandom generators | 0 | 0.34 | 2013 |
| Pseudorandom Financial Derivatives | 0 | 0.34 | 2011 |
| Privacy Amplification and Non-malleable Extractors via Character Sums | 14 | 0.70 | 2011 |
| Deterministic extractors for small-space sources | 31 | 1.21 | 2011 |
| Non-malleable extractors via character sums | 1 | 0.37 | 2011 |
| Pseudorandom generators for polynomial threshold functions | 29 | 1.25 | 2010 |
| Fooling Functions of Halfspaces under Product Distributions | 20 | 1.02 | 2010 |
| Can Random Coin Flips Speed Up a Computer? | 0 | 0.34 | 2010 |
| Small-Bias Spaces for Group Products | 15 | 0.81 | 2009 |
| Optimal Testing of Reed-Muller Codes | 28 | 1.14 | 2009 |
| Extractors for Three Uneven-Length Sources | 4 | 0.40 | 2008 |
| List-decoding reed-muller codes over small fields | 29 | 1.29 | 2008 |
| Network Extractor Protocols | 12 | 0.55 | 2008 |
| Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography | 69 | 3.12 | 2007 |
| Linear degree extractors and the inapproximability of max clique and chromatic number | 168 | 6.96 | 2007 |
| Interaction in Quantum Communication | 11 | 0.62 | 2007 |
| Lossless Condensers, Unbalanced Expanders, And Extractors | 50 | 1.87 | 2007 |
| Random Selection with an Adversarial Majority | 17 | 0.86 | 2006 |
| Extractors from Reed-Muller Codes | 48 | 2.25 | 2006 |
| Compression of Samplable Sources | 10 | 0.60 | 2005 |
| Testing Low-Degree Polynomials over Prime Fields | 32 | 1.38 | 2004 |
| Extractor codes | 39 | 1.97 | 2004 |
| Combinatorial bounds for list decoding | 46 | 3.16 | 2002 |
| Lower bounds for leader election and collective coin-flipping in the perfect information model | 13 | 1.00 | 2002 |
| Expander Graphs for Digital Stream Authentication and Robust Overlay Networks | 38 | 2.23 | 2002 |
| Perfect information leader election in log * n+0(1) rounds | 21 | 1.25 | 2001 |
| Loss-less condensers, unbalanced expanders, and extractors | 74 | 3.18 | 2001 |
| Interaction in quantum communication and the complexity of set disjointness | 33 | 2.23 | 2001 |
| Interaction in Quantum Communication Complexity | 4 | 0.59 | 2000 |
| Tight Analyses of Two Local Load Balancing Algorithms | 52 | 4.75 | 1999 |
