The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Note on the Efficiency of Hashing Functions
Journal of the ACM (JACM)
Minimal perfect hash functions made simple
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
A compendium of key search references
ACM SIGIR Forum
Making files real with a virtual disk
SIGCSE '91 Proceedings of the twenty-second SIGCSE technical symposium on Computer science education
Delta storage for arbitrary non-text files
SCM '91 Proceedings of the 3rd international workshop on Software configuration management
Practical minimal perfect hash functions for large databases
Communications of the ACM
A faster algorithm for constructing minimal perfect hash functions
SIGIR '92 Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval
A new hashing function: statistical behaviour and algorithm
ACM SIGIR Forum
Even strongly universal hashing is pretty fast
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 7th annual conference on Innovation and technology in computer science education
Bucket Hashing and its Application to Fast Message Authentication
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Random numbers for computer graphics
ACM SIGGRAPH 2006 Sketches
High performance index build algorithms for intranet search engines
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Massively parallel acceleration of a document-similarity classifier to detect web attacks
Journal of Parallel and Distributed Computing
A new memory based variable-length encoding genetic algorithm for multiobjective optimization
EMO'11 Proceedings of the 6th international conference on Evolutionary multi-criterion optimization
Augmented order preserving minimal perfect hash functions for very large digital libraries
CIT'11 Proceedings of the 5th WSEAS international conference on Communications and information technology
Non-crypto Hardware Hash Functions for High Performance Networking ASICs
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
The universality of iterated hashing over variable-length strings
Discrete Applied Mathematics
Assuring application-level correctness against soft errors
Proceedings of the International Conference on Computer-Aided Design
A cellular automata model for species competition and evolution
ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
Hi-index | 48.24 |
Using only a few simple and commonplace instructions, this algorithm efficiently maps variable-length text strings small integers.