| ANTICONCENTRATION AND THE EXACT GAP-HAMMING PROBLEM | 0 | 0.34 | 2022 |
| Model Selection in Contextual Stochastic Bandit Problems | 0 | 0.34 | 2020 |
| The Communication Complexity of the Exact Gap-Hamming Problem. | 0 | 0.34 | 2020 |
| On Densification for Minwise Hashing. | 0 | 0.34 | 2019 |
| Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. | 0 | 0.34 | 2019 |
| Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers. | 0 | 0.34 | 2018 |
| Simplified Separation of Information and Communication | 1 | 0.36 | 2018 |
| Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers. | 1 | 0.36 | 2017 |
| ON EXPRESSING MAJORITY AS A MAJORITY OF MAJORITIES | 0 | 0.34 | 2017 |
| Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. | 0 | 0.34 | 2016 |
| A Direct-Sum Theorem for Read-Once Branching Programs. | 0 | 0.34 | 2016 |
| On Parallelizing Streaming Algorithms. | 0 | 0.34 | 2015 |
| How to Compress Asymmetric Communication. | 5 | 0.44 | 2015 |
| Circuits with Medium Fan-In. | 1 | 0.35 | 2015 |
| Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness. | 4 | 0.39 | 2014 |
| Information Equals Amortized Communication | 63 | 2.21 | 2014 |
| How to compress interactive communication | 48 | 1.81 | 2013 |
| Direct product via round-preserving compression | 11 | 0.81 | 2013 |
| Spherical cubes: optimal foams from computational hardness amplification | 10 | 0.50 | 2012 |
| Direct Products in Communication Complexity | 17 | 0.74 | 2012 |
| Formulas Resilient to Short-Circuit Errors | 6 | 0.43 | 2012 |
| Special Issue “Conference on Computational Complexity 2011” Guest Editor’s Foreword | 0 | 0.34 | 2012 |
| Restriction access | 7 | 0.58 | 2011 |
| Deterministic extractors for small-space sources | 31 | 1.21 | 2011 |
| Parallel Repetition in Projection Games and a Concentration Bound | 30 | 1.68 | 2011 |
| Pseudorandom Generators for Regular Branching Programs. | 28 | 1.06 | 2010 |
| Toward Coding for Maximum Errors in Interactive Communication. | 21 | 1.34 | 2010 |
| Efficient Communication Using Partial Information | 4 | 0.65 | 2010 |
| Extractors for a Constant Number of Polynomially Small Min-Entropy Independent Sources | 41 | 1.51 | 2009 |
| 2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness | 21 | 0.77 | 2009 |
| Direct Sums in Randomized Communication Complexity | 3 | 0.39 | 2009 |
| Strong Parallel Repetition Theorem for Free Projection Games | 16 | 0.87 | 2009 |
| Spherical Cubes and Rounding in High Dimensions | 5 | 0.49 | 2008 |
| A 2-Source Almost-Extractor for Linear Entropy | 6 | 0.52 | 2008 |
| Extractors for Three Uneven-Length Sources | 4 | 0.40 | 2008 |
| Network Extractor Protocols | 12 | 0.55 | 2008 |
| Rounding Parallel Repetitions of Unique Games | 23 | 1.26 | 2008 |
| Extractors for Low-Weight Affine Sources | 13 | 0.95 | 2008 |
| An Exposition of Bourgain's 2-Source Extractor | 20 | 0.88 | 2007 |
| 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction | 55 | 1.98 | 2006 |
| Extractors for a Constant Number of Polynomial Min-Entropy Independent Sources | 1 | 0.34 | 2005 |
| A technique for dynamic updating of Java software | 73 | 3.25 | 2002 |
