𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Concurrent algorithms for root searching

✍ Scribed by Ole Eriksen; Jørgen Staunstrup

Book ID
104706502
Publisher
Springer-Verlag
Year
1983
Tongue
English
Weight
599 KB
Volume
18
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Binary Trees for Concurrent Sea
Weighted Binary Trees for Concurrent Searching
✍ David Cohen; Michael L. Fredman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c

Searching for roots
Searching for roots
✍ Gerd Schroeter 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 555 KB
Algorithms for the matrixpth root
Algorithms for the matrixpth root
✍ Dario A. Bini; Nicholas J. Higham; Beatrice Meini 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 501 KB