✦ LIBER ✦

O(log*n) algorithms on a Sum-CRCW PRAM

✍ Scribed by S. C. Eisenstat

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(m log n) algorithm for the max + su

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 240 KB

An O(n log n) algorithm for a maxmin loc

✍ C.Pandu Rangan; Ramesh Govindan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 257 KB

A O(nm log(U/n)) time maximum flow algor

✍ Antonio Sedeño-Noda; Carlos González-Martín 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

A simple algorithm for learning O(log n)

✍ Eyal Kushilevitz 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 319 KB

An O(log N) algorithm to solve linear re

✍ H.N. Reddy; E.L. Leiss 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 520 KB

An O(n log n) feasibility algorithm for

✍ Mohan Ahuja; Yahui Zhu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 494 KB