Robert E. Wilber

According to our database, Robert E. Wilber authored at least 6 papers between 1983 and 1989.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1989

Lower Bounds for Accessing Binary Search Trees with Rotations.

Robert E. Wilber

SIAM J. Comput., 1989

1988

The Concave Least-Weight Subsequence Problem Revisited.

Robert E. Wilber

J. Algorithms, 1988

1986

Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version)

Robert E. Wilber

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Geometric Applications of a Matrix Searching Algorithm.

Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

White Pebbles Help

Robert E. Wilber

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

1983

Randomness and the Density of Hard Problems

Robert E. Wilber

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983