Parallel construction of optimal alphabetic trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Parallel construction of optimal alphabetic trees

Full text

Pdf (748 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures table of contents

Velen, Germany

Pages: 214 - 223

Year of Publication: 1993

ISBN:0-89791-599-2

Authors

Lawrence L. Larmore
Teresa M. Przytycka
Wojciech Rytter

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
European Comp Soc : European Computer Society

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/165231.165259 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Alberto Apostolico , Mikhail J. Atallah , Lawrence L. Larmore , Scott McFaddin, Efficient parallel algorithms for string editing and related problems, SIAM Journal on Computing, v.19 n.5, p.968-988, Oct. 1990 [doi>10.1137/0219066]
	2	A. Aggarwal, J. Park. Notes on searching in multidimensional monotone arrays. Proc. 29th IEEE Symposzum on Foundation o:f Computer Science (1988), pp. 497-513.
	3	M. J. Atallah , S. R. Kosaraju , L. L. Larmore , G. L. Miller , S.-H. Teng, Constructing trees in parallel, Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, p.421-431, June 18-21, 1989, Santa Fe, New Mexico, United States [doi>10.1145/72935.72980]
	4	Harold N. Gabow , Jon Louis Bentley , Robert E. Tarjan, Scaling and related techniques for geometry problems, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.135-143, December 1984 [doi>10.1145/800057.808675]
	5	A.M. Garsia and M. L. Wachs, A New algorithm for minimal binary search trees, SIAM Journal of Con#'p#,tzng 6 (1977), pp. 622-642.
	6	D. S. Hirschberg , L. L. Larmore, The least weight subsequence problem, SIAM Journal on Computing, v.16 n.4, p.628-638, Aug. 1987 [doi>10.1137/0216043]
	7	T. C. Hu.A new proof of the T-C algorithm, SIAM .}ouJ'-
	8	T. C. Hu and A. C. Tucker, Optimal computer search trees and variable length alphabetic codes, SIAM JoT#,'- r#al o.f Applied Mathematics 21 (1971), pp. 514-532.
	9	D. A. Huffman. A Method for the constructing of minimum redundancy codes, Proc. It#E 40 (1952), pp. I09S- 1101.
	10	D. (3. Kirkpatrick and T. M. Przytycka, An optimal parallel minimax tree algorithm, Proc. 2nd IEEE 5ynz#,..,f Parallel and Distributed Processing (1990): pp. 293-300
	11	D. E. Knuth. The Art of computer programm#rtq. Addison-Wesley (1973).
	12	D. E. Knuth. Optimum binary search trees, A cta lnformatica 5 (1971), pp. 14-25.
	13	Lawrence L. Larmore , Teresa M. Przytycka, Parallel construction of trees with optimal weighted path length, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.71-80, July 21-24, 1991, Hilton Head, South Carolina, United States [doi>10.1145/113379.113386]
	14	L. L. Larmore, and T M. Przytycka. A Fast algorithm for optimum height limited alphabetic binary tree.... 3ubmitred for publication
	15	Wojciech Rytter, On efficient parallel computations for some dynamic programming problems, Theoretical Computer Science, v.59 n.3, p.297-307, Aug. 1988 [doi>10.1016/0304-3975(88)90147-8]
	16	Robert Wilber, The concave least-weight subsequence problem revisited, Journal of Algorithms, v.9 n.3, p.418-425, September 1988 [doi>10.1016/0196-6774(88)90032-6]
	17	F. Frances Yao, Efficient dynamic programming using quadrangle inequalities, Proceedings of the twelfth annual ACM symposium on Theory of computing, p.429-435, April 28-30, 1980, Los Angeles, California, United States [doi>10.1145/800141.804691]