Search the dblp DataBase
Robert E. Wilber: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber
Geometric Applications of a Matrix-Searching Algorithm. [Citation Graph (1, 0)][DBLP]
Algorithmica, 1987, v:2, n:, pp:195-208 [Journal] - Alok Aggarwal, Maria M. Klawe, Shlomo Moran, Peter W. Shor, Robert E. Wilber
Geometric Applications of a Matrix Searching Algorithm. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1986, pp:285-292 [Conf] - Robert E. Wilber
Randomness and the Density of Hard Problems [Citation Graph (0, 0)][DBLP]
FOCS, 1983, pp:335-342 [Conf] - Robert E. Wilber
Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version) [Citation Graph (0, 0)][DBLP]
FOCS, 1986, pp:61-70 [Conf] - Robert E. Wilber
White Pebbles Help [Citation Graph (0, 0)][DBLP]
STOC, 1985, pp:103-112 [Conf] - Robert E. Wilber
The Concave Least-Weight Subsequence Problem Revisited. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 1988, v:9, n:3, pp:418-425 [Journal] - Robert E. Wilber
White Pebbles Help. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1988, v:36, n:2, pp:108-124 [Journal] - Robert E. Wilber
Lower Bounds for Accessing Binary Search Trees with Rotations. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1989, v:18, n:1, pp:56-67 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002