𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constant-time sorting

✍ Scribed by Brand, Michael

Book ID
123528783
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
398 KB
Volume
237
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Constant time parallel sorting: an empir
Constant time parallel sorting: an empirical view
✍ William Gasarch; Evan Golub; Clyde Kruskal πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 507 KB

Consider the following problem: If you want to sort n numbers in k (a constant) rounds then how many comparisons-per-round do you need? This problem has been studied carefully and there exist several algorithms and some lower bounds for it. Many of the algorithms are non-constructive. We have embark

Sorting in Linear Time?
Sorting in Linear Time?
✍ Arne Andersson; Torben Hagerup; Stefan Nilsson; Rajeev Raman πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 679 KB

We show that a unit-cost RAM with a word length of w bits can sort n integers in the range 0 } } } 2 w &1 in O(n log log n) time for arbitrary w log n, a significant improvement over the bound of O(nlog n) achieved by the fusion trees of Fredman and Willard. Provided that w (log n) 2+= for some fixe