✦ LIBER ✦

An O(n) bin-packing algorithm for uniformly distributed data

✍ Scribed by J. Csirik; G. Galambos

Publisher: Springer Vienna
Year: 1986
Tongue: English
Weight: 237 KB
Volume: 36
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02240206

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n1/3) algorithm for distributed mut

An O(n1/3) algorithm for distributed mutual exclusion

✍ Pranay Chaudhuri; Mehmet Hakan Karaata 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 189 KB

An O(n log n) unidirectional distributed

An O(n log n) unidirectional distributed algorithm for extrema finding in a circle

✍ Danny Dolev; Maria Klawe; Michael Rodeh 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 997 KB

An O(nlog log n) Learning Algorithm for

An O(nlog log n) Learning Algorithm for DNF under the Uniform Distribution

✍ Y. Mansour 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 571 KB

We show that a DNF with terms of size at most \(d\) can be approximated by a function at most \(d^{O(d \log 1 / \epsilon)}\) nonzero Fourier coefficients such that the expected error squared, with respect to the uniform distribution, is at most \(\epsilon\). This property is used to derive a learnin

An efficient parallel algorithm for O(N2

An efficient parallel algorithm for O(N2) direct summation method and its variations on distributed-memory parallel machines

✍ Junichiro Makino 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 589 KB