✦ LIBER ✦

Splitmerge—A fast stable merging algorithm

✍ Scribed by Svante Carlsson

Book ID: 113162851
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 260 KB
Volume: 22
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(86)90026-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Duodirun merging algorithm: A new fa

The Duodirun merging algorithm: A new fast algorithm for parallel merging

✍ Zhi-Jie Zheng 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 120 KB

On a stable minimum storage merging algo

On a stable minimum storage merging algorithm

✍ Kreysztof Dudzińki; Andrzej Dydek 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 556 KB

A parallel merging algorithm

✍ R.H. Barlow; D.J. Evans; J. Shanehchi 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 457 KB

A fast sorting algorithm, a hybrid of di

A fast sorting algorithm, a hybrid of distributive and merge sorting

✍ M. van der Nat 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 660 KB

FaSa: A fast and stable quadratic placem

FaSa: A fast and stable quadratic placement algorithm

✍ WenTing Hou; XianLong Hong; WeiMin Wu; Yici Cai 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 614 KB

A fast and stable algorithm for splittin

A fast and stable algorithm for splitting polynomials

✍ G. Malajovich; J.P. Zubelli 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 928 KB

This paper concerns the fast numerical factorization of degree a + b polynomials in a neighborhood of the polynomial x a. We want to obtain the so-called splitting of one such polynomial, i.e., a degree a factor with roots close to zero and a degree b factor with roots close to infinity. An importan