[Lecture Notes in Computer Science] Algorithms and Computation Volume 2906 || Succinct Data Structures for Searchable Partial Sums
β Scribed by Ibaraki, Toshihide; Katoh, Naoki; Ono, Hirotaka
- Book ID
- 111881805
- Publisher
- Springer Berlin Heidelberg
- Year
- 2003
- Tongue
- English
- Weight
- 180 KB
- Edition
- 1
- Category
- Article
- ISBN
- 3540245871
No coin nor oath required. For personal study only.
β¦ Synopsis
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), Singapore (1997), Taejon (1998), Chennai (1999), Taipei (2000), Christchurch (2001), and Vancouver (2002). ISAACisanannualinternationalsymposiumthatcoverstheverywiderange of topics in algorithms and computation. The main purpose of the symposium is to provide a forum for researchers working in algorithms and the theory of computation where they can exchange ideas in this active research community. In response to our call for papers, we received unexpectedly many subm- sions, 207 papers. The task of selecting the papers in this volume was done by our program committee and referees. After a thorough review process, the committee selected 73 papers. The selection was done on the basis of originality and relevance to the ?eld of algorithms and computation. We hope all accepted papers will eventally appear in scienti?c journals in more polished forms. The best paper award was given for βOn the Geometric Dilation of Finite Point Setsβ to Annette Ebbers-Baumann, Ansgar Grune Β¨ and Rolf Klein. Two eminent invited speakers, Prof. Andrew Chi-Chih Yao of Princeton University and Prof. Takao Nishizeki of Tohoku University, contributed to this proceedings.
π SIMILAR VOLUMES
Part of a four-volume set, this book constitutes the refereed proceedings of the 7th International Conference on Computational Science, ICCS 2007, held in Beijing, China in May 2007. The papers cover a large volume of topics in computational science and related areas, from multiscale physics to wire
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
This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recogniz