186
Voted
FODO
15 years 11 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...
180
click to vote
FODO
15 years 11 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...
137
Voted
FODO
15 years 11 months ago
1989 Springer 134
Voted
FODO
15 years 11 months ago
1989 Springer |