[Lecture Notes in Computer Science] Algorithms and Data Structures Volume 955 || Improved length bounds for the shortest superstring problem
✍ Scribed by Akl, Selim G.; Dehne, Frank; Sack, Jörg-Rüdiger; Santoro, Nicola
- Book ID
- 115533859
- Publisher
- Springer Berlin Heidelberg
- Year
- 1995
- Weight
- 740 KB
- Category
- Article
- ISBN
- 3540447474
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
I Was Invited To Join The Organizing Committee Of The First International Conference On Complex Sciences: Theory And Applications (complex 2009) As Its Ninth Member. At That Moment, Eight Distinguished Colleagues, General Co-chairs Eugene Stanley And Gaoxi Xiao, Technical Co-chairs J·nos Kertész And
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)
This book constitutes the refereed proceedings of the 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, held in Cartagena de Indias, Colombia, in October 2012. The 26 full papers, 13 short papers, and 3 keynote speeches were carefully reviewed and selected from