| 2026 | ICALP | Local Samplers for Product Distributions. | Jordan Horacsek, Chin Ho Lee, Igor Shinkar, Emanuele Viola, Renfei Zhou |
| 2024 | FOCS | Boosting Uniformity in Quasirandom Groups: Fast and Simple. | Harm Derksen, Chin Ho Lee, Emanuele Viola |
| 2023 | SODA | Efficient resilient functions. | Peter Ivanov, Raghu Meka, Emanuele Viola |
| 2022 | FOCS | Fooling polynomials using invariant theory | Harm Derksen, Emanuele Viola |
| 2021 | CSR | Average-Case Rigidity Lower Bounds. | Xuangui Huang, Emanuele Viola |
| 2021 | ICALP | Fourier Conjectures, Correlation Bounds, and Majority. | Emanuele Viola |
| 2020 | SODA | How to Store a Random Walk. | Emanuele Viola, Omri Weinstein, Huacheng Yu |
| 2018 | FOCS | Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs. | Aryeh Grinberg, Ronen Shaltiel, Emanuele Viola |
| 2018 | ICALP | Revisiting Frequency Moment Estimation in Random Order Streams. | Vladimir Braverman, Emanuele Viola, David P. Woodruff, Lin F. Yang |
| 2016 | CRYPTO | Bounded Indistinguishability and the Complexity of Recovering Secrets. | Andrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson |
| 2016 | FOCS | The Multiparty Communication Complexity of Interleaved Group Products. | W. T. Gowers, Emanuele Viola |
| 2015 | ICALP | Local Reductions. | Hamid Jahanjou, Eric Miles, Emanuele Viola |
| 2015 | STOC | The communication complexity of interleaved group products. | Timothy Gowers, Emanuele Viola |
| 2014 | ICALP | Short PCPs with Projection Queries. | Eli Ben-Sasson, Emanuele Viola |
| 2013 | SODA | On the Complexity of Information Spreading in Dynamic Networks. | Chinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola |
| 2013 | SODA | The communication complexity of addition. | Emanuele Viola |
| 2013 | STOC | Shielding circuits with groups. | Eric Miles, Emanuele Viola |
| 2012 | CRYPTO | Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. | Eric Miles, Emanuele Viola |
| 2012 | STOC | Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. | Anna Gl, Kristoffer Arnsfelt Hansen, Michal Kouck, Pavel Pudlk, Emanuele Viola |
| 2011 | FOCS | Extractors for Circuit Sources. | Emanuele Viola |
| 2011 | FOCS | Randomness Buys Depth for Approximate Counting. | Emanuele Viola |
| 2011 | TCC | On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators. | Eric Miles, Emanuele Viola |
| 2010 | FOCS | The Complexity of Distributions. | Emanuele Viola |
| 2010 | SODA | Cell-Probe Lower Bounds for Succinct Partial Sums. | Mihai Patrascu, Emanuele Viola |
| 2009 | FOCS | Bounded Independence Fools Halfspaces. | Ilias Diakonikolas, Parikshit Gopalan, Ragesh Jaiswal, Rocco A. Servedio, Emanuele Viola |
| 2009 | STOC | Bit-probe lower bounds for succinct data structures. | Emanuele Viola |
| 2008 | STOC | Hardness amplification proofs require majority. | Ronen Shaltiel, Emanuele Viola |
| 2007 | FOCS | Pseudorandom Bits for Polynomials. | Andrej Bogdanov, Emanuele Viola |
| 2007 | FOCS | One-Way Multi-Party Communication Lower Bound for Pointer Jumping with Applications. | Emanuele Viola, Avi Wigderson |
| 2006 | STACS | Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two. | Alexander Healy, Emanuele Viola |
| 2004 | STOC | Using nondeterminism to amplify hardness. | Alexander Healy, Salil P. Vadhan, Emanuele Viola |