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