Work

Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons

Year: 2010

Type: preprint

Abstract: We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a \emph{temperature} parameter. Both algorithms are simple, randomized, data-oblivious sorting algorithms, which are useful in privacy-preserving computations, but, as we show, Annealing sort is much more efficient. We show that there is an input permutation that causes Spin-the-bottle sort to require $Ω(n^2\log n)$ expected time in order to succeed, and that in $O(n^2\log n)$ time this algorithm succeeds with high probability for any input. We also show there is an implementation of Annealing sort that runs in $O(n\log n)$ time and succeeds with very high probability.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1011.2480

Author: Goodrich, Michael T.

Institution: University of California, Irvine

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Multidisciplinary University Research Initiative, Office of Naval Research

Awards: G2998923865, IPS: Collaborative Research: Privacy Management, Measurement, and Visualization in Distributed Environments, G4154686922, SDCI Data New: Trust Management for Open Collaborative Information Repositories: The CalSWIM Cyberinfrastructure, G8876996369

OpenAlex ID: W4297832629

Cites:

Cited by:

Related to: 10