Gideon Yuval - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2006

On the Coding Advantage of Multiple Unicast Sessions in Undirected GraphsKamal Jain, Vijay V. Vazirani, Gideon Yuval. itw 2006: 211 [doi]

On the capacity of multiple unicast sessions in undirected graphsKamal Jain, Vijay V. Vazirani, Gideon Yuval. TIT, 52(6):2805-2809, 2006. [doi]

2005

On the capacity of multiple unicast sessions in undirected graphsKamal Jain, Vijay V. Vazirani, Raymond W. Yeung, Gideon Yuval. isit 2005: 563-567 [doi]

2002

A Secure Directory Service based on Exclusive EncryptionJohn R. Douceur, Atul Adya, Josh Benaloh, William J. Bolosky, Gideon Yuval. acsac 2002: 172-184 [doi]

1997

Reinventing the Travois: Encryption/MAC in 30 ROM BytesGideon Yuval. fse 1997: 205-209 [doi]

1979

How to Swindle RabinGideon Yuval. cryptologia, 3(3):187-191, 1979. [doi]

1978

A Simple Proof of Strassen s ResultGideon Yuval. ipl, 7(6):285-286, 1978.

1977

Theil s EstimatorGideon Yuval. ipl, 6(1):6-7, 1977.

1976

Some Steps Towards a Better PascalBruce Knobe, Gideon Yuval. Comp. Lang., Syst. \& Struct., 1(4):277-286, 1976.

Lower Bounds from Complex Function TheoryMichael Ian Shamos, Gideon Yuval. focs 1976: 268-273

An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision MultiplicationsGideon Yuval. ipl, 4(6):155-156, 1976.

Finding Nearest NeighborsGideon Yuval. ipl, 5(3):63-65, 1976.

The geometric mean distanceGideon Yuval. sigact, 8(3):24-25, 1976. [doi]

1975

Finding Near Neighbors in K-Dimensional SpaceGideon Yuval. ipl, 3(4):113-114, 1975.

1973

On a Problem Connected with Topological SortingGideon Yuval. ipl, 2(4):103-104, 1973.

Sign in or sign up to see more results.

runs on WebDSL