A lower bound for sorting networks based on the shuffle permutation

C. G. Plaxton, T. Suel

    Research output: Contribution to journalArticle


    We prove an Ω(lg2n/lg lg n) lower bound for the depth of n-input sorting networks based on the shuffle permutation. The best previously known lower bound was the trivial Ω(lg n) bound, while the best upper bound is given by Batcher's Θ(lg2n)-depth bitonic sorting network. The proof technique employed in the lower bound argument may be of independent interest.

    Original languageEnglish (US)
    Pages (from-to)491-508
    Number of pages18
    JournalMathematical Systems Theory
    Issue number5
    Publication statusPublished - Sep 1994


    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Mathematics(all)
    • Computational Theory and Mathematics

    Cite this