✦ LIBER ✦

Optimal parallel quicksort on EREW PRAM

✍ Scribed by Weixiong Zhang; Nageswara S. V. Rao

Book ID: 105410846
Publisher: Springer Netherlands
Year: 1991
Tongue: English
Weight: 344 KB
Volume: 31
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01952784

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal parallel multiselection on EREW

Optimal parallel multiselection on EREW PRAM

✍ Hong Shen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Parallel Heap Operations on an EREW PRAM

✍ W.X. Zhang; R.E. Korf 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 734 KB

Optimal merging and sorting on the EREW

Optimal merging and sorting on the EREW PRAM

✍ Torben Hagerup; Christine Rüb 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Integer merging on EREW PRAM

✍ Hazem M. Bahig 📂 Article 📅 2010 🏛 Springer Vienna 🌐 English ⚖ 151 KB

Divide-and-conquer-based optimal paralle

Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model

✍ Das, S.K.; Deo, N. 📂 Article 📅 1988 🏛 IEEE ⚖ 976 KB

Optimal Randomized EREW PRAM Algorithms

Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests

✍ Shay Halperin; Uri Zwick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 384 KB

We present the first randomized O log n time and O m + n work EREW PRAM algorithm for finding a spanning forest of an undirected graph G = V E with n vertices and m edges. Our algorithm is optimal with respect to time, work, and space. As a consequence we get optimal randomized EREW PRAM algorithms