157
click to vote
FODO
15 years 10 months ago
1989 Springer 
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
253
click to vote
OA
15 years 10 months ago
1989 
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
137
click to vote
FODO
15 years 10 months ago
1989 Springer 
d Abstract) Michael Rabin Aiken Computation Laboratory Harvard University Cambridge, MA 02138 J. D. Tygar School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213...
160
click to vote
STOC
15 years 10 months ago
1989 ACM 
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
|
Algorithms