𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 6844 || Finding Longest Approximate Periodic Patterns

✍ Scribed by Dehne, Frank; Iacono, John; Sack, Jörg-Rüdiger

Book ID
115478013
Publisher
Springer Berlin Heidelberg
Year
2011
Weight
243 KB
Category
Article
ISBN
3642223001

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 6506 || Approximate Periodicity
✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 216 KB

Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010.the 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Book

[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)