Sorting Networks: The End Game
- Michael Codish,
- Luís Cruz-Filipe,
- Peter Schneider-Kamp
- Ben-Gurion University of the Negev,
- University of Southern Denmark
Research Output:
Journal Article or Conference Article in Journal
Conference article
Peer-reviewPublication Information
Output type
Research Output:
Journal Article or Conference Article in Journal
Conference article
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 664-675 (12 pages)Journal (Volume, Issue Number)
Lecture Notes in Computer Science (Volume 8977)Publication milestones
- Published - 24/02/2015
Publication status
Published - 24/02/2015
Publication IDs
- Scopus: 84928822616
Abstract
This paper studies properties of the back end of a sorting network and illustrates the utility of these in the search for networks of optimal size or depth. All previous works focus on properties of the front end of networks and on how to apply these to break symmetries in the search. The new properties help shed understanding on how sorting networks sort and speed-up solvers for both optimal size and depth by an order of magnitude.
Publication metrics
PlumX, opens in new tab
Captures
2
Citations
7
Access to documents
License:Unspecified
Related Event
Title
International Conference on Language and Automata Theory and Applications
Event type
ConferenceDegree of recognition
International eventDate
02/03/2015 - 06/03/2015Location
NiceFrance