Lopsided trees: Analyses, algorithms, and applications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1099, Issue , 1996, Pages 538-549

  Choi, Vicky Siu Ngan ^a   Golin, Mordecai ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Fibonacci recurrences; Mellin transforms; Postal model; Vara codes

Indexed keywords

AUTOMATA THEORY; FORESTRY; ROBOTS;

FIBONACCI RECURRENCES; MELLIN TRANSFORM; VARA CODES;

TREES (MATHEMATICS);

EID: 84947767815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_157     Document Type: Conference Paper

References (18)

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.
2. Amotz Bar-Noy and Shi Oto Kipnis, "Designing Broadcasting Algorithms in the Postal Model for Message Passing Systems," SPAA 1992 (to appear in Mathematical Systems Theory, 1994),.
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).
4. I. Csiszár, "Simple Proofs of Some Theorems on Noiseless Channels," Inform. Contr., bf 14 (1969) pp. 285-298
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 venu, 12, (1969) pp. 185-222
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.
7. M. L. Fredraan and D. E. Knuth, "Recurrence Relations Based on Minimization," Journal of Mathematical Analysis and Applications, 48 (1974) 534-559.
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 (IGALP '95), (July 1995).
9. Μ. Golin and N. Young, "Prefix Codes: Equiprobable Words, Unequal Letter Costs," Proceedings of the 21st International Colloquium on Automata Languages and Programming (1СALP III), (July 1994). Full version to appear in SI AM Journal on Computing.
10. Sanjiv Kapoor and Edward Reingold, "Optimum Lopsided Binary Trees," Journal of ihe Association for Computing Machinery, 36 (3) (July 1989) 573-590.
11. R. Karp, "Minimum-Redundancy Coding for the Discrete Noiseless Channel," IRE Transactions Information Theory, 7 (1961) 27-39.
12. Ivan Niven, "Irrational Numbers," Cams Mathematical Monographs, 11. The Mathematical Association of America, Washington D.C., 1956.
13. R. M. Krause, "Channels Which Transmit Letters of Unequal Duration," Inform. Contr., 5 (1962) pp. 13-24
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.
15. Nicholas Pippenger, "An Elementary Approach to Some Analytic Asymptotics," SIAM Journal of Mathematical Analysis, 24(5) (September 1993) 1361-1377.
16. C.E. Shannon "A Mathematical Theory of Communication," Bell System Technical Journal 27 (1948) 379-423, 623-656.
17. Serap A. Savari, "Some Notes on Varn Coding," IEEE Transactions on Information Theory, 40(1) (Jan. 1994) pp. 181-186.
18. B.F. Vam "Optimal Variable Length Codes (Arbitrary Symbol Costs and Equal Code Word Probabilities)," Informat. Contr., 19 (1971) pp. 289-301