Shalev Ben-David

Computer Science · Physical Sciences

14h-index1.2kcitations72works0.32yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(43), Machine Learning and Algorithms(27), Quantum Computing Algorithms and Architecture(23), Cryptography and Data Security(15), Advanced Graph Theory Research(8)

Publications71 total

High Rate Efficient Local List Decoding from HDX
arXiv (Cornell University)·2026Open Access
High Rate Efficient Local List Decoding from HDX
ArXiv.org·2026Open Access
Symmetries, Graph Properties, and Quantum Speedups
SIAM Journal on Computing·2024Open Access
Oracle Separations for the Quantum-Classical Polynomial Hierarchy
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)·2024Open Access
Separations in query complexity for total search problems
arXiv (Cornell University)·2024· 1 citedOpen Access
Quantum algorithms for hypergraph simplex finding
arXiv (Cornell University)·2024Open Access
Oracle Separation of QMA and QCMA with Bounded Adaptivity
arXiv (Cornell University)·2024· 1 citedOpen Access
Unambiguous DNFs and Alon–Saks–Seymour
SIAM Journal on Computing·2023· 2 cited
A New Minimax Theorem for Randomized Algorithms
Journal of the ACM·2023· 3 cited
Quantum Tokens for Digital Signatures
Quantum·2023· 28 citedOpen Access
Randomised Composition and Small-Bias Minimax
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)·2022· 1 citedOpen Access
Randomised Composition and Small-Bias Minimax
arXiv (Cornell University)·2022Open Access
Unambiguous DNFs and Alon-Saks-Seymour
2022· 1 citedOpen Access
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
2021· 6 citedOpen Access
Lower Bounds for Unambiguous Automata via Communication Complexity
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
On Query-To-Communication Lifting for Adversary Bounds
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 1 citedOpen Access
Unambiguous DNFs from Hex
arXiv (Cornell University)·2021· 2 citedOpen Access
Fractional Certificates for Bounded Functions
arXiv (Cornell University)·2020Open Access
A New Minimax Theorem for Randomized Algorithms (Extended Abstract)
2020· 4 cited
A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract
2020· 9 cited
page 1 of 4Next →

Frequent Co-authors

Robin Kothari(15), Eric Blais(6), Mika Göös(5), Ankit Garg(4), Avishay Tal(4), Allan Borodin(3), Scott Aaronson(3), Siddhartha Jain(3), Anurag Anshu(3), Richard M. Karp(2), Gábor Tardos(2), Avi Wigderson(2), Nicolò Cesa‐Bianchi(2), David Haussler(2), Lang Tong(2), Benny Chor(2), Oded Goldreich(2), Or Sattath(2), Eyal Kushilevitz(2), Lev Reyzin(2)