
Search the dblp DataBase
Gideon Yuval:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Gideon Yuval
Finding Near Neighbors in KDimensional Space. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1975, v:3, n:4, pp:113114 [Journal]
 Gideon Yuval
Finding Nearest Neighbors. [Citation Graph (1, 0)][DBLP] Inf. Process. Lett., 1976, v:5, n:3, pp:6365 [Journal]
 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:172184 [Conf]
 Michael Ian Shamos, Gideon Yuval
Lower Bounds from Complex Function Theory [Citation Graph (0, 0)][DBLP] FOCS, 1976, pp:268273 [Conf]
 Gideon Yuval
Reinventing the Travois: Encryption/MAC in 30 ROM Bytes. [Citation Graph (0, 0)][DBLP] Fast Software Encryption, 1997, pp:205209 [Conf]
 Bruce Knobe, Gideon Yuval
Some Steps Towards a Better Pascal. [Citation Graph (0, 0)][DBLP] Comput. Lang., 1976, v:1, n:4, pp:277286 [Journal]
 Gideon Yuval
On a Problem Connected with Topological Sorting. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1973, v:2, n:4, pp:103104 [Journal]
 Gideon Yuval
An Algorithm for Finding All Shortest Paths Using N^(2.81) InfinitePrecision Multiplications. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1976, v:4, n:6, pp:155156 [Journal]
 Gideon Yuval
Theil's Estimator. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1977, v:6, n:1, pp:67 [Journal]
 Gideon Yuval
A Simple Proof of Strassen's Result. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1978, v:7, n:6, pp:285286 [Journal]
 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:28052809 [Journal]
Search in 0.002secs, Finished in 0.003secs
