Delayed path coupling and generating random permutations via distributed stochastic processes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
Majority bootstrap percolation on the hypercube
Combinatorics, Probability and Computing
Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
Journal of the ACM (JACM)
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
This paper provides an analysis of a natural d-round tournament over n = 2d players and demonstrates that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is used to design efficient sorting algorithms for several models of parallel computation: a comparator network of depth $c\\cdot\lg n$, $c\approx 7.44$, that sorts the vast majority of the n! possible input permutations; an $O(\lg n)$-depth hypercubic comparator network that sorts the vast majority of permutations; a hypercubic sorting network with nearly logarithmic depth; an $O(\lg n)$-time randomized sorting algorithm for any hypercubic machine (other such algorithms have been previously discovered, but this algorithm has a significantly smaller failure probability than any previously known algorithm); and a randomized algorithm for sorting n O(m)-bit records on an $(n\lg n)$-node omega machine in $O(m+\lg n)$ bit steps.