Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aoe, J-I., Morimoto, K., Shishibori, M., and Park, K. A trie compaction algorithm for a large set of keys. IEEE Transaction on Knowledge and Data Engineering8, 3 (1996), 476–491.
2. Bentley, J., and Sedgewick B. Fast algorithms for sorting and searching strings. In Annual ACM-SIAM Symposium on Discrete Algorithms (1996), pp. 1–10.
3. Bescherelle. L’art de Conjuguer. Hatier, Paris, 1966.
4. Czech, Z. J., and Majewski, B. S. An optimal algorithm for generating minimal perfect hash function. Information Processing Letters 43 (1992), 257–264.
5. Daciuk, J., Mihov, S., Watson, B. W., and Watson, R. E. Incremental construction of finite-state automata. Association for Computational Linguistics 26, 1 (2000), 3–16.