SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Acta Informatica

Volumn 36, Issue 9-10, 2000, Pages 721-734

Minimal Huffman trees

(2) Forst, Gunnar a Thorup, Anders a

a UNIVERSITY OF COPENHAGEN (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034349898 PISSN: 00015903 EISSN: None Source Type: Journal
DOI: 10.1007/s002360050172 Document Type: Article

Times cited : (3)

References (13)

1
- 0000417455
- A coding theorem and rényi's entropy
- 1. L.L. Campbell: A coding theorem and Rényi's entropy, Inform. Contr. 8, 423-429 (1965)
- (1965) Inform. Contr. , vol.8 , pp. 423-429
- Campbell, L.L.¹

2
- 0004236341
- Englewood Cliffs, NJ: Prentice-Hall
- 2. R.W. Hamming: Coding and Information Theory, Englewood Cliffs, NJ: Prentice-Hall 1980
- (1980) Coding and Information Theory
- Hamming, R.W.¹

3
- 0002414482
- Remarks on 'compact' Huffman trees
- 3. Y. Horibe: Remarks on 'compact' Huffman trees, J. Combin. Inform. System Sci. 9, 117-120 (1984)
- (1984) J. Combin. Inform. System Sci. , vol.9 , pp. 117-120
- Horibe, Y.¹

4
- 84938015047
- A method for the construction of minimum-redundancy codes
- 4. D.A. Huffman: A method for the construction of minimum-redundancy codes, Proc. IRE 40, 1098-1101 (1952)
- (1952) Proc. IRE , vol.40 , pp. 1098-1101
- Huffman, D.A.¹

5
- 0003657590
- Reading, Mass.: Addison Wesley
- 5. D.E. Knuth: The Art of Computer Programming, Volume I/Fundamental Algorithms, Second edition, Reading, Mass.: Addison Wesley 1973
- (1973) The Art of Computer Programming, Volume I/Fundamental Algorithms, Second Edition , vol.1
- Knuth, D.E.¹

6
- 0002414484
- Huffman's algorithm via algebra
- 6. D.E. Knuth: Huffman's algorithm via algebra, J. Combin. Theory Ser. A 32, 216-224 (1982)
- (1982) J. Combin. Theory Ser. A , vol.32 , pp. 216-224
- Knuth, D.E.¹

7
- 0002609534
- Minimum variance huffman codes
- 7. L.T. Kou: Minimum variance Huffman codes, SIAM J. Comput. 11, 138-148 (1982)
- (1982) SIAM J. Comput. , vol.11 , pp. 138-148
- Kou, L.T.¹

8
- 0002416957
- Best Huffman trees
- 8. G. Markowsky: Best Huffman trees, Acta Inform. 16, 363-370 (1981)
- (1981) Acta Inform. , vol.16 , pp. 363-370
- Markowsky, G.¹

9
- 0031268988
- Optimal binary search trees
- 9. S.V. Nagaraj: Optimal binary search trees, Theoret. Comput. Sci. 188, 1-44 (1997)
- (1997) Theoret. Comput. Sci. , vol.188 , pp. 1-44
- Nagaraj, S.V.¹

10
- 0016575189
- On a coding theorem connected with Rényi's entropy
- 10. P. Nath: On a coding theorem connected with Rényi's entropy, Inform. Contr. 29, 234-242 (1975)
- (1975) Inform. Contr. , vol.29 , pp. 234-242
- Nath, P.¹

11
- 0000229777
- Conditions for optimality of the huffman algorithm
- 11. D.S. Parker, Jr.: Conditions for optimality of the Huffman algorithm, SIAM J. Comput. 9, 470-489 (1980)
- (1980) SIAM J. Comput. , vol.9 , pp. 470-489
- Parker, D.S.¹

12
- 0002571721
- An optimum encoding with minimum longest code and total number of digits
- 12. E.S. Schwartz: An optimum encoding with minimum longest code and total number of digits, Inform. Contr. 7, 37-44 (1964)
- (1964) Inform. Contr. , vol.7 , pp. 37-44
- Schwartz, E.S.¹

13
- 0002412017
- Ph.D. Thesis, Massachusetts Institue of Technology
- 13. J.K. Tamaki: Optimal Binary Trees and Sequences Realized by Eulerian Triangulations, Ph.D. Thesis, Massachusetts Institue of Technology, 1978
- (1978) Optimal Binary Trees and Sequences Realized by Eulerian Triangulations
- Tamaki, J.K.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.