TIGHT LOWER BOUNDS FOR OPTIMUM CODE LENGTH

被引：13
|
作者：
RISSANEN, J
机构：
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 1982年 / 28卷 / 02期
关键词：
D O I：
10.1109/TIT.1982.1056467
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：348 / 349
页数：2
相关论文
共 50 条
  • [1] TIGHT LOWER BOUNDS ON THE LENGTH OF WORD CHAINS
    ALTHOFER, I
    [J]. INFORMATION PROCESSING LETTERS, 1990, 34 (05) : 275 - 276
  • [2] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 318 : 255 - 262
  • [3] TIGHT LOWER BOUNDS FOR SHELLSORT
    WEISS, MA
    SEDGEWICK, R
    [J]. JOURNAL OF ALGORITHMS, 1990, 11 (02) : 242 - 251
  • [4] TIGHT UPPER AND LOWER BOUNDS ON THE PATH-LENGTH OF BINARY-TREES
    DESANTIS, A
    PERSIANO, G
    [J]. SIAM JOURNAL ON COMPUTING, 1994, 23 (01) : 12 - 23
  • [5] Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
    Dosa, Gyorgy
    Fuegenschuh, Armin
    Tan, Zhiyi
    Tuza, Zsolt
    Wesek, Krzysztof
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2019, 27 (04) : 1107 - 1130
  • [6] Tight lower bounds for semi-online scheduling on two uniform machines with known optimum
    György Dósa
    Armin Fügenschuh
    Zhiyi Tan
    Zsolt Tuza
    Krzysztof Węsek
    [J]. Central European Journal of Operations Research, 2019, 27 : 1107 - 1130
  • [7] Tight Double Exponential Lower Bounds
    Bliznets, Ivan
    Hecher, Markus
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024, 2024, 14637 : 124 - 136
  • [8] Tight Lower Bounds for the Complexity of Multicoloring
    Bonamy, Marthe
    Kowalik, Lukasz
    Pilipczuk, Michal
    Socala, Arkadiusz
    Wrochna, Marcin
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2019, 11 (03)
  • [9] Bisections above Tight Lower Bounds
    Mnich, Matthias
    Zenklusen, Rico
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 184 - 193
  • [10] Tight Lower Bounds for Halfspace Range Searching
    Sunil Arya
    David M. Mount
    Jian Xia
    [J]. Discrete & Computational Geometry, 2012, 47 : 711 - 730
12345