메뉴 건너뛰기
Journal of the ACM (JACM)
Volumn 37, Issue 3, 1990, Pages 464-473
A Fast Algorithm for Optimal Length-Limited Huffman Codes
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS; MATHEMATICAL TECHNIQUES--TREES;
EID: 0025464931     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/79147.79150     Document Type: Article
Times cited : (90)
References (12)
  • 1
    • 0001873857 scopus 로고
    • Optimal binary search trees with restricted maximal depth
    • GAREY, M. R. Optimal binary search trees with restricted maximal depth. SIAM J. Comput. 3 (1974), 101-110.
    • (1974) SIAM J. Comput. , vol.3 , pp. 101-110
    • GAREY, M.R.1
  • 2
    • 0016518550 scopus 로고
    • A linear space algorithm for computing maximal common subsequences
    • HIRSCHBERG, D. S. A linear space algorithm for computing maximal common subsequences. Commun. ACM 18 (1975), 341-343.
    • (1975) Commun. ACM , vol.18 , pp. 341-343
    • HIRSCHBERG, D.S.1
  • 3
    • 0006730325 scopus 로고
    • Path length of binary search trees
    • Hu, T. C., AND TAN, K. C. Path length of binary search trees. SIAM J. Appl. Math 22 (1972), 225-234.
    • (1972) SIAM J. Appl. Math , vol.22 , pp. 225-234
    • Hu, T.C.1    TAN, K.C.2
  • 4
    • 0000978261 scopus 로고
    • Optimal computer search trees and variable length alphabetic codes
    • Hu, T. C., AND TUCKER, A. C. Optimal computer search trees and variable length alphabetic codes. SIAM J. Appl. Math 21 (1971), 514-532.
    • (1971) SIAM J. Appl. Math , vol.21 , pp. 514-532
    • Hu, T.C.1    TUCKER, A.C.2
  • 5
    • 84938015047 scopus 로고
    • A method for the construction of minimum redundancy codes
    • HUFFMAN, D. A. A method for the construction of minimum redundancy codes. Proc. Inst. Radio Engineers 40 (1952), 1098-1101.
    • (1952) Proc. Inst. Radio Engineers , vol.40 , pp. 1098-1101
    • HUFFMAN, D.A.1
  • 6
    • 0003031816 scopus 로고
    • Optimal alphabetic trees
    • ITAI, A. Optimal alphabetic trees. SIAM J. Comput. 5 (1976), 9-18.
    • (1976) SIAM J. Comput. , vol.5 , pp. 9-18
    • ITAI, A.1
  • 7
    • 0015197890 scopus 로고
    • Optimal binary search trees
    • KNUTH, D. E. Optimal binary search trees. Acta Inf. I (1971), 14-25.
    • (1971) Acta Inf. I , pp. 14-25
    • KNUTH, D.E.1
  • 8
    • 0001492890 scopus 로고
    • Dynamic Huffman coding
    • KNUTH, D. E. Dynamic Huffman coding. J. Algorithms 6, 2 (1985), 163-180.
    • (1985) J. Algorithms , vol.6 , Issue.2 , pp. 163-180
    • KNUTH, D.E.1
  • 9
    • 0023538087 scopus 로고
    • Height-restricted optimal binary trees. SIAM J. Comput. 16 (
    • LARMORE, L. L. Height-restricted optimal binary trees. SIAM J. Comput. 16 (1987), 1115-1123.
    • (1987) , pp. 1115-1123
    • LARMORE, L.L.1
  • 10
    • 0024612351 scopus 로고
    • Minimum delay codes
    • LARMORE, L. L. Minimum delay codes. SIAM J. Comput. 18 (1989), 82-94.
    • (1989) SIAM J. Comput. , vol.18 , pp. 82-94
    • LARMORE, L.L.1
  • 11
    • 84976687347 scopus 로고
    • Optimal length-restricted codes. Colloquium, AT&T Bell Labs, Murray Hill, N.J., January 6
    • LARMORE, L. L. Optimal length-restricted codes. Colloquium, AT&T Bell Labs, Murray Hill, N.J., January 6, 1988.
    • (1988)
    • LARMORE, L.L.1
  • 12
    • 0016891108 scopus 로고
    • Optimal alphabetic search trees with restricted maximal height
    • WESSNER, R. L. Optimal alphabetic search trees with restricted maximal height. Inf. Proc. Lett. 4 (1976), 90-94.
    • (1976) Inf. Proc. Lett. , vol.4 , pp. 90-94
    • WESSNER, R.L.1

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