Robert E. Wilber

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1989
Lower Bounds for Accessing Binary Search Trees with Rotations.
SIAM J. Comput., 1989

1988
The Concave Least-Weight Subsequence Problem Revisited.
J. Algorithms, 1988

1986
Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Geometric Applications of a Matrix Searching Algorithm.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

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

1983
Randomness and the Density of Hard Problems
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983


  Loading...