๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1741 || Constructing the Suffix Tree of a Tree with a Large Alphabet

โœ Scribed by Shibuya, Tetsuo


Book ID
115457343
Publisher
Springer Berlin Heidelberg
Year
1999
Tongue
German
Weight
176 KB
Edition
1999
Category
Article
ISBN
3540669167

No coin nor oath required. For personal study only.

โœฆ Synopsis


This book constitutes the refereed proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99, held in Chennai, India, in December 1999.
The 40 revised full papers presented together with four invited contributions were carefully reviewed and selected from 71 submissions. Among the topics covered are data structures, parallel and distributed computing, approximation algorithms, computational intelligence, online algorithms, complexity theory, graph algorithms, computational geometry, and algorithms in practice.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Comp
โœ 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