Supporting ranking queries on uncertain and incomplete data. - Mohamed A. Soliman; Ihab F. Ilyas; Shalev Ben-David (VLDB J., 2010)

Learning a Classifier when the Labeling Is Known. - Shalev Ben-David; Shai Ben-David (ALT, 2011)

The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. - Shalev Ben-David; Elyot Grant; Will Ma; Malcolm Sharpe (CCCG, 2012)

Data stability in clustering: A closer look. - Shalev Ben-David; Lev Reyzin (Theor. Comput. Sci., 2014)

Sculpting Quantum Speedups. - Scott Aaronson; Shalev Ben-David (Electron. Colloquium Comput. Complex., 2015)

Separations in query complexity using cheat sheets. - Scott Aaronson; Shalev Ben-David; Robin Kothari (Electron. Colloquium Comput. Complex., 2015)

A Super-Grover Separation Between Randomized and Quantum Query Complexities. - Shalev Ben-David (Electron. Colloquium Comput. Complex., 2015)

The Structure of Promises in Quantum Speedups. - Shalev Ben-David (TQC, 2016)

Separations in communication complexity using cheat sheets and information complexity. - Anurag Anshu; Aleksandrs Belovs; Shalev Ben-David; Mika Göös; Rahul Jain 001; Robin Kothari; Troy Lee; Miklos Santha (Electron. Colloquium Comput. Complex., 2016)

Low-Sensitivity Functions from Unambiguous Certificates. - Shalev Ben-David (Electron. Colloquium Comput. Complex., 2016)

Randomized query complexity of sabotaged and composed functions. - Shalev Ben-David; Robin Kothari (Electron. Colloquium Comput. Complex., 2016)

On Rota's Conjecture and nested separations in matroids. - Shalev Ben-David; Jim Geelen (J. Comb. Theory B, 2016)

Separating Quantum Communication and Approximate Rank. - Anurag Anshu; Shalev Ben-David; Ankit Garg; Rahul Jain 001; Robin Kothari; Troy Lee (CCC, 2017)

Low-Sensitivity Functions from Unambiguous Certificates. - Shalev Ben-David; Pooya Hatami; Avishay Tal (ITCS, 2017)

Quantum speedups in query complexity. - Shalev Ben-David (2017)

Classical Lower Bounds from Quantum Upper Bounds. - Shalev Ben-David; Adam Bouland; Ankit Garg; Robin Kothari (FOCS, 2018)

Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge. - Shalev Ben-David; Robin Kothari (TQC, 2019)

When Is Amplification Necessary for Composition in Randomized Query Complexity? - Shalev Ben-David; Mika Göös; Robin Kothari; Thomas Watson 001 (APPROX-RANDOM, 2020)

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract. - Shalev Ben-David; Eric Blais (FOCS, 2020)

A New Minimax Theorem for Randomized Algorithms (Extended Abstract). - Shalev Ben-David; Eric Blais (FOCS, 2020)

How symmetric is too symmetric for large quantum speedups? - Shalev Ben-David; Supartha Podder (CoRR, 2020)

A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions. - Shalev Ben-David; Eric Blais (CoRR, 2020)

Quantum Implications of Huang's Sensitivity Theorem. - Scott Aaronson; Shalev Ben-David; Robin Kothari; Avishay Tal (Electron. Colloquium Comput. Complex., 2020)

On Query-To-Communication Lifting for Adversary Bounds. - Anurag Anshu; Shalev Ben-David; Srijita Kundu (CCC, 2021)

Unambiguous DNFs and Alon-Saks-Seymour. - Kaspars Balodis; Shalev Ben-David; Mika Göös; Siddhartha Jain 002; Robin Kothari (FOCS, 2021)

Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. - Scott Aaronson; Shalev Ben-David; Robin Kothari; Shravas Rao; Avishay Tal (STOC, 2021)

Unambiguous DNFs from Hex. - Shalev Ben-David; Mika Göös; Siddhartha Jain 002; Robin Kothari (Electron. Colloquium Comput. Complex., 2021)

Randomised Composition and Small-Bias Minimax. - Shalev Ben-David; Eric Blais; Mika Göös; Gilbert Maystre (Electron. Colloquium Comput. Complex., 2022)

Quantum Tokens for Digital Signatures. - Shalev Ben-David; Or Sattath (Quantum, 2023)

A New Minimax Theorem for Randomized Algorithms. - Shalev Ben-David; Eric Blais (J. ACM, 2023)

Oracle Separation of QMA and QCMA with Bounded Adaptivity. - Shalev Ben-David; Srijita Kundu (ICALP, 2024)

Separations in query complexity for total search problems. - Shalev Ben-David; Srijita Kundu (CoRR, 2024)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy. - Avantika Agarwal; Shalev Ben-David (CoRR, 2024)

Symmetries, Graph Properties, and Quantum Speedups. - Shalev Ben-David; Andrew M. Childs; András Gilyén; William Kretschmer; Supartha Podder; Daochen Wang (SIAM J. Comput., 2024)