✦ LIBER ✦

Searchability in merging and implicit data structures

✍ Scribed by J. Ian Munro; Patricio V. Poblete

Book ID: 105403398
Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 395 KB
Volume: 27
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01933727

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partial match retrieval in implicit data

Partial match retrieval in implicit data structures

✍ Helmut Alt; Kurt Mehlhorn; J.Ian Munro 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 261 KB

Implicit data structures for fast search

Implicit data structures for fast search and update

✍ J.Ian Munro; Hendra Suwanda 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 883 KB

On implicit data structures for priority

On implicit data structures for priority queues

✍ A. Perko 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

An Efficient Data Structure for Maxplus

An Efficient Data Structure for Maxplus Merge in Dynamic Programming

✍ Ruiming Chen; Hai Zhou 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 258 KB

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2906 || Succinct Data Structures for Searchable Partial Sums

✍ Ibaraki, Toshihide; Katoh, Naoki; Ono, Hirotaka 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 180 KB

This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996)

Volumetric reconstruction: matching and

Volumetric reconstruction: matching and merging in dicom data

✍ Kevin Robinson; Ovidiu Ghita; Paul F. Whelan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 52 KB