Search the dblp DataBase

Publications of Author

1. Gideon Yuval
   Finding Near Neighbors in K-Dimensional Space. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1975, v:3, n:4, pp:113-114 [Journal]
   
2. Gideon Yuval
   Finding Nearest Neighbors. [Citation Graph (1, 0)][DBLP]
   Inf. Process. Lett., 1976, v:5, n:3, pp:63-65 [Journal]
   
3. John R. Douceur, Atul Adya, Josh Benaloh, William J. Bolosky, Gideon Yuval
   A Secure Directory Service based on Exclusive Encryption. [Citation Graph (0, 0)][DBLP]
   ACSAC, 2002, pp:172-184 [Conf]
   
4. Michael Ian Shamos, Gideon Yuval
   Lower Bounds from Complex Function Theory [Citation Graph (0, 0)][DBLP]
   FOCS, 1976, pp:268-273 [Conf]
   
5. Gideon Yuval
   Reinventing the Travois: Encryption/MAC in 30 ROM Bytes. [Citation Graph (0, 0)][DBLP]
   Fast Software Encryption, 1997, pp:205-209 [Conf]
   
6. Bruce Knobe, Gideon Yuval
   Some Steps Towards a Better Pascal. [Citation Graph (0, 0)][DBLP]
   Comput. Lang., 1976, v:1, n:4, pp:277-286 [Journal]
   
7. Gideon Yuval
   On a Problem Connected with Topological Sorting. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1973, v:2, n:4, pp:103-104 [Journal]
   
8. Gideon Yuval
   An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1976, v:4, n:6, pp:155-156 [Journal]
   
9. Gideon Yuval
   Theil's Estimator. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 1977, v:6, n:1, pp:6-7 [Journal]
   
10. Gideon Yuval
    A Simple Proof of Strassen's Result. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:6, pp:285-286 [Journal]
    
11. Kamal Jain, Vijay V. Vazirani, Gideon Yuval
    On the capacity of multiple unicast sessions in undirected graphs. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2805-2809 [Journal]