✦ LIBER ✦

Self-adjusting multi-way search trees

✍ Scribed by Charles Martel

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 963 KB
Volume: 38
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90235-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Self-Adjusting k-ary Search Trees

✍ M. Sherk 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 994 KB

We present an online self-adjusting \(k\)-ary search tree, the \(k\)-splay tree, as a generalization of the binary splay tree. We prove a \(k\)-ary analogue of Sleator and Tarjan's splay tree access lemma using a considerably more complicated argument based on their technique. This lemma is used to

Relaxed multi-way trees with group updat

Relaxed multi-way trees with group updates

✍ Kim S. Larsen 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Data structures with relaxed balance differ from standard structures in that rebalancing can be delayed and interspersed with updates. This gives extra flexibility in both sequential and parallel applications. We study the version of multi-way trees called ða; bÞ-trees (which includes B-trees) with

A tree search algorithm for the multi-co

A tree search algorithm for the multi-commodity location problem

✍ Richard S. Laundy 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Analyzing self-adjusting linear list alg

Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches

✍ Lucas Chi Kwong Hui; Charles U. Martel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 570 KB

Analysis of multi-scallop self-adjusting

Analysis of multi-scallop self-adjusting conical hydrodynamic bearings for high precision spindles

✍ T.S.R. Murthy 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Self-adjusting systems avoid chaos

✍ Alfred W. Hübler; Timothy Wotherspoon 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 379 KB