✦ LIBER ✦

Parallel Sorting with Constant Time for Comparisons

✍ Scribed by Häggkvist, Roland; Hell, Pavol

Book ID: 118174073
Publisher: Society for Industrial and Applied Mathematics
Year: 1981
Tongue: English
Weight: 944 KB
Volume: 10
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0210034

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

Constant-time parallel sorting algorithm

Constant-time parallel sorting algorithm and its optical implementation using smart pixels

✍ Louri, Ahmed ;Hatch, James A. ;Na, Jongwhoa 📂 Article 📅 1995 🏛 The Optical Society 🌐 English ⚖ 674 KB

Parallel Sorting with Limited Bandwidth

✍ Adler, Micah; Byers, John W.; Karp, Richard M. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 209 KB

A Parallel Priority Queue with Constant

A Parallel Priority Queue with Constant Time Operations

✍ Gerth Stølting Brodal; Jesper Larsson Träff; Christos D. Zaroliagis 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 245 KB

A simple proof of a time-space trade-off

A simple proof of a time-space trade-off for sorting with linear comparisons

✍ Donald B. Johnson 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Constant-Time Randomized Parallel String

Constant-Time Randomized Parallel String Matching

✍ Crochemore, Maxime; Galil, Zvi; Gasieniec, Leszek; Park, Kunsoo; Rytter, Wojciec 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 280 KB