✦ LIBER ✦

An O(√n) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors

✍ Scribed by Frank Dehne; Ivan Stojmenovic

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

O(n12) algorithms for the maximal elemen

✍ Frank Dehne 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 162 KB

An $O ( ( n\log p )^2 )$ Algorithm for t

✍ Chandrasekaran, R.; Tamir, A. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 776 KB

An O(1) time algorithms for computing hi

✍ Kao, T.-W.; Horng, S.-J.; Wang, Y.-L. 📂 Article 📅 1995 🏛 Institute of Electrical and Electronics Engineers ⚖ 760 KB

An O(log n) time parallel algorithm for

✍ Cao An Wang; Yung H. Tsin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 439 KB

An O(nm) algorithm for a special case of

✍ Dilip Chhajed; Timothy J. Lowe 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 556 KB

An O(nm)-time algorithm for computing th

✍ Uri N. Peled; Bruno Simeone 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 924 KB