✦ LIBER ✦

Optimal expected-time algorithms for merging

✍ Scribed by Mai Thanh; V.S. Alagar; T.D. Bui

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 732 KB
Volume: 7
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(86)90026-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ultrafast Expected Time Parallel Algorit

Ultrafast Expected Time Parallel Algorithms

✍ Philip D MacKenzie; Quentin F Stout 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 227 KB

It was shown previously that sorting n items into n locations with a polynomial Ž . number of processors requires ⍀ log nrlog log n time. We sidestep this lower Ž . bound with the idea of padded sorting, or sorting n items into n q o n locations. Because many problems do not rely on the exact rank o

An optimal parallel algorithm for mergin

An optimal parallel algorithm for merging using multiselection

✍ Narsingh Deo; Amit Jain; Muralidhar Medidi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 654 KB

Polynomial Time Algorithms for Determini

Polynomial Time Algorithms for Determining Optimal Strategies

✍ Dmitrii Lozovanu; Stefan Pickl 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Optimal allocation of unreliable compone

Optimal allocation of unreliable components for maximizing expected profit over time

✍ Claude G. Henin 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 479 KB

Optimal parallel merging and sorting alg

Optimal parallel merging and sorting algorithms using √N processors without memory contention

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

Handbook of Computational Econometrics |

Handbook of Computational Econometrics || Algorithms for Minimax and Expected Value Optimization

✍ Belsley, David A.; Kontoghiorghes, Erricos John 📂 Article 📅 2009 🏛 John Wiley & Sons, Ltd ⚖ 653 KB