✦ LIBER ✦

Succinct and I/O Efficient Data Structures for Traversal in Trees

✍ Scribed by Craig Dillabaugh; Meng He; Anil Maheshwari

Book ID: 106149214
Publisher: Springer
Year: 2011
Tongue: English
Weight: 764 KB
Volume: 63
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9528-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Spac

[Lecture Notes in Computer Science] Space-Efficient Data Structures, Streams, and Algorithms Volume 8066 || Succinct Representations of Ordinal Trees

✍ Brodnik, Andrej; López-Ortiz, Alejandro; Raman, Venkatesh; Viola, Alfredo 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 381 KB

I/O Efficient Dynamic Data Structures fo

I/O Efficient Dynamic Data Structures for Longest Prefix Queries

✍ Moshe Hershcovitch, Haim Kaplan 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 649 KB

Bisection trees and half-quad trees: Mem

Bisection trees and half-quad trees: Memory and time efficient data structures for VLSI layout editors

✍ A. Pitaksanonkul; S. Thanawastien; C. Lursinsap 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 885 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)

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 5878 || I/O-Efficient Contour Tree Simplification

✍ Dong, Yingfei; Du, Ding-Zhu; Ibarra, Oscar 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 241 KB

Achieving Efficiency and Accuracy in Sim

Achieving Efficiency and Accuracy in Simulation for I/O-Intensive Applications

✍ Hyeonsang Eom; Jeffrey K. Hollingsworth 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 211 KB

This paper presents a family of simulators for data-intensive applications, and a methodology to select the most efficient simulator based on a usersupplied requirement for accuracy. The methodology consists of a series of tests that select an appropriate simulation based on the attributes of the ap