Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Amortized efficiency of list update and paging rules
Communications of the ACM
Amortized analyses of self-organizing sequential search heuristics
Communications of the ACM - Lecture notes in computer science Vol. 174
ACM Computing Surveys (CSUR)
A model for hierarchical memory
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Search in an ordered array having variable probe cost
SIAM Journal on Computing
Last-come-first-served hashing
Journal of Algorithms
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Handbook of algorithms and data structures: in Pascal and C (2nd ed.)
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
Information and Computation
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Performance analysis of linear hashing with partial expansions
ACM Transactions on Database Systems (TODS)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Interpolation search—a log logN search
Communications of the ACM
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
The Analysis of a Hashing Schema by the Diagonal Poisson Transform (Extended Abstract)
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
The Analysis of Linear Probing Hashing with Buckets (Extended Abstract)
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Analysis of coalesced hashing
Virtual hashing: a dynamically changing hashing
VLDB '78 Proceedings of the fourth international conference on Very Large Data Bases - Volume 4
External perfect hashing for very large key sets
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
A general class of resource tradeoffs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On the program size of perfect and universal hash functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A practical minimal perfect hashing method
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
| Hi-index | 0.00 |