✦ LIBER ✦

Efficient parallel circuits and algorithms for division

✍ Scribed by Narayan Shankar; Vijaya Ramachandran

Book ID: 113163341
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 592 KB
Volume: 29
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90230-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel unidirectional division algorit

Parallel unidirectional division algorithms and implementations parallel unidirectional division algorithms and implementations

✍ Lo, Hao‐Yung; Chang, Tsin‐Yuan; Lee, Ming‐Che 📂 Article 📅 2001 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 482 KB

Parallel algorithms for matrix polynomia

Parallel algorithms for matrix polynomial division

✍ Paola Favati; Grazia Lotti 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Efficient Parallel Algorithms for Planar

Efficient Parallel Algorithms for Planarst-Graphs

✍ Mikhail J. Atallah, Danny Z. Chen and Ovidiu Daescu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 136 KB

Efficient Parallel Algorithms for Parabo

Efficient Parallel Algorithms for Parabolic Problems

✍ Du, Q.; Mu, M.; Wu, Z. N. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

Efficient Parallel Algorithms for Permut

Efficient Parallel Algorithms for Permutation Graphs

✍ K. Arvind; V. Kamakoti; C.P. Rangan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 641 KB

In this paper, we present optimal \(O(\log n)\) time, \(O(n / \log n)\) processor EREW PRAM parallel algorithms for finding the connected components, cut vertices, and bridges of a permutation graph. We also present an \(O(\log n)\) time, \(O(n)\) processor, CREW PRAM model parallel algorithm for fi

Efficient and Optimal Parallel Algorithm

Efficient and Optimal Parallel Algorithms for Cholesky Decomposition

✍ Eunice E. Santos; Pei-Yue Chu 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 187 KB