Name
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)@?. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.tcs.2011.01.006 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Symmetric comparator networks,Bitonic sorting,Comparator networks,minimal depth,Oblivious algorithms,previous work,n key,Bitonic sorter | Journal | 412 |
Issue | ISSN | Citations |
22 | Theoretical Computer Science | 0 |
PageRank | References | Authors |
0.34 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tamir Levi | 1 | 9 | 1.85 |
| Ami Litman | 2 | 240 | 49.78 |