A superlogarithmic lower bound for shuffle-unshuffle sorting networks

DOI10.1007/S002240010001zbMath0954.68009OpenAlexW2141886476MaRDI QIDQ1579052

C. Greg Plaxton, Torsten Suel

Publication date: 4 September 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240010001

zbMATH Keywords

shuffle-unshuffle sorting networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

This page was built for publication: A superlogarithmic lower bound for shuffle-unshuffle sorting networks