Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Ben-David, Shalev
382  Ergebnisse:
Personensuche X
?
1

Quantum Tokens for Digital Signatures:

Ben-David, Shalev ; Sattath, Or
Quantum.  7 (2023)  - p. 901 , 2023
Link: https://doi.org/10.22331..
 
?
2

A New Minimax Theorem for Randomized Algorithms:

Ben-David, Shalev ; Blais, Eric
Journal of the ACM.  70 (2023)  6 - p. 1-58 , 2023
Link: https://doi.org/10.1145/..
 
?
3

Unambiguous DNFs and Alon–Saks–Seymour:

Balodis, Kaspars ; Ben-David, Shalev ; Göös, Mika..
SIAM Journal on Computing.  , 2023
Link: https://doi.org/10.1137/..
 
?
4

Unambiguous DNFs and Alon-Saks-Seymour:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Balodis, Kaspars ; Ben-David, Shalev ; Goos, Mika.. - p. 116-124 , 2022
Link: https://doi.org/10.1109/..
 
?
5

Randomised Composition and Small-Bias Minimax:

, In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS),
Ben-David, Shalev ; Blais, Eric ; Goos, Mika. - p. 624-635 , 2022
Link: https://doi.org/10.1109/..
 
?
6

On query-to-communication lifting for adversary bounds:

, In: Proceedings of the 36th Computational Complexity Conference,
Anshu, Anurag ; Ben-David, Shalev ; Kundu, Srijita - p. 1 ff. , 2021
Link: https://dl.acm.org/doi/1..
 
?
7

Degree vs. approximate degree and Quantum implications of H..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Aaronson, Scott ; Ben-David, Shalev ; Kothari, Robin.. - p. 1330-1342 , 2021
Link: https://dl.acm.org/doi/1..
 
?
8

A New Minimax Theorem for Randomized Algorithms (Extended A..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Ben-David, Shalev ; Blais, Eric - p. 403-411 , 2020
Link: https://doi.org/10.1109/..
 
?
9

A Tight Composition Theorem for the Randomized Query Comple..:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Ben-David, Shalev ; Blais, Eric - p. 240-246 , 2020
Link: https://doi.org/10.1109/..
 
?
10

Symmetries, Graph Properties, and Quantum Speedups:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),
Ben-David, Shalev ; Childs, Andrew M. ; Gilyen, Andras... - p. 649-660 , 2020
Link: https://doi.org/10.1109/..
 
?
11

Separating quantum communication and approximate rank:

, In: Proceedings of the 32nd Computational Complexity Conference,
Anshu, Anurag ; Ben-David, Shalev ; Garg, Ankit... - p. 1-33 , 2017
Link: https://dl.acm.org/doi/1..
 
?
12

Separations in query complexity using cheat sheets:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,
Aaronson, Scott ; Ben-David, Shalev ; Kothari, Robin - p. 863-876 , 2016
Link: https://dl.acm.org/doi/1..
 
?
13

On Rota's Conjecture and nested separations in matroids:

Ben-David, Shalev ; Geelen, Jim
Journal of Combinatorial Theory, Series B.  119 (2016)  - p. 1-11 , 2016
Link: https://doi.org/10.1016/..
 
?
14

Data stability in clustering: A closer look:

Ben-David, Shalev ; Reyzin, Lev
Theoretical Computer Science.  558 (2014)  - p. 51-61 , 2014
Link: https://doi.org/10.1016/..
 
?
15

Supporting ranking queries on uncertain and incomplete data:

Soliman, Mohamed A. ; Ilyas, Ihab F. ; Ben-David, Shalev
The VLDB Journal.  19 (2010)  4 - p. 477-501 , 2010
Link: https://doi.org/10.1007/..
 
1-15