A super-logarithmic lower bound for shuffle-unshuffle sorting networks

Torsten Suel, C. Greg Plaxton

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

    Original languageEnglish (US)
    Title of host publication21st International Colloquium on Automata, Languages and Programming (CALP '94)
    Pages618-629
    StatePublished - Jul 1994

    Cite this

    Suel, T., & Plaxton, C. G. (1994). A super-logarithmic lower bound for shuffle-unshuffle sorting networks. In 21st International Colloquium on Automata, Languages and Programming (CALP '94) (pp. 618-629)