TIGHT LOWER BOUNDS FOR SHELLSORT

被引：0

作者：

WEISS, MA ^{[1
]}

SEDGEWICK, R ^{[1
]}

机构：

[1] PRINCETON UNIV,DEPT COMP SCI,PRINCETON,NJ 08544

来源：

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：255 / 262

页数：8

共 50 条

[1] TIGHT LOWER BOUNDS FOR SHELLSORT
WEISS, MA
SEDGEWICK, R
[J]. JOURNAL OF ALGORITHMS, 1990, 11 (02) : 242 - 251
[2] Lower bounds for shellsort
Plaxton, CG
Suel, T
[J]. JOURNAL OF ALGORITHMS, 1997, 23 (02) : 221 - 240
[3] Tight Double Exponential Lower Bounds
Bliznets, Ivan
Hecher, Markus
[J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2024, 2024, 14637 : 124 - 136
[4] 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)
[5] Bisections above Tight Lower Bounds
Mnich, Matthias
Zenklusen, Rico
[J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2012, 7551 : 184 - 193
[6] IMPROVED UPPER-BOUNDS ON SHELLSORT
INCERPI, J
SEDGEWICK, R
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1985, 31 (02) : 210 - 224
[7] Tight Lower Bounds for Halfspace Range Searching
Sunil Arya
David M. Mount
Jian Xia
[J]. Discrete & Computational Geometry, 2012, 47 : 711 - 730
[8] Tight lower bounds on the size of sweeping automata
Leung, H
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (03) : 384 - 393
[9] Tight Lower Bounds for Halfspace Range Searching
Arya, Sunil
Mount, David M.
Xia, Jian
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2012, 47 (04) : 711 - 730
[10] TIGHT LOWER BOUNDS FOR THE ONLINE LABELING PROBLEM
Bulanek, Jan
Koucky, Michal
Saks, Michael
[J]. SIAM JOURNAL ON COMPUTING, 2015, 44 (06) : 1765 - 1797