Merging almost sorted sequences yields a 24-sorter

DOI10.1016/J.IPL.2016.08.005zbMath1392.68159OpenAlexW2521800934MaRDI QIDQ344521

Thorsten Ehlers

Publication date: 23 November 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2016.08.005

zbMATH Keywords

parallel processingtheory of computationsorting networks

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Sorting Networks: The End Game
• New Bounds on Optimal Sorting Networks
• Theory and Applications of Satisfiability Testing
• Optimal Sorting Networks

This page was built for publication: Merging almost sorted sequences yields a 24-sorter