| |
| 1989 | ||
|---|---|---|
| 8 | Robert E. Wilber: Lower Bounds for Accessing Binary Search Trees with Rotations. SIAM J. Comput. 18(1): 56-67 (1989) | |
| 1988 | ||
| 7 | Robert E. Wilber: The Concave Least-Weight Subsequence Problem Revisited. J. Algorithms 9(3): 418-425 (1988) | |
| 6 | Robert E. Wilber: White Pebbles Help. J. Comput. Syst. Sci. 36(2): 108-124 (1988) | |
| 1987 | ||
| 5 | Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber: Geometric Applications of a Matrix-Searching Algorithm. Algorithmica 2: 195-208 (1987) | |
| 1986 | ||
| 4 | Robert E. Wilber: Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version) FOCS 1986: 61-70 | |
| 3 | EE | Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber: Geometric Applications of a Matrix Searching Algorithm. Symposium on Computational Geometry 1986: 285-292 |
| 1985 | ||
| 2 | Robert E. Wilber: White Pebbles Help STOC 1985: 103-112 | |
| 1983 | ||
| 1 | Robert E. Wilber: Randomness and the Density of Hard Problems FOCS 1983: 335-342 | |
| 1 | Alok Aggarwal | [3] [5] |
| 2 | Maria M. Klawe | [3] [5] |
| 3 | Shlomo Moran | [3] [5] |
| 4 | Peter W. Shor | [3] [5] |