×

zbMATH — the first resource for mathematics

Ben-David, Shalev

Compute Distance To:
Author ID: ben-david.shalev Recent zbMATH articles by "Ben-David, Shalev"
Published as: Ben-David, Shalev; Ben-David, S.
Documents Indexed: 17 Publications since 1994

Publications by Year

Citations contained in zbMATH Open

12 Publications have been cited 116 times in 19 Documents Cited by Year
On the power of randomization in on-line algorithms. Zbl 0784.68038
Ben-David, S.; Borodin, A.; Karp, R.; Tardos, G.; Wigderson, A.
50
1994
A new measure for the study of on-line algorithms. Zbl 0782.68052
Ben-David, S.; Borodin, A.
32
1994
Separations in query complexity using cheat sheets. Zbl 1373.68216
Aaronson, Scott; Ben-David, Shalev; Kothari, Robin
12
2016
A note on non-complete problems in \(NP_\mathbb{R}\). Zbl 0953.68058
Ben-David, S.; Meer, K.; Michaux, C.
5
2000
A modal logic for subjective default reasoning. Zbl 0940.03032
Ben-David, S.; Ben-Eliyahu-Zohary, R.
5
2000
Data stability in clustering: a closer look. Zbl 1360.62314
Ben-David, Shalev; Reyzin, Lev
2
2014
Randomized query complexity of sabotaged and composed functions. Zbl 1388.68094
Ben-David, Shalev; Kothari, Robin
2
2016
Can finite samples detect singularities of real-valued functions? Zbl 0910.68168
Ben-David, S.
2
1998
Randomized query complexity of sabotaged and composed functions. Zbl 1398.68186
Ben-David, Shalev; Kothari, Robin
2
2018
Low-sensitivity functions from unambiguous certificates. Zbl 1402.68082
Ben-David, Shalev; Hatami, Pooya; Tal, Avishay
2
2017
On Rota’s conjecture and nested separations in matroids. Zbl 1334.05021
Ben-David, Shalev; Geelen, Jim
1
2016
Separating quantum communication and approximate rank. Zbl 1440.68095
Anshu, Anurag; Ben-David, Shalev; Garg, Ankit; Jain, Rahul; Kothari, Robin; Lee, Troy
1
2017
Randomized query complexity of sabotaged and composed functions. Zbl 1398.68186
Ben-David, Shalev; Kothari, Robin
2
2018
Low-sensitivity functions from unambiguous certificates. Zbl 1402.68082
Ben-David, Shalev; Hatami, Pooya; Tal, Avishay
2
2017
Separating quantum communication and approximate rank. Zbl 1440.68095
Anshu, Anurag; Ben-David, Shalev; Garg, Ankit; Jain, Rahul; Kothari, Robin; Lee, Troy
1
2017
Separations in query complexity using cheat sheets. Zbl 1373.68216
Aaronson, Scott; Ben-David, Shalev; Kothari, Robin
12
2016
Randomized query complexity of sabotaged and composed functions. Zbl 1388.68094
Ben-David, Shalev; Kothari, Robin
2
2016
On Rota’s conjecture and nested separations in matroids. Zbl 1334.05021
Ben-David, Shalev; Geelen, Jim
1
2016
Data stability in clustering: a closer look. Zbl 1360.62314
Ben-David, Shalev; Reyzin, Lev
2
2014
A note on non-complete problems in \(NP_\mathbb{R}\). Zbl 0953.68058
Ben-David, S.; Meer, K.; Michaux, C.
5
2000
A modal logic for subjective default reasoning. Zbl 0940.03032
Ben-David, S.; Ben-Eliyahu-Zohary, R.
5
2000
Can finite samples detect singularities of real-valued functions? Zbl 0910.68168
Ben-David, S.
2
1998
On the power of randomization in on-line algorithms. Zbl 0784.68038
Ben-David, S.; Borodin, A.; Karp, R.; Tardos, G.; Wigderson, A.
50
1994
A new measure for the study of on-line algorithms. Zbl 0782.68052
Ben-David, S.; Borodin, A.
32
1994

Citations by Year