✦ LIBER ✦

An O(logn) parallel connectivity algorithm

✍ Scribed by Yossi Shiloach; Uzi Vishkin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal parallel connectivity algorit

✍ Uzi Vishkin 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 707 KB

An Optimal Parallel Co-Connectivity Algo

✍ Ka Wong Chong; Stavros D. Nikolopoulos; Leonidas Palios 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 305 KB

A faster parallel algorithm for k-connec

✍ K. Iwama; C. Iwamoto; T. Ohsawaa 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 453 KB

O (logn) numerical algorithms on a mesh

✍ Dongseung Kim; Seung-Hoon Kim 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 609 KB

An O(n2log n) parallel max-flow algorith

✍ Yossi Shiloach; Uzi Vishkin 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 966 KB

Parallel Algorithms for Image Histogramm

✍ David A. Bader; Joseph JáJá 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 828 KB

Note that throughout this paper, the rate of ''MB/s'' will always represent 10 6 bytes per second.