- Authors:
- David G. Kirkpatrick,
- Stefan Reisch
Two models of Random Access Machines suitable for sorting integers are presented. Our main results show that i) a RAM with addition, subtraction, multiplication, and integer division can sort $n$ integers in the range $[0,2^{cn}]$ in $O(n \log c + n)$ steps; ii) a RAM with addition, subtraction, and left and right shifts can sort any $n$ integers in linear time; iii) a RAM with addition, subtraction, and left and right shifts can sort $n$ integers in the range $[0,n^{C}]$ in $O(n \log c + n)$ steps, where all intermediate results are bounded in value by the largest input.
Cited By
Chan T, Chung K, Maggs B and Shi E (2022). Foundations of Differentially Oblivious Algorithms, Journal of the ACM, 69:4, (1-49), Online publication date: 31-Aug-2022.- Asharov G, Lin W and Shi E Sorting short keys in circuits of size o(n log n) Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2249-2268)
- Chan T, Chung K, Maggs B and Shi E Foundations of differentially oblivious algorithms Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (2448-2467)
- Lin W, Shi E and Xie T Can we overcome the n log n barrier for oblivious sorting? Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, (2419-2438)
Recommendations
Sparsification Upper and Lower Bounds for Graph Problems and Not-All-Equal SAT
We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time algorithm that ...
Lower bounds for external memory integer sorting via network coding
STOC 2019: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of ComputingSorting extremely large datasets is a frequently occuring task in practice. These datasets are usually much larger than the computer’s main memory; thus external memory sorting algorithms, first introduced by Aggarwal and Vitter (1988), are often used. ...
Tight complexity bounds for parallel comparison sorting
SFCS '86: Proceedings of the 27th Annual Symposium on Foundations of Computer ScienceThe time complexity of sorting n elements using p ≥ n processors on Valiant's parallel comparison tree model is considered. The following results are obtained. 1. We show that this time complexity is Θ(logn/log(1+p/n)). This complements the AKS sorting ...