Sciweavers

FODO
1989
Springer
268views Algorithms» more  FODO 1989»
13 years 10 months ago
The Path Length of Binary Trees
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...
Rolf Klein, Derick Wood
FODO
1989
Springer
164views Algorithms» more  FODO 1989»
13 years 10 months ago
ITOSS: An Integrated Toolkit For Operating System Security
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...
Michael O. Rabin, J. D. Tygar
FODO
1989
Springer
67views Algorithms» more  FODO 1989»
13 years 10 months ago
A Heuristic for Channel Routing
Elena Lodi, Franco P. Preparata