An efficient digital search algorithm by using a double-array structure
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- An efficient implementation of static string pattern matching machinesIEEE Transactions on Software Engineering, 1989
- Collections of Functions for Perfect HashingSIAM Journal on Computing, 1986
- Practical Perfect HashingThe Computer Journal, 1985
- A Practical Method for Reducing Weak Precedence ParsersIEEE Transactions on Software Engineering, 1983
- A practical method for reducing sparse matrices with invariant entriesInternational Journal of Computer Mathematics, 1982
- Reciprocal hashingCommunications of the ACM, 1981
- Minimal perfect hash functions made simpleCommunications of the ACM, 1980
- Storing a sparse tableCommunications of the ACM, 1979
- Extendible hashing—a fast access method for dynamic filesACM Transactions on Database Systems, 1979
- Perfect hashing functionsCommunications of the ACM, 1977