✦ 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
DOI: 10.1007/bf01954896

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Distributed selectsort sorting algorithm

Distributed selectsort sorting algorithms on broadcast communication networks

✍ Jau-Hsiung Huang; Leonard Kleinrock 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 534 KB

Average time behavior of distributive so

Average time behavior of distributive sorting algorithms

✍ L. Devroye; T. Klincsek 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 284 KB

Analysing a class of distributive partit

Analysing a class of distributive partitioning sort algorithms

✍ M. van der Nat; A.A. Verrijn-Stuart 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 539 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

Fast sorting algorithms in the internal

Fast sorting algorithms in the internal memory

✍ V. P. Gladun; Z. L. Rabinovich 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 601 KB

A method for improving the efficiency of

A method for improving the efficiency of external sorting algorithms using the distribution method

✍ B. B. Timofeev; V. A. Litvinov 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 314 KB