✦ LIBER ✦

An efficient parallel algorithm for the single function coarsest partition problem

✍ Scribed by Joseph F. Jájá; Kwan Woo Ryu

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 1006 KB
Volume: 129
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90030-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient algorithm for the single ma

An efficient algorithm for the single machine tardiness problem

✍ Suna Kondakci; Ömer Kirca; Meral Azizoǧlu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 553 KB

An efficient algorithm for the transship

An efficient algorithm for the transshipment along a single road problem

✍ Agha Iqbal Ali 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 485 KB

An optimal parallel algorithm for the do

An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model

✍ Ming-Shing Yu; Cheng-Hsing Yang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 646 KB

An efficient algorithm for the capacitat

An efficient algorithm for the capacitated single item dynamic lot size problem

✍ Ömer Kirca 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 713 KB

An Efficient Algorithm for the Complex R

An Efficient Algorithm for the Complex Roots Problem

✍ C.Andrew Neff; John H. Reif 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ϪȐ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

An efficient algorithm for the “stable r

An efficient algorithm for the “stable roommates” problem

✍ Robert W Irving 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 938 KB