default search action
Shalev Ben-David
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c20]Shalev Ben-David, Srijita Kundu:
Oracle Separation of QMA and QCMA with Bounded Adaptivity. ICALP 2024: 21:1-21:18 - [i32]Shalev Ben-David, Srijita Kundu:
Oracle separation of QMA and QCMA with bounded adaptivity. CoRR abs/2402.00298 (2024) - 2023
- [j6]Shalev Ben-David
, Eric Blais
A New Minimax Theorem for Randomized Algorithms. J. ACM 70(6): 38:1-38:58 (2023) - [j5]Shalev Ben-David, Or Sattath
Quantum Tokens for Digital Signatures. Quantum 7: 901 (2023) - 2022
- [c19]Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre:
Randomised Composition and Small-Bias Minimax. FOCS 2022: 624-635 - [i31]Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre:
Randomised Composition and Small-Bias Minimax. CoRR abs/2208.12896 (2022) - [i30]Shalev Ben-David, Eric Blais, Mika Göös, Gilbert Maystre:
Randomised Composition and Small-Bias Minimax. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c18]Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-To-Communication Lifting for Adversary Bounds. CCC 2021: 30:1-30:39 - [c17]Kaspars Balodis, Shalev Ben-David, Mika Göös, Siddhartha Jain
Unambiguous DNFs and Alon-Saks-Seymour. FOCS 2021: 116-124 - [c16]Scott Aaronson, Shalev Ben-David, Robin Kothari
Degree vs. approximate degree and Quantum implications of Huang's sensitivity theorem. STOC 2021: 1330-1342 - [i29]Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. CoRR abs/2102.08348 (2021) - [i28]Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c15]Shalev Ben-David, Mika Göös, Robin Kothari
When Is Amplification Necessary for Composition in Randomized Query Complexity? APPROX-RANDOM 2020: 28:1-28:16 - [c14]Shalev Ben-David, Eric Blais:
A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract. FOCS 2020: 240-246 - [c13]Shalev Ben-David, Eric Blais:
A New Minimax Theorem for Randomized Algorithms (Extended Abstract). FOCS 2020: 403-411 - [c12]Shalev Ben-David, Andrew M. Childs
Symmetries, Graph Properties, and Quantum Speedups. FOCS 2020: 649-660 - [i27]Shalev Ben-David, Supartha Podder:
How symmetric is too symmetric for large quantum speedups? CoRR abs/2001.09642 (2020) - [i26]Shalev Ben-David, Eric Blais:
A New Minimax Theorem for Randomized Algorithms. CoRR abs/2002.10802 (2020) - [i25]Shalev Ben-David, Eric Blais:
A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions. CoRR abs/2002.10809 (2020) - [i24]Scott Aaronson, Shalev Ben-David, Robin Kothari, Avishay Tal:
Quantum Implications of Huang's Sensitivity Theorem. CoRR abs/2004.13231 (2020) - [i23]Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson:
When Is Amplification Necessary for Composition in Randomized Query Complexity? CoRR abs/2006.10957 (2020) - [i22]Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang:
Symmetries, graph properties, and quantum speedups. CoRR abs/2006.12760 (2020) - [i21]Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, Avishay Tal:
Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem. CoRR abs/2010.12629 (2020) - [i20]Anurag Anshu, Shalev Ben-David, Srijita Kundu:
On Query-to-Communication Lifting for Adversary Bounds. CoRR abs/2012.03415 (2020) - [i19]Scott Aaronson, Shalev Ben-David, Robin Kothari, Avishay Tal:
Quantum Implications of Huang's Sensitivity Theorem. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c11]Shalev Ben-David, Robin Kothari
Quantum Distinguishing Complexity, Zero-Error Algorithms, and Statistical Zero Knowledge. TQC 2019: 2:1-2:23 - [i18]Shalev Ben-David, Robin Kothari:
Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge. CoRR abs/1902.03660 (2019) - 2018
- [j4]Shalev Ben-David, Robin Kothari
Randomized Query Complexity of Sabotaged and Composed Functions. Theory Comput. 14(1): 1-27 (2018) - [c10]Shalev Ben-David, Adam Bouland
Classical Lower Bounds from Quantum Upper Bounds. FOCS 2018: 339-349 - [i17]Shalev Ben-David, Adam Bouland, Ankit Garg, Robin Kothari:
Classical lower bounds from quantum upper bounds. CoRR abs/1807.06256 (2018) - 2017
- [b1]Shalev Ben-David:
Quantum speedups in query complexity. Massachusetts Institute of Technology, Cambridge, USA, 2017 - [c9]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain
Separating Quantum Communication and Approximate Rank. CCC 2017: 24:1-24:33 - [c8]Shalev Ben-David, Pooya Hatami, Avishay Tal:
Low-Sensitivity Functions from Unambiguous Certificates. ITCS 2017: 28:1-28:23 - [i16]Shalev Ben-David, Or Sattath:
Quantum Tokens for Digital Signatures. IACR Cryptol. ePrint Arch. 2017: 94 (2017) - 2016
- [j3]Shalev Ben-David, Jim Geelen:
On Rota's Conjecture and nested separations in matroids. J. Comb. Theory B 119: 1-11 (2016) - [c7]Scott Aaronson, Shalev Ben-David:
Sculpting Quantum Speedups. CCC 2016: 26:1-26:28 - [c6]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain
Separations in Communication Complexity Using Cheat Sheets and Information Complexity. FOCS 2016: 555-564 - [c5]Shalev Ben-David, Robin Kothari
Randomized Query Complexity of Sabotaged and Composed Functions. ICALP 2016: 60:1-60:14 - [c4]Scott Aaronson, Shalev Ben-David, Robin Kothari
Separations in query complexity using cheat sheets. STOC 2016: 863-876 - [c3]Shalev Ben-David:
The Structure of Promises in Quantum Speedups. TQC 2016: 7:1-7:14 - [i15]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. CoRR abs/1605.01142 (2016) - [i14]Shalev Ben-David:
Low-Sensitivity Functions from Unambiguous Certificates. CoRR abs/1605.07084 (2016) - [i13]Shalev Ben-David, Robin Kothari:
Randomized query complexity of sabotaged and composed functions. CoRR abs/1605.09071 (2016) - [i12]Shalev Ben-David, Or Sattath
Quantum Tokens for Digital Signatures. CoRR abs/1609.09047 (2016) - [i11]Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee:
Separating quantum communication and approximate rank. CoRR abs/1611.05754 (2016) - [i10]Anurag Anshu, Aleksandrs Belovs, Shalev Ben-David, Mika Göös, Rahul Jain, Robin Kothari, Troy Lee, Miklos Santha:
Separations in communication complexity using cheat sheets and information complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - [i9]Shalev Ben-David:
Low-Sensitivity Functions from Unambiguous Certificates. Electron. Colloquium Comput. Complex. TR16 (2016) - [i8]Shalev Ben-David, Robin Kothari:
Randomized query complexity of sabotaged and composed functions. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i7]Shalev Ben-David:
A Super-Grover Separation Between Randomized and Quantum Query Complexities. CoRR abs/1506.08106 (2015) - [i6]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. CoRR abs/1511.01937 (2015) - [i5]Scott Aaronson, Shalev Ben-David:
Sculpting Quantum Speedups. CoRR abs/1512.04016 (2015) - [i4]Scott Aaronson, Shalev Ben-David:
Sculpting Quantum Speedups. Electron. Colloquium Comput. Complex. TR15 (2015) - [i3]Scott Aaronson, Shalev Ben-David, Robin Kothari:
Separations in query complexity using cheat sheets. Electron. Colloquium Comput. Complex. TR15 (2015) - [i2]Shalev Ben-David:
A Super-Grover Separation Between Randomized and Quantum Query Complexities. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j2]Shalev Ben-David, Lev Reyzin:
Data stability in clustering: A closer look. Theor. Comput. Sci. 558: 51-61 (2014) - [i1]Shalev Ben-David:
The Structure of Promises in Quantum Speedups. CoRR abs/1409.3323 (2014) - 2012
- [c2]Shalev Ben-David, Elyot Grant, Will Ma, Malcolm Sharpe:
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems. CCCG 2012: 47-52 - 2011
- [c1]Shalev Ben-David, Shai Ben-David:
Learning a Classifier when the Labeling Is Known. ALT 2011: 440-451 - 2010
- [j1]Mohamed A. Soliman, Ihab F. Ilyas
Supporting ranking queries on uncertain and incomplete data. VLDB J. 19(4): 477-501 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: