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.

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.

[BibT_eX]

[DOI]

Robert E. Wilber

SIAM J. Comput., 1989

1988

White Pebbles Help.

[BibT_eX]

[DOI]

Robert E. Wilber

J. Comput. Syst. Sci., 1988

The Concave Least-Weight Subsequence Problem Revisited.

[BibT_eX]

[DOI]

Robert E. Wilber

J. Algorithms, 1988

1987

Geometric Applications of a Matrix-Searching Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 1987

1986

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

[BibT_eX]

[DOI]

Robert E. Wilber

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

1983

Randomness and the Density of Hard Problems

[BibT_eX]

[DOI]

Robert E. Wilber

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

Robert E. Wilber

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...