Skip to main content
Springer Nature Link
Log in

Lopsided trees: Analyses, algorithms, and applications

Extended abstract

  • Session 13: Data Structures
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1099))

Included in the following conference series:

  • 153 Accesses

Abstract

A lopsided tree is a rooted, ordered, tree in which the length c i of an edge from a node to its i th child depends upon the value of i. In this paper we examine three problems on such trees and show how to apply the results to the analysis of problems in data compression (Varncodes) and distributed computing (broadcasting in the Postal model of communication).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Doris Altenkamp and Kurt Mehlhorn, “Codes: Unequal Probabilities, Unequal Letter Costs,” Journal of the Association for Computing Machinery, 27(3) (July 1980) 412–427.

    Google Scholar 

  2. Amotz Bar-Noy and Shlomo Kipnis, “Designing Broadcasting Algorithms in the Postal Model for Message Passing Systems,” SPAA 1992 (to appear in Mathematical Systems Theory, 1994).

    Google Scholar 

  3. V. S.-N. Choi, Lopsided Trees: Analyses and Algorithms. M.Phil. Thesis, Hong Kong University of Science and Technology. Department of Computer Science. Technical Report HKUST-CS95-36. (1995).

    Google Scholar 

  4. I. Csiszár, “Simple Proofs of Some Theorems on Noiseless Channels,” Inform. Contr., bf 14 (1969) pp. 285–298

    Article  Google Scholar 

  5. I. Csiszár, G. Katona and G. Tsunády, “Information Sources with Different Cost Scales and the Principle of Conservation of Energy,” Z. Wahrscheinlichkeitstheorie verw, 12, (1969) pp. 185–222

    Article  Google Scholar 

  6. N. Cot, “Complexity of the Variable-length Encoding Problem,” Proceedings of the 6th Southeast Conference on Combinatorics, Graph Theory and Computing, (1975) 211–224.

    Google Scholar 

  7. M. L. Fredman and D. E. Knuth, “Recurrence Relations Based on Minimization,” Journal of Mathematical Analysis and Applications, 48 (1974) 534–559.

    Article  Google Scholar 

  8. M. Golin and G. Rote, “A Dynamic Programming Algorithm for Constructing Optimal Prefix-Free Codes for Unequal Letter Costs,” Proceedings of the 22nd International Colloquim on Automata Languages and Programming (ICALP '95), (July 1995).

    Google Scholar 

  9. M. Golin and H. Young, “Prefix Codes: Equiprobable Words, Unequal Letter Costs,” Proceedings of the 21st International Colloquium on Automata Languages and Programming (ICALP '94), (July 1994). Full version to appear in SIAM Journal on Computing.

    Google Scholar 

  10. Sanjiv Kapoor and Edward Reingold, “Optimum Lopsided Binary Trees,” Journal of the Association for Computing Machinery, 36 (3) (July 1989) 573–590.

    Google Scholar 

  11. R. Karp, “Minimum-Redundancy Coding for the Discrete Noiseless Channel,” IRE Transactions Information Theory, 7 (1961) 27–39.

    Article  Google Scholar 

  12. Ivan Niven, “Irrational Numbers,” Carus Mathematical Monographs, 11. The Mathematical Association of America, Washington D.C., 1956.

    Google Scholar 

  13. R. M. Krause, “Channels Which Transmit Letters of Unequal Duration,” Inform. Contr., 5 (1962) pp. 13–24

    Article  Google Scholar 

  14. Y. Perl, M. R. Garey, and S. Even. “Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters,” Journal of the Association for Computing Machinery, 22(2):202–214, April 1975.

    Google Scholar 

  15. Nicholas Pippenger, “An Elementary Approach to Some Analytic Asymptotics,” SIAM Journal of Mathematical Analysis, 24(5) (September 1993) 1361–1377.

    Article  Google Scholar 

  16. C.E. Shannon “A Mathematical Theory of Communication,” Bell System Technical Journal 27 (1948) 379–423, 623–656.

    Google Scholar 

  17. Serap A. Savari, “Some Notes on Varn Coding,” IEEE Transactions on Information Theory, 40(1) (Jan. 1994) pp. 181–186.

    Article  Google Scholar 

  18. B.F. Varn “Optimal Variable Length Codes (Arbitrary Symbol Costs and Equal Code Word Probabilities),” Informat. Contr., 19 (1971) pp. 289–301

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Hong Kong University of Science and Technology, Clearwater Bay, Kowloon, Hong Kong

    Vicky Siu-Ngan Choi & Mordecai Golin

Authors
  1. Vicky Siu-Ngan Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mordecai Golin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedhelm Meyer Burkhard Monien

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Choi, V.SN., Golin, M. (1996). Lopsided trees: Analyses, algorithms, and applications. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_157

Download citation

  • DOI: https://doi.org/10.1007/3-540-61440-0_157

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61440-1

  • Online ISBN: 978-3-540-68580-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics