Bitonic sorters of minimal depth

DOI10.1016/J.TCS.2011.01.006zbMATH Open1233.68029OpenAlexW2075192920MaRDI QIDQ533870FDOQ533870

Authors: Tamir Levi, Ami Litman 

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

Recommendations

• A note on bitonic sorting
• Some topological properties of bitonic sorters
• \(k\)-bitonic sort
• Optimal-depth sorting networks
• K-way bitonic sort
• Minimum Storage Sorting Networks
• Simulating the Bitonic Sort Using P Systems
• Sorting networks of logarithmic depth, further simplified

zbMATH Keywords

algorithmscomputer system organizationsearching and sorting

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Optimal conclusive sets for comparator networks
• The strongest model of computation obeying 0-1 Principles
• A Correction Network for N-Sorters
• K-way bitonic sort
• Networks for sorting multitonic sequences

Cited In (3)

• A note on bitonic sorting
• Toward a lower bound for sorting networks
• K-way bitonic sort

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533870)