| 2026 | STOC | Monte Carlo to Las Vegas for Recursively Composed Functions. | Bandar Al-Dhalaan, Shalev Ben-David |
| 2025 | FOCS | Direct Product Theorems for Randomized Query Complexity. | Shalev Ben-David, Eric Blais |
| 2024 | ICALP | Oracle Separation of QMA and QCMA with Bounded Adaptivity. | Shalev Ben-David, Srijita Kundu |
| 2022 | FOCS | Randomised Composition and Small-Bias Minimax. | Shalev Ben-David, Eric Blais, Mika Gs, Gilbert Maystre |
| 2021 | FOCS | Unambiguous DNFs and Alon-Saks-Seymour. | Kaspars Balodis, Shalev Ben-David, Mika Gs, Siddhartha Jain, Robin Kothari |
| 2021 | STOC | Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. | Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal |
| 2020 | FOCS | A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract. | Shalev Ben-David, Eric Blais |
| 2020 | FOCS | A New Minimax Theorem for Randomized Algorithms (Extended Abstract). | Shalev Ben-David, Eric Blais |
| 2020 | FOCS | Symmetries, Graph Properties, and Quantum Speedups. | Shalev Ben-David, Andrew M. Childs, Andrs Gilyn, William Kretschmer, Supartha Podder, Daochen Wang |
| 2018 | FOCS | Classical Lower Bounds from Quantum Upper Bounds. | Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari |
| 2016 | FOCS | Separations in Communication Complexity Using Cheat Sheets and Information Complexity. | Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Gs, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha |
| 2016 | ICALP | Randomized Query Complexity of Sabotaged and Composed Functions. | Shalev Ben-David, Robin Kothari |
| 2016 | STOC | Separations in query complexity using cheat sheets. | Scott Aaronson, Shalev Ben-David, Robin Kothari |
| 2011 | ALT | Learning a Classifier when the Labeling Is Known. | Shalev Ben-David, Shai Ben-David |