𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Brodnik, Andrej; López-Ortiz, Alejandro; Raman, Venkatesh; Viola, Alfredo

Book ID
121668261
Publisher
Springer Berlin Heidelberg
Year
2013
Weight
381 KB
Category
Article
ISBN
3642402739

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[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 Data Structures Volume 519 || Algorithms for generating all spanning trees of undirected, directed and weighted graphs
✍ Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 German ⚖ 813 KB

This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003, held in Ottawa, Ontario, Canada, in July/August 2003. The 40 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 126 subm