Article

Free access

Parallel construction of optimal alphabetic trees

Authors:

Lawrence L. Larmore,

Teresa M. Przytycka,

Wojciech RytterAuthors Info & Claims

SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures

Pages 214 - 223

https://doi.org/10.1145/165231.165259

Published: 01 August 1993 Publication History

PDF eReader

References

[1]

A. Apostolico, M. J. Atallah, L. L. Larmore, H. S. Mc- Faddln. Efficient parallel algorithms for string editing and related problems, SIAM Journal o/ Computing 19 (1990), pp. 968-988.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[3]

M. J. A tallah, S. R. Kosaraju, L. L. Larmore, G. L. Miller, and S-H. Teng. Constructing trees in paxallel, Proc. 1st ACM Symposium on Parallel Algomth,ns and Architectures (1989), pp. 499-533.

Digital Library

Google Scholar

[4]

H.N. Gabow, J. L. Bentley, R. E. Tarjan, Scaling and ret#ted techniques for geometry problems, Proc. 16#h A CM Symposium on Theory o.f Computing (1984). pp. 135- 143.

Digital Library

Google Scholar

[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.

Google Scholar

[6]

D. S. Hirschberg and L. L. Larmore, The Least weight subsequence problem, Proc. :36TM IEEE Syrup o, }:',.),t'#- dations of Computer Sc#ce Portland Oregol# (Oct 1985), pp. 137-143. Reprinted m SIAM JouJ'#,l,#, (,- puting 16 (1987), pp 628-638.

Digital Library

Google Scholar

[7]

T. C. Hu.A new proof of the T-C algorithm, SIAM .}ouJ'-

Google Scholar

[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.

Google Scholar

[9]

D. A. Huffman. A Method for the constructing of minimum redundancy codes, Proc. It#E 40 (1952), pp. I09S- 1101.

Google Scholar

[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

Google Scholar

[11]

D. E. Knuth. The Art of computer programm#rtq. Addison-Wesley (1973).

Google Scholar

[12]

D. E. Knuth. Optimum binary search trees, A cta lnformatica 5 (1971), pp. 14-25.

Google Scholar

[13]

L. L. Larmore, and T. M. Przytycka, Parallel construction of trees with optimal weighted path length, Proc 3rd A CM Symposzum on Parallel A lgomthm#,i#d A #'chttectures (1991), pp. 71-80.

Digital Library

Google Scholar

[14]

L. L. Larmore, and T M. Przytycka. A Fast algorithm for optimum height limited alphabetic binary tree. 3ubmitred for publication

Google Scholar

[15]

W. Rytter, Efficient parallel computation.# for .-,)Lll#',-t3- namic programming problems, Theo. Co#n#. bc#. 59 (1988), pp. 297-307.

Digital Library

Google Scholar

[16]

R. Wilber, The Concave lea#t weight subsequence problem revisited, Journal of Algorithms 9 (1988), pp. 418- 425.

Digital Library

Google Scholar

[17]

F. F. Yao. Efficient dynazrdc programming using quadrangle inequalities, Proc. of the 12th A CM Syrup. on Theory o} Computing (1980), pp. 429-435.

Digital Library

Google Scholar

Cited By

View all

Ding XGu YSun YAgrawal KPetrank E(2024)Parallel and (Nearly) Work-Efficient Dynamic ProgrammingProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659958(219-232)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659958
Alexandrov VChan KGibbons ARytter W(2005)On the PVM/MPI computations of dynamic programming recurrencesRecent Advances in Parallel Virtual Machine and Message Passing Interface10.1007/3-540-63697-8_98(303-312)Online publication date: 29-Jul-2005
https://doi.org/10.1007/3-540-63697-8_98
Karpinski MRytter W(2005)On a sublinear time parallel construction of optimal binary search treesMathematical Foundations of Computer Science 199410.1007/3-540-58338-6_92(453-461)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58338-6_92
Show More Cited By

Index Terms

Parallel construction of optimal alphabetic trees
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation

Recommendations

Optimal Alphabetic Trees

An algorithm of Knuth for finding an optimal binary tree is extended in several directions to solve related problems. The first case considered is restricting the depth of the tree by some predetermined integer K, and a $Kn^2 $ algorithm is given. Next, ...
Partial Alphabetic Trees
ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms

In the partial alphabetic tree problem we are given a multiset of nonnegative weights W = { w ₁, . . . , w _n}, partitioned into k n blocks B ₁, . . . , B _k. We want to find a binary tree T where the elements of W resides in ...
Correctness of Constructing Optimal Alphabetic Trees, Revisited

Comments

Information & Contributors

Information

Published In

SPAA '93: Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures

August 1993

399 pages

ISBN:0897915992

DOI:10.1145/165231

Chairman:
Lawrence Snyder

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

5SPAA93

Sponsor:

European Comp Soc
SIGACT
SIGARCH

5SPAA93: 1993 5th Annual ACM Symposium on Parallel

June 30 - July 2, 1993

Velen, Germany

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
308
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)7

Reflects downloads up to 02 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ding XGu YSun YAgrawal KPetrank E(2024)Parallel and (Nearly) Work-Efficient Dynamic ProgrammingProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659958(219-232)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659958
Alexandrov VChan KGibbons ARytter W(2005)On the PVM/MPI computations of dynamic programming recurrencesRecent Advances in Parallel Virtual Machine and Message Passing Interface10.1007/3-540-63697-8_98(303-312)Online publication date: 29-Jul-2005
https://doi.org/10.1007/3-540-63697-8_98
Karpinski MRytter W(2005)On a sublinear time parallel construction of optimal binary search treesMathematical Foundations of Computer Science 199410.1007/3-540-58338-6_92(453-461)Online publication date: 4-Jun-2005
https://doi.org/10.1007/3-540-58338-6_92
Przytycka TLarmore L(2005)The Optimal Alphabetic Tree problem revisitedAutomata, Languages and Programming10.1007/3-540-58201-0_73(251-262)Online publication date: 29-May-2005
https://doi.org/10.1007/3-540-58201-0_73
Bradford PGolin MLarmore LRytter W(2002)Optimal Prefix-Free Codes for Unequal Letter CostsJournal of Algorithms10.1006/jagm.2002.121342:2(277-303)Online publication date: 1-Feb-2002
https://dl.acm.org/doi/10.1006/jagm.2002.1213
Larmore LPrzytycka T(1998)The Optimal Alphabetic Tree Problem RevisitedJournal of Algorithms10.1006/jagm.1998.093428:1(1-20)Online publication date: 1-Jul-1998
https://dl.acm.org/doi/10.1006/jagm.1998.0934
Karpinski MLarmore LRytter WTardos É(1996)Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search treesProceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/313852.313880(36-41)Online publication date: 28-Jan-1996
https://dl.acm.org/doi/10.5555/313852.313880
Larmore LPrzytycka T(1996)A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary TreesJournal of Parallel and Distributed Computing10.1006/jpdc.1996.006735:1(49-56)Online publication date: 25-May-1996
https://dl.acm.org/doi/10.1006/jpdc.1996.0067

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Optimal Alphabetic Trees

Partial Alphabetic Trees

Correctness of Constructing Optimal Alphabetic Trees, Revisited

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Optimal Alphabetic Trees

Partial Alphabetic Trees

Correctness of Constructing Optimal Alphabetic Trees, Revisited

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations