| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435212 | Theoretical Computer Science | 2011 | 14 Pages |
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)⌋.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
