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 条
  • [41] Tight upper and lower bounds for the reciprocal sum of Proth primes
    Borsos, Bertalan
    Kovacs, Attila
    Tihanyi, Norbert
    [J]. RAMANUJAN JOURNAL, 2022, 59 (01): : 181 - 198
  • [42] Minimum fill-in: Inapproximability and almost tight lower bounds
    Cao, Yixin
    Sandeep, R. B.
    [J]. INFORMATION AND COMPUTATION, 2020, 271
  • [43] Tight Lower and Upper Bounds on the Minimum Distance of LDPC Codes
    Hashemi, Yoones
    Banihashemi, Amir H.
    [J]. IEEE COMMUNICATIONS LETTERS, 2018, 22 (01) : 33 - 36
  • [44] Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles
    Itsykson, Dmitry
    Oparin, Vsevolod
    Slabodkin, Mikhail
    Sokolov, Dmitry
    [J]. FUNDAMENTA INFORMATICAE, 2016, 145 (03) : 229 - 242
  • [45] Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
    Berkholz, Christoph
    Bonsma, Paul
    Grohe, Martin
    [J]. ALGORITHMS - ESA 2013, 2013, 8125 : 145 - 156
  • [46] Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
    Christoph Berkholz
    Paul Bonsma
    Martin Grohe
    [J]. Theory of Computing Systems, 2017, 60 : 581 - 614
  • [47] Tight lower bounds on the time it takes to generate a geometric phase
    Hornedal, Niklas
    Sonnerborn, Ole
    [J]. PHYSICA SCRIPTA, 2023, 98 (10)
  • [48] TIGHT LOWER BOUNDS FOR PROBABILISTIC SOLITUDE VERIFICATION ON ANONYMOUS RINGS
    ABRAHAMSON, K
    ADLER, A
    HIGHAM, L
    KIRKPATRICK, D
    [J]. JOURNAL OF THE ACM, 1994, 41 (02) : 277 - 310
  • [49] Tight lower bounds on the size of a maximum matching in a regular graph
    Henning, Michael A.
    Yeo, Anders
    [J]. GRAPHS AND COMBINATORICS, 2007, 23 (06) : 647 - 657
  • [50] Tight RMR Lower Bounds for Mutual Exclusion and Other Problems
    Attiya, Hagit
    Hendler, Danny
    Woelfel, Philipp
    [J]. STOC'08: PROCEEDINGS OF THE 2008 ACM INTERNATIONAL SYMPOSIUM ON THEORY OF COMPUTING, 2008, : 217 - 226