Login
|
New Account
AAAAAA
ITA
ENG
Results:
1-12
|
Results: 12
The query complexity of finding local minima in the lattice
Authors:
Beimel, A Geller, F Kushilevitz, E
Citation:
A. Beimel et al., The query complexity of finding local minima in the lattice, INF COMPUT, 171(1), 2001, pp. 69-83
Learning functions represented as multiplicity automata
Authors:
Beimel, A Bergadano, F Bshouty, NH Kushilevitz, E Varricchio, S
Citation:
A. Beimel et al., Learning functions represented as multiplicity automata, J ACM, 47(3), 2000, pp. 506-530
Randomness versus fault-tolerance
Authors:
Canetti, R Kushilevitz, E Ostrovsky, R Rosen, A
Citation:
R. Canetti et al., Randomness versus fault-tolerance, J CRYPTOL, 13(1), 2000, pp. 107-142
Computing functions of a shared secret
Authors:
Beimel, A Burmester, M Desmedt, Y Kushilevitz, E
Citation:
A. Beimel et al., Computing functions of a shared secret, SIAM J DISC, 13(3), 2000, pp. 324-345
Efficient search for approximate nearest neighbor in high dimensional spaces
Authors:
Kushilevitz, E Ostrovsky, R Rabani, Y
Citation:
E. Kushilevitz et al., Efficient search for approximate nearest neighbor in high dimensional spaces, SIAM J COMP, 30(2), 2000, pp. 457-474
Reducibility and completeness in private computations
Authors:
Kilian, J Kushilevitz, E Micali, S Ostrovsky, R
Citation:
J. Kilian et al., Reducibility and completeness in private computations, SIAM J COMP, 29(4), 2000, pp. 1189-1208
Adaptive packet routing for bursty adversarial traffic
Authors:
Aiello, W Kushilevitz, E Ostrovsky, R Rosen, A
Citation:
W. Aiello et al., Adaptive packet routing for bursty adversarial traffic, J COMPUT SY, 60(3), 2000, pp. 482-509
Protecting data privacy in private information retrieval schemes
Authors:
Gertner, Y Ishai, Y Kushilevitz, E Malkin, T
Citation:
Y. Gertner et al., Protecting data privacy in private information retrieval schemes, J COMPUT SY, 60(3), 2000, pp. 592-629
Learning unions of high-dimensional boxes over the reals
Authors:
Beimel, A Kushilevitz, E
Citation:
A. Beimel et E. Kushilevitz, Learning unions of high-dimensional boxes over the reals, INF PROCESS, 73(5-6), 2000, pp. 213-220
The linear-array conjecture in communication complexity is false
Authors:
Kushilevitz, E Linial, N Ostrovsky, R
Citation:
E. Kushilevitz et al., The linear-array conjecture in communication complexity is false, COMBINATORI, 19(2), 1999, pp. 241-254
Characterizing linear size circuits in terms of privacy
Authors:
Kushilevitz, E Ostrovsky, R Rosen, A
Citation:
E. Kushilevitz et al., Characterizing linear size circuits in terms of privacy, J COMPUT SY, 58(1), 1999, pp. 129-136
Private information retrieval
Authors:
Chor, B Goldreich, O Kushilevitz, E Sudan, M
Citation:
B. Chor et al., Private information retrieval, J ACM, 45(6), 1998, pp. 965-982
Risultati:
1-12
|