𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a certain sorting algorithm

✍ Scribed by S. G. Kizhner

Publisher
Springer US
Year
1974
Tongue
English
Weight
187 KB
Volume
7
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast sorting algorithm
A fast sorting algorithm
✍ L. S. Lozinskii; S. B. Pogrebinskii πŸ“‚ Article πŸ“… 1966 πŸ› Springer US 🌐 English βš– 330 KB
A Wait-Free Sorting Algorithm
A Wait-Free Sorting Algorithm
✍ N. Shavit; E. Upfal; A. Zemach πŸ“‚ Article πŸ“… 2001 πŸ› Springer 🌐 English βš– 181 KB
An external sorting algorithm
An external sorting algorithm
✍ V. A. Litvinov πŸ“‚ Article πŸ“… 1968 πŸ› Springer US 🌐 English βš– 383 KB
A select and insert sorting algorithm
A select and insert sorting algorithm
✍ IstvΓ‘n Beck; Stein Krogdahl πŸ“‚ Article πŸ“… 1988 πŸ› Springer Netherlands 🌐 English βš– 514 KB
A time-optimal distributed sorting algor
A time-optimal distributed sorting algorithm on a line network
✍ Atsushi Sasaki πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 87 KB

We have achieved a strict lower time bound of n -1 for distributed sorting on a line network, where n is the number of processes. The lower time bound has traditionally been considered to be n because it is proved based on the number of disjoint comparison-exchange operations in parallel sorting on