Bibliography

Bro78

Mark R. Brown.
Implementation and analysis of binomial queue algorithms.
SIAM Journal of Computing, 7(3):312-319, August 1978.

CLR92

Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest.
Instroduction to Algorithms.
McGraw-Hill Book Company, 1992.

Cra72

Clark Allan Crane.
Linear Lists and Priority Queues as Balanced Binary Trees.
PhD thesis, Stanford University, 1972.

CT76

David Cheriton and Robert Endre Tarjan.
Finding minimum spanning trees.
Journal of Computing, 5(4):724-742, December 1976.

DGST88

James R. Driscoll, Harold N. Gabow, Ruth Shrairman, and Robert Endre Tarjan.
Relaxed heaps: An alternative to fibonacci heaps with applications to parallel computation.
Communications of the ACM, 31(11):1343-1354, November 1988.

Gon84

Gaston H. Gonnet.
Handbook of algorithms and data structures.
Addison-Wesley Publishing Co., 1984.

GW77

Adriano M. Garsia and Michelle L. Wachs.
A new algorithm for minimum cost binary trees.
SIAM Journal of Computing, 6(4):622-642, December 1977.

HKT79

T. C. Hu, D. J. Kleitman, and J. K. Tamaki.
Binary trees optimum under various criteria.
SIAM Journal of Applied Mathematics, 37(2):246-256, April 1979.

Hor84

Ellis Horowitz.
Fundamentals of Data Structures in Pascal.
Computer Science Press, Rockville, MD, 1984.

HT71

T. C. Hu and A. C. Tucker.
Optimal computer search trees and variable length alphabetic codes.
SIAM Journal of Applied Mathematics, 21(4):514-532, December 1971.

Hu71

T. C. Hu.
A new proof of the t-c algorithm.
SIAM Journal of Applied Mathematics, 25(1):83-94, December 1971.

Hu82

T. C. Hu.
Combinatorial Algorithms.
Addison-Wesley Publishing Co., 1982.

KLR

Marek Karpinski, Lawrence L. Larmore, and Wojciech Rytter.
Correctness of constructing optimal alphabetic trees revisited.
http://cs.uni-bonn.de/info5/publications/abstract/85134-cs.abstract-en.html.

Knu73a

Donald E. Knuth.
The Art of Computer Programming, volume 1.
Addison-Wesley Publishing Co., 1973.
Fundamental Algorithms.

Knu73b

Donald E. Knuth.
The Art of Computer Programming, volume 3.
Addison-Wesley Publishing Co., 1973.
Sorting and Searching.

Knu81

Donald E. Knuth.
The Art of Computer Programming, volume 2.
Addison-Wesley Publishing Co., 1981.
Seminumerical Algorithms.

Lar90

Lawrence L. Larmore.
A fast algorithm for optimal length-limited Huffman codes.
Journal of the Association for Computing Machinery, 37(3):463-473, July 1990.

LP98

Lawrence L. Larmore and Teresa Przytycka.
The optimal alphabetic tree problem revisited.
Journal of Algorithms, pages 1-20, 1998.

LPR93

Lawrence L. Larmore, Teresa Przytycka, and Wojciech Rytter.
Parallel construction of optimal alphabetic trees.
Journal of the Association for Computing Machinery, pages 214-223, 1993.

Mum92

Brendan M. Mumey.
Some new results on constructing optimal alphabetic binary trees.
Master's thesis, University of British Columbia, 1992.

Tar83

Robert Endre Tarjan.
Data Structures and Network Algorithms.
SIAM, Philadelphia, PA, 1983.

Vui78

Jean Vuillemin.
A data structure for manipulating priority queue.
Communications of the ACM, 21(4):309-315, April 1978.

Wei95

Mark Allen Weiss.
Data Structures and Algorithm Analysis.
Benjamin/Cummings Publishing Co., 1995.

Yoh72

J. Michael Yohe.
Hu-Tucker minimum redundancy alphabetic coding methods [Z].
Communications of the ACM, 15(5):360-362, 5 1972.
Algorithm 428.