AAAAAA

   
Results: 1-8 |
Results: 8
Universal service-providers for private information retrieval
Authors: Di Crescenzo, G Ishai, Y Ostrovsky, R
Citation: G. Di Crescenzo et al., Universal service-providers for private information retrieval, J CRYPTOL, 14(1), 2001, pp. 37-74
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
The Las-Vegas processor identity problem (How and when to be unique)
Authors: Kutten, S Ostrovsky, R Patt-Shamir, B
Citation: S. Kutten et al., The Las-Vegas processor identity problem (How and when to be unique), J ALGORITHM, 37(2), 2000, pp. 468-494
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
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
Risultati: 1-8 |