Perfect hashing for strings: Formalization and algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1075, Issue , 1996, Pages 130-140

  Farach, Martin ^a   Muthukrishnan, S ^b  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; HASH FUNCTIONS; PATTERN MATCHING;

BINARY STRING; HASH VALUE; LAS VEGAS; PERFECT HASHING; SINGLE PROCESSORS; SUBSTRING; SUFFIX-TREES; WEIGHTED TREE;

ALGORITHMS;

EID: 84957685983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61258-0_11     Document Type: Conference Paper

References (23)

1. A. Amir, M. Farach, and Y. Matias. Efficient randomized dictionary matching algorithms. Proc. of 3rd Combinatorial Pattern Matching Conference, pages 259-272, 1992. Tucson, Arizona.
2. S.F. Altschul, W. Gish, W. Miller, E.W Myers, and D. J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
3. A. Apostolico, C. Iliopoulos, G.M. Landau, B. Scieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.
4. A. Broder. Applications of Karp-Rabin fingerprints. Manuscript, 1993.
5. Omer Berkman and Uzi Vishkin. Recursive *-tree parallel data- structure. In Proc. of the 30th IEEE Annual Symp. on Foundation of Computer Science, pages 196-202, 1989.
6. B. Chazelle. Computing on a free tree via complexity-preserving mappings. Algorithmica, 2:337-361, 1987.
7. Z J. Czech, G. Havas, and B S. Majewski. An optimal algorithm for generating minimal perfect hash functions. Technical Report 24, DIMACS, 1992.
8. P. Dietz. Finding level-ancestors in dynamic trees. Manuscript, 1992.
9. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31(3):538-544, July 1984.
10. M. Farach and S. Muthukrishnan. Optimal parallel dictionary matching and compression. 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995.
11. M. Farach and S. Muthukrishnan. Optimal Logarithmic Time Randomized Suffix Tree Construction. To be presented at the 23rd Intl. Colloq. on Automata, Languages and Programming, 1996.
12. L. Gasieniec and K. Park. Optimal parallel prefix matching. Proceedings of E.S.A., 1994.
13. H. Hampapuram and M. Fredman. Optimal bi-weighted binary trees and the complexity of mainitaining partial sums. Proc. IEEE Symp. on Foundations on Computer Sc, 1993, 480-485.
14. R. Hariharan and S. Muthukrishnan. Optimal parallel prefix matching. Proc. of 21st International Colloquium on Automata Languages and Programming, 1994.
15. D. E. Knuth. The Art of Computer Programming, V. 3: Sorting and Searching. Addison-Wesley, Reading, 1973.
16. D.E. Knuth, J.H. Morris, and V.R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6:323-350, 1977.
17. R.M. Karp and M.O. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31:249-260, 1987.
18. S. Muthukrishnan. Detecting false matches in string matching algorithms. In Proc. of 4th Combinatorial Pattern Matching Conference, 1993.
19. M. Naor. String matching with preprocessing of text and pattern. Proc. of 18th International Colloquium on Automata Languages and Programming, pages 739-750, 1991.
20. M. Rabin. An algorithm for finding all repetitions. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, pages 85-96. Springer-Verlag, Berlin, 1984.
21. D. Sleator and R. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 24, 1983.
22. S. C. Sahinalp and U. Vishkin. Symmetry breaking for suffix tree construction. Proc. of the 26th Ann. ACM Symp. on Theory of Computing, 1994.
23. P. van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99-127, 1977.