A lower bound on the path length of binary trees

Authors:
V. Kantabutra
Affiliations:
Drexel Univ., Philadelphia, PA
Venue:
ACM SIGACT News
Year:
1988

Citing 4
Cited 0

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Mathematical Theory of Communication

A Mathematical Theory of Communication
Coding and Information Theory

Coding and Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract