๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the distribution of comparisons in sorting algorithms

โœ Scribed by Dana Richards; Pravin Vaidya


Publisher
Springer Netherlands
Year
1988
Tongue
English
Weight
680 KB
Volume
28
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A time-optimal distributed sorting algor
โœ 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