Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A polynomial time generator for minimal perfect hash functions
Communications of the ACM
Graphical evolution: an introduction to the theory of random graphs
Graphical evolution: an introduction to the theory of random graphs
Letter-oriented reciprocal hashing scheme
Information Sciences: an International Journal
Algorithms
Random number generators: good ones are hard to find
Communications of the ACM
File organization using composite perfect hashing
ACM Transactions on Database Systems (TODS)
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A more cost effective algorithm for finding perfect hash functions
CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
Fast hashing of variable-length text strings
Communications of the ACM
Near—perfect hashing of large word sets
Software—Practice & Experience
Order preserving minimal perfect hash functions and information retrieval
SIGIR '90 Proceedings of the 13th annual international ACM SIGIR conference on Research and development in information retrieval
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Efficient data structures for information retrieval
Efficient data structures for information retrieval
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
ACM Computing Surveys (CSUR)
The study of an ordered minimal perfect hashing scheme
Communications of the ACM
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
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
An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions
An O(n log n) Algorithm for Finding Minimal Perfect Hash Functions
Implementation of a Perfect Hash Function Scheme
Implementation of a Perfect Hash Function Scheme
Building the CODER Lexicon: The Collins English Dictionary and Its Adverb Definitions
Building the CODER Lexicon: The Collins English Dictionary and Its Adverb Definitions
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
What if there were desktop access to the computer science literature?
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Parallel construction of minimal perfect hashing functions with neural networks
CSC '93 Proceedings of the 1993 ACM conference on Computer science
A new hashing function: statistical behaviour and algorithm
ACM SIGIR Forum
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Cascading Content-Addressable Memories
IEEE Micro
Using Tries to Eliminate Pattern Collisions in Perfect Hashing
IEEE Transactions on Knowledge and Data Engineering
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Simple Minimal Perfect Hashing in Less Space
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Almost random graphs with simple hash functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Provable bounds for portable and flexible privacy-preserving access
Proceedings of the tenth ACM symposium on Access control models and technologies
LZ trie and dictionary compression
Software—Practice & Experience
Optimal table lookup for reserved words in Ada
ACM SIGAda Ada Letters
ACM SIGGRAPH 2006 Papers
Succinct representation of flexible and privacy-preserving access rights
The VLDB Journal — The International Journal on Very Large Data Bases
Perfect hash functions for large dictionaries
Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Tracing interrupts in embedded software
Proceedings of the 2009 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms
Algorithms and theory of computation handbook
Compiler assisted dynamic management of registers for network processors
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the expected longest length probe sequence for hashing with separate chaining
Journal of Discrete Algorithms
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
NEFOS: rapid cache-aware range query processing with probabilistic guarantees
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
SILT: a memory-efficient, high-performance key-value store
SOSP '11 Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles
ISB-tree: a new indexing scheme with efficient expected behaviour
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Cores of random r-partite hypergraphs
Information Processing Letters
Tracing and recording interrupts in embedded software
Journal of Systems Architecture: the EUROMICRO Journal
Practical perfect hashing in nearly optimal space
Information Systems
Simple and space-efficient minimal perfect hash functions
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 48.22 |