Improved lower bounds for Shellsort

C. Greg Plaxton, Bjorn Poonen, Torsten Suel

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort.

    Original languageEnglish (US)
    Title of host publicationProceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
    PublisherIEEE Computer Society
    Pages226-235
    Number of pages10
    ISBN (Electronic)0818629002
    DOIs
    StatePublished - Jan 1 1992
    Event33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 - Pittsburgh, United States
    Duration: Oct 24 1992Oct 27 1992

    Publication series

    NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
    Volume1992-October
    ISSN (Print)0272-5428

    Conference

    Conference33rd Annual Symposium on Foundations of Computer Science, FOCS 1992
    CountryUnited States
    CityPittsburgh
    Period10/24/9210/27/92

    Fingerprint

    Adaptive algorithms

    ASJC Scopus subject areas

    • Computer Science(all)

    Cite this

    Plaxton, C. G., Poonen, B., & Suel, T. (1992). Improved lower bounds for Shellsort. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992 (pp. 226-235). [267769] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October). IEEE Computer Society. https://doi.org/10.1109/SFCS.1992.267769

    Improved lower bounds for Shellsort. / Plaxton, C. Greg; Poonen, Bjorn; Suel, Torsten.

    Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. p. 226-235 267769 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 1992-October).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Plaxton, CG, Poonen, B & Suel, T 1992, Improved lower bounds for Shellsort. in Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992., 267769, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 1992-October, IEEE Computer Society, pp. 226-235, 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992, Pittsburgh, United States, 10/24/92. https://doi.org/10.1109/SFCS.1992.267769
    Plaxton CG, Poonen B, Suel T. Improved lower bounds for Shellsort. In Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society. 1992. p. 226-235. 267769. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/SFCS.1992.267769
    Plaxton, C. Greg ; Poonen, Bjorn ; Suel, Torsten. / Improved lower bounds for Shellsort. Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, 1992. pp. 226-235 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
    @inproceedings{479204d090f241a6b7507774a7778c4f,
    title = "Improved lower bounds for Shellsort",
    abstract = "The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort.",
    author = "Plaxton, {C. Greg} and Bjorn Poonen and Torsten Suel",
    year = "1992",
    month = "1",
    day = "1",
    doi = "10.1109/SFCS.1992.267769",
    language = "English (US)",
    series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
    publisher = "IEEE Computer Society",
    pages = "226--235",
    booktitle = "Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992",

    }

    TY - GEN

    T1 - Improved lower bounds for Shellsort

    AU - Plaxton, C. Greg

    AU - Poonen, Bjorn

    AU - Suel, Torsten

    PY - 1992/1/1

    Y1 - 1992/1/1

    N2 - The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort.

    AB - The authors give improved lower bounds for Shellsort based on a new and relatively simple proof idea. The lower bounds obtained are both stronger and more general than the previously known bounds. In particular, they hold for nonmonotone increment sequences and adaptive Shellsort algorithms, as well as for some recently proposed variations of Shellsort.

    UR - http://www.scopus.com/inward/record.url?scp=1542500279&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=1542500279&partnerID=8YFLogxK

    U2 - 10.1109/SFCS.1992.267769

    DO - 10.1109/SFCS.1992.267769

    M3 - Conference contribution

    AN - SCOPUS:1542500279

    T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

    SP - 226

    EP - 235

    BT - Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992

    PB - IEEE Computer Society

    ER -