Lower bound for sorting networks based on the shuffle permutation

C. Greg Plaxton, Torsten Suel

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

    Abstract

    We prove an Ω(lg2 n/lg lg n) lower bound for the depth of sorting networks based on the shuffle permutation. This settles an open question posed by Knuth, up to a Θ(lg lg n) factor. The proof technique employed in the lower bound argument may be of separate interest.

    Original languageEnglish (US)
    Title of host publication4th Annual ACM Symposium on Parallel Algorithms and Architectures
    Place of PublicationNew York, NY, United States
    PublisherPubl by ACM
    Pages70-79
    Number of pages10
    ISBN (Print)089791483X
    StatePublished - 1992
    Event4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92 - San Diego, CA, USA
    Duration: Jun 29 1992Jul 1 1992

    Other

    Other4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92
    CitySan Diego, CA, USA
    Period6/29/927/1/92

    Fingerprint

    Sorting

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Plaxton, C. G., & Suel, T. (1992). Lower bound for sorting networks based on the shuffle permutation. In 4th Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 70-79). New York, NY, United States: Publ by ACM.

    Lower bound for sorting networks based on the shuffle permutation. / Plaxton, C. Greg; Suel, Torsten.

    4th Annual ACM Symposium on Parallel Algorithms and Architectures. New York, NY, United States : Publ by ACM, 1992. p. 70-79.

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

    Plaxton, CG & Suel, T 1992, Lower bound for sorting networks based on the shuffle permutation. in 4th Annual ACM Symposium on Parallel Algorithms and Architectures. Publ by ACM, New York, NY, United States, pp. 70-79, 4th Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA '92, San Diego, CA, USA, 6/29/92.
    Plaxton CG, Suel T. Lower bound for sorting networks based on the shuffle permutation. In 4th Annual ACM Symposium on Parallel Algorithms and Architectures. New York, NY, United States: Publ by ACM. 1992. p. 70-79
    Plaxton, C. Greg ; Suel, Torsten. / Lower bound for sorting networks based on the shuffle permutation. 4th Annual ACM Symposium on Parallel Algorithms and Architectures. New York, NY, United States : Publ by ACM, 1992. pp. 70-79
    @inproceedings{592f4ea53c8a4985bf2e68e64611bb8f,
    title = "Lower bound for sorting networks based on the shuffle permutation",
    abstract = "We prove an Ω(lg2 n/lg lg n) lower bound for the depth of sorting networks based on the shuffle permutation. This settles an open question posed by Knuth, up to a Θ(lg lg n) factor. The proof technique employed in the lower bound argument may be of separate interest.",
    author = "Plaxton, {C. Greg} and Torsten Suel",
    year = "1992",
    language = "English (US)",
    isbn = "089791483X",
    pages = "70--79",
    booktitle = "4th Annual ACM Symposium on Parallel Algorithms and Architectures",
    publisher = "Publ by ACM",

    }

    TY - GEN

    T1 - Lower bound for sorting networks based on the shuffle permutation

    AU - Plaxton, C. Greg

    AU - Suel, Torsten

    PY - 1992

    Y1 - 1992

    N2 - We prove an Ω(lg2 n/lg lg n) lower bound for the depth of sorting networks based on the shuffle permutation. This settles an open question posed by Knuth, up to a Θ(lg lg n) factor. The proof technique employed in the lower bound argument may be of separate interest.

    AB - We prove an Ω(lg2 n/lg lg n) lower bound for the depth of sorting networks based on the shuffle permutation. This settles an open question posed by Knuth, up to a Θ(lg lg n) factor. The proof technique employed in the lower bound argument may be of separate interest.

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

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

    M3 - Conference contribution

    SN - 089791483X

    SP - 70

    EP - 79

    BT - 4th Annual ACM Symposium on Parallel Algorithms and Architectures

    PB - Publ by ACM

    CY - New York, NY, United States

    ER -