✦ LIBER ✦

Expected time analysis of interpolation merge — a simple new merging algorithm

✍ Scribed by Sumanta Guha; Arunabha Sen

Book ID: 107765967
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 447 KB
Volume: 40
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90123-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The analysis of a simple in-place mergin

The analysis of a simple in-place merging algorithm

✍ Renzo Sprugnoli 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 726 KB

A simple linear-time algorithm for in si

A simple linear-time algorithm for in situ merging

✍ Heikki Mannila; Esko Ukkonen 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 451 KB

Time-uncertainty analysis in project net

Time-uncertainty analysis in project networks with a new merge-event time-estimation technique

✍ D. Gong; R. Hugsted 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 877 KB

Linear expected time of a simple union-f

Linear expected time of a simple union-find algorithm

✍ Jon Doyle; Ronald L. Rivest 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 446 KB

Twiddle factor merged frequency-decimal

Twiddle factor merged frequency-decimal FFT algorithm—A new explanation of the RCFA

✍ Xu Wei; Chen Zongzhi 📂 Article 📅 1988 🏛 SP Science Press 🌐 English ⚖ 251 KB

Design and analysis of a merging algorit

Design and analysis of a merging algorithm for multipoint-to-point ABR service in ATM networks

✍ Chun-Liang Lee; Yaw-Chung Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 244 KB

In this paper, we propose a merging algorithm, which can provide ef®cient support for multipoint-to-point ABR service in ATM networks. By forwarding the FRM cells belonging to the VC with the largest FRM-cell arrival rate in a merge point, the proposed algorithm can achieve better link utilization t