Randomized shellsort: a simple data-oblivious sorting algorithm

DOI10.1145/2049697.2049701MaRDI QIDQ5395671zbMATH OpenOpenAlexFDO

Authors Michael T. Goodrich

Publication date 17 February 2014

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2049697.2049701

zbMATH Keywords

sortingChernoff boundsdata-oblivious algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Searching and sorting (68P10)

Recommendations

• Randomized Shellsort, a simple oblivious sorting algorithm
• Zig-zag sort
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Randomized adaptive sorting

Cited in

(10)

• An improved shellsort algorithm
• Practically efficient secure single-commodity multi-market auctions
• Complexity analysis and performance of double hashing sort algorithm
• Secure Multi-party Shuffling
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• Zig-zag sort
• Card-Based Secure Sorting Protocol
• Randomized Shellsort, a simple oblivious sorting algorithm
• CacheShuffle: a family of oblivious shuffles

This page was built for publication: Randomized shellsort: a simple data-oblivious sorting algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395671)