Sorting networks: To the end and back again

Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp

Research output: Contribution to journalArticlepeer-review

11 Scopus citations


New properties of the front and back ends of sorting networks are studied, illustrating their utility when searching for bounds on optimal networks. Search focuses first on the “out-sides” of the network and then on the inner part. Previous works focused on properties of the front end to break symmetries in the search. The new, out-side-in, properties shed understanding on how sorting networks sort, and facilitate the computation of new bounds on optimality. We present new, faster, parallel sorting networks for 17–20 inputs. For 17 inputs, we show that no sorting network using less layers exists.

Original languageEnglish
Pages (from-to)184-201
Number of pages18
JournalJournal of Computer and System Sciences
StatePublished - 1 Sep 2019


  • SAT-solving
  • Sorting networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Applied Mathematics
  • General Computer Science
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'Sorting networks: To the end and back again'. Together they form a unique fingerprint.

Cite this