The Spatial Complexity of Oblivious k-Probe Hash Functions
- 1 October 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (5), 775-786
- https://doi.org/10.1137/0219054
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Collections of Functions for Perfect HashingSIAM Journal on Computing, 1986
- Two results on tablesInformation Processing Letters, 1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984
- Data Structures and Algorithms 1Published by Springer Nature ,1984
- On the program size of perfect and universal hash functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Expected Length of the Longest Probe Sequence in Hash Code SearchingJournal of the ACM, 1981
- An improved program for constructing open hash tablesLecture Notes in Computer Science, 1980
- Efficient Ordering of Hash TablesSIAM Journal on Computing, 1979
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973