Perfect hashing for strings: Formalization and Algorithms (1996)

Cached

Download Links

by Martin Farach , S. Muthukrishnan
Venue:IN PROC 7TH CPM
Citations:10 - 2 self

Documents Related by Co-Citation

150 Simple linear work suffix array construction – Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt - 2003
39 The Level Ancestor Problem Simplified – Michael A. Bender, Martin Farach-Colton
328 On-Line Construction of Suffix Trees – Esko Ukkonen - 1995
296 Efficient randomized pattern-matching algorithms – Richard M. Karp, Michael O. Rabin - 1987
74 Efficient algorithms for document retrieval problems – S. Muthukrishnan - 2002
157 Trans-dichotomous algorithms for minimum spanning trees and shortest paths – M L Fredman, D E Willard - 1994
18 Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (Extended Abstract) – Suleyman Cenk Sahinalp, Uzi Vishkin
573 A Fast String Searching Algorithm – R S Boyer, J S Moore - 1977
549 A space-economical suffix tree construction algorithm – E McCreight - 1976
5 Dynamic Weighted Ancestors – T Kopelwoitz, M Lewenstein - 2003
184 The LCA problem revisited – Michael A. Bender, Martín Farach-colton - 2000
60 Rank/select operations on large alphabets: a tool for text indexing – A Golynski, J I Munro, S S Rao - 2006
33 Finding level-ancestors in trees – O Berkman, U Vishkin - 1994
10 Fast incremental text editing – P Ferragina, R Grossi - 1995
20 An efficient algorithm for dynamic text indexing – Martin Farach - 1994
3 Jurka Human Repetitive Elements. Molecular Biology and Biotechnology – J - 1995
2 Jurka Origin and Evolution of Alu Repetitive Elements. The Impact of – J - 1995
427 Linear pattern matching algorithms – P Weiner - 1973
51 Dictionary matching and indexing with errors and don’t cares – Richard Cole, Moshe Lewenstein - 2004