✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 2125 || Succinct Dynamic Data Structures

✍ Scribed by Dehne, Frank; Sack, Jörg-Rüdiger; Tamassia, Roberto

Book ID: 111881793
Publisher: Springer Berlin Heidelberg
Year: 2001
Weight: 167 KB
Category: Article
ISBN: 3540424237
DOI: 10.1007/3-540-44634-6_39

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] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1986 Volume 233 || Developing implicit data structures

✍ Gruska, Jozef; Rovan, Branislav; Wiedermann, Juraj 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 German ⚖ 448 KB

Edited By J. Gruska, B. Rovan, And J. Wiedermann. Papers Presented At The 12th Symposium On Mathematical Foundations Of Computer Science. Includes Bibliographies.

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A compact data structure and parallel algorithms for permutation graphs

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 383 KB

[Lecture Notes in Computer Science] Visu

[Lecture Notes in Computer Science] Visual Data Mining Volume 4404 || Visual Data Mining: An Introduction and Overview

✍ Simoff, Simeon J.; Böhlen, Michael H.; Mazeika, Arturas 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 340 KB

Visual Data Mining—Opening the Black Box Knowledge discovery holds the promise of insight into large, otherwise opaque datasets. Thenatureofwhatmakesaruleinterestingtoauserhasbeendiscussed 1 widely but most agree that it is a subjective quality based on the practical u- fulness of the information. B

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms in Bioinformatics Volume 2452 || MultiProt — A Multiple Protein Structural Alignment Algorithm

✍ Guigó, Roderic; Gusfield, Dan 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 729 KB

We Are Pleased To Present The Proceedings Of The Second Workshop On Al- Rithms In Bioinformatics (wabi 2002), Which Took Place On September 17-21, 2002 In Rome, Italy. The Wabi Workshop Was Part Of A Three-conference Me- Ing, Which, In Addition To Wabi, Included The Esa And Approx 2002. The Three Co

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 1276 || Tree structure genetic algorithm with a nourishment mechanism

✍ Jiang, Tao; Lee, D. T. 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 608 KB

This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on