Bitonic sorters of minimal depth

DOI10.1016/J.TCS.2011.01.006zbMath1233.68029OpenAlexW2075192920MaRDI QIDQ533870

Ami Litman, Tamir Levi

Publication date: 10 May 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.01.006

zbMATH Keywords

algorithmscomputer system organizationsearching and sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• The strongest model of computation obeying 0-1 Principles
• Networks for sorting multitonic sequences
• Optimal conclusive sets for comparator networks
• A Correction Network for N-Sorters
• K-way bitonic sort

This page was built for publication: Bitonic sorters of minimal depth