Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Parallelizing the merge sorting network algorithm on a multi-core computer using Go and Cilk
Proceedings of the 49th Annual Southeast Regional Conference
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
On the complexity of min-max sorting networks
Information Sciences: an International Journal
Efficient filters for the simulated evolution of small sorting networks
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Efficient high-similarity string comparison: the waterfall algorithm
Proceedings of the Joint EDBT/ICDT 2013 Workshops
| Hi-index | 0.00 |
We further simplify Paterson’s version of the Ajtai–Komlós–Szemerédi sorting network, and its analysis, mainly by tuning the invariant to be maintained.