Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
From MaRDI portal
Publication:476439
DOI10.1007/S00453-012-9696-5zbMATH Open1317.68046DBLPjournals/algorithmica/Goodrich14OpenAlexW2029765430WikidataQ37586483 ScholiaQ37586483MaRDI QIDQ476439FDOQ476439
Authors: Michael T. Goodrich 
Publication date: 2 December 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3925461
Recommendations
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Randomized Shellsort, a simple oblivious sorting algorithm
- Randomized shellsort: a simple data-oblivious sorting algorithm
- Algorithms – ESA 2005
- Sorting, Approximate Sorting, and Searching in Rounds
- Randomized adaptive sorting
- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
- scientific article; zbMATH DE number 861443
- An approximation algorithm for sorting by reversals and transpositions
Cites Work
- Quicksort
- Introduction to algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing with Noisy Information
- Title not available (Why is that?)
- Probability and Computing
- Sorting in \(c \log n\) parallel steps
- The coupon-collector problem revisited — a survey of engineering problems and computational methods
- Sorting networks of logarithmic depth, further simplified
- Universally composable two-party and multi-party secure computation
- Improved sorting networks with O(log N) depth
- Secure multi-party computation made simple
- Fault Tolerant Sorting Networks
- Improved upper bounds on Shellsort
- Bad cases for shaker-sort
- Analyzing variants of Shellsort
- Fun-Sort -- or the chaos of unordered binary search
- Algorithm design: Foundations, analysis, and Internet examples
- A lower bound on the average-case complexity of shellsort
- Noisy sorting without resampling
- Title not available (Why is that?)
- A Lower Bound on the Size of Shellsort Sorting Networks
- Lower Bounds for Shellsort
- Hypercubic Sorting Networks
- Analysis of Shellsort and related algorithms
- Randomized Shellsort, a simple oblivious sorting algorithm
- Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
Cited In (3)
Uses Software
This page was built for publication: Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476439)
