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 条
  • [21] Tight Conditional Lower Bounds for Vertex Connectivity Problems
    Huang, Zhiyi
    Long, Yaowei
    Saranurak, Thatchaphol
    Wang, Benyu
    [J]. PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1384 - 1395
  • [22] Towards Tight Communication Lower Bounds for Distributed Optimisation
    Alistarh, Dan
    Korhonen, Janne H.
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021,
  • [23] TIGHT CHIP AREA LOWER BOUNDS FOR STRING MATCHING
    SYKORA, O
    VRTO, I
    [J]. INFORMATION PROCESSING LETTERS, 1987, 26 (03) : 117 - 119
  • [24] Tight lower bounds for the longest common extension problem
    Kosolobov, Dmitry
    [J]. INFORMATION PROCESSING LETTERS, 2017, 125 : 26 - 29
  • [25] Tight lower bounds for minimum weight triangulation heuristics
    Levcopoulos, C
    Krznaric, D
    [J]. INFORMATION PROCESSING LETTERS, 1996, 57 (03) : 129 - 135
  • [26] Tight Lower Bounds for the Size of Epsilon-Nets
    Pach, Janos
    Tardos, Gabor
    [J]. COMPUTATIONAL GEOMETRY (SCG 11), 2011, : 458 - 463
  • [27] Tight upper and lower bounds on suffix tree breadth
    Badkobeh, Golnaz
    Gawrychowski, Pawel
    Kaerkkaeinen, Juha
    Puglisi, Simon J.
    Zhukova, Bella
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 854 (854) : 63 - 67
  • [28] TIGHT LOWER BOUNDS FOR THE SIZE OF EPSILON-NETS
    Pach, Janos
    Tardos, Gabor
    [J]. JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 2013, 26 (03) : 645 - 658
  • [29] TIGHT LOWER BOUNDS TO EIGENVALUES OF THE SCHRODINGER-EQUATION
    HILL, RN
    [J]. JOURNAL OF MATHEMATICAL PHYSICS, 1980, 21 (08) : 2182 - 2192
  • [30] Tight Lower Bounds for Selection in Randomly Ordered Streams
    Chakrabarti, Amit
    Jayram, T. S.
    Patrascu, Mihai
    [J]. PROCEEDINGS OF THE NINETEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2008, : 720 - +