On a Problem Connected with Topological Sorting. - Gideon Yuval (Inf. Process. Lett., 1973)

Finding Near Neighbors in K-Dimensional Space. - Gideon Yuval (Inf. Process. Lett., 1975)

Gathering Run-Time Statistics Without Black Magic. - Gideon Yuval (Softw. Pract. Exp., 1975)

Lower Bounds from Complex Function Theory - Michael Ian Shamos; Gideon Yuval (FOCS, 1976)

Some Steps Towards a Better Pascal. - Bruce Knobe; Gideon Yuval (Comput. Lang., 1976)

An Algorithm for Finding All Shortest Paths Using N^(2.81) Infinite-Precision Multiplications. - Gideon Yuval (Inf. Process. Lett., 1976)

Finding Nearest Neighbors. - Gideon Yuval (Inf. Process. Lett., 1976)

The geometric mean distance. - Gideon Yuval (SIGACT News, 1976)

An Operating Non-System. - Gideon Yuval (ACM SIGOPS Oper. Syst. Rev., 1976)

Theil's Estimator. - Gideon Yuval (Inf. Process. Lett., 1977)

A Simple Proof of Strassen's Result. - Gideon Yuval (Inf. Process. Lett., 1978)

How to Swindle Rabin. - Gideon Yuval (Cryptologia, 1979)

Reinventing the Travois: Encryption/MAC in 30 ROM Bytes. - Gideon Yuval (FSE, 1997)

A Secure Directory Service based on Exclusive Encryption. - John R. Douceur; Atul Adya; Josh Benaloh; William J. Bolosky; Gideon Yuval (ACSAC, 2002)

On the capacity of multiple unicast sessions in undirected graphs. - Kamal Jain; Vijay V. Vazirani; Raymond W. Yeung; Gideon Yuval (ISIT, 2005)

On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs. - Kamal Jain; Vijay V. Vazirani; Gideon Yuval (ITW, 2006)

On the capacity of multiple unicast sessions in undirected graphs. - Kamal Jain; Vijay V. Vazirani; Gideon Yuval (IEEE Trans. Inf. Theory, 2006)