Randomness and the Density of Hard Problems - Robert E. Wilber (FOCS, 1983)

Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version) - Robert E. Wilber (FOCS, 1986)

Geometric Applications of a Matrix-Searching Algorithm. - Alok Aggarwal; Maria M. Klawe; Shlomo Moran; Peter W. Shor; Robert E. Wilber (Algorithmica, 1987)

The Concave Least-Weight Subsequence Problem Revisited. - Robert E. Wilber (J. Algorithms, 1988)

White Pebbles Help. - Robert E. Wilber (J. Comput. Syst. Sci., 1988)

Lower Bounds for Accessing Binary Search Trees with Rotations. - Robert E. Wilber (SIAM J. Comput., 1989)