Lopsided trees: Analyses, algorithms, and applications
A lopsided tree is a rooted, ordered, tree in which the length ci of an edge from a node to its ith 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).
KeywordsVarn Codes Fibonacci Recurrences Mellin Transforms Postal Model
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 12.Ivan Niven, “Irrational Numbers,” Carus Mathematical Monographs, 11. The Mathematical Association of America, Washington D.C., 1956.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
- 16.C.E. Shannon “A Mathematical Theory of Communication,” Bell System Technical Journal 27 (1948) 379–423, 623–656.Google Scholar