Bitonic sorters of minimal depth

Authors:
Tamir Levi;Ami Litman
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
2011

Citing 6
Cited 0

K-Way Bitonic Sort

IEEE Transactions on Computers
A correction network for N-sorters

SIAM Journal on Computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Research note: Networks for sorting multitonic sequences

Journal of Parallel and Distributed Computing
Optimal conclusive sets for comparator networks

Theoretical Computer Science
The Strongest Model of Computation Obeying 0-1 Principles

Theory of Computing Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2@?log(n)@?-@?log(n)@?.