Gideon Yuval

17 papers A* 2A 1B 2Journal 12
YearRankTypeTitle / Venue / Authors
2006 B conf
On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs.
ITW
Kamal Jain, Vijay V. Vazirani, Gideon Yuval
2006 J jnl
On the capacity of multiple unicast sessions in undirected graphs.
IEEE Trans. Inf. Theory
Kamal Jain, Vijay V. Vazirani, Gideon Yuval
2005 B conf
On the capacity of multiple unicast sessions in undirected graphs.
ISIT
Kamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval
2002 A conf
A Secure Directory Service based on Exclusive Encryption.
ACSAC
John R. Douceur, Atul Adya, Josh Benaloh, William J. Bolosky, Gideon Yuval
1997 A* conf
Reinventing the Travois: Encryption/MAC in 30 ROM Bytes.
FSE
Gideon Yuval
1979 J jnl
How to Swindle Rabin.
Cryptologia
Gideon Yuval
1978 J jnl
A Simple Proof of Strassen's Result.
Inf. Process. Lett.
Gideon Yuval
1977 J jnl
Theil's Estimator.
Inf. Process. Lett.
Gideon Yuval
1976 J jnl
An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications.
Inf. Process. Lett.
Gideon Yuval
1976 J jnl
An Operating Non-System.
ACM SIGOPS Oper. Syst. Rev.
Gideon Yuval
1976 J jnl
Finding Nearest Neighbors.
Inf. Process. Lett.
Gideon Yuval
1976 A* conf
Lower Bounds from Complex Function Theory
FOCS
Michael Ian Shamos, Gideon Yuval
1976 J jnl
Some Steps Towards a Better Pascal.
Comput. Lang.
Bruce Knobe, Gideon Yuval
1976 J jnl
The geometric mean distance.
SIGACT News
Gideon Yuval
1975 J jnl
Finding Near Neighbors in K-Dimensional Space.
Inf. Process. Lett.
Gideon Yuval
1975 J jnl
Gathering Run-Time Statistics Without Black Magic.
Softw. Pract. Exp.
Gideon Yuval
1973 J jnl
On a Problem Connected with Topological Sorting.
Inf. Process. Lett.
Gideon Yuval