|
|||||
|
|
Bitonic sorters of minimal depth |
|
| Authors: | Tamir Levi Ami Litman |
| Affiliation: | |
| 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)⌋. |
| Keywords: | Bitonic sorting Comparator networks Oblivious algorithms Symmetric comparator networks |
| 本文献已被 ScienceDirect 等数据库收录！ | |