[1] |
Knuth, D. E., Sorting and Searching, (The Art of Computer Programming, Vol. 3 (1973), Addison-Wesley: Addison-Wesley Reading, MA) · Zbl 0777.68012 |
[2] |
Sedgewick, R., Algorithms (1983), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0529.68002 |
[3] |
Bell, J. R., The quadratic quotient methods: A hash code eliminating secondary clustering, Comm. ACM, 13, 107-109 (1970) · Zbl 0185.43405 |
[4] |
Morris, R., Scatter storage techniques, Comm. ACM, 11, 38-43 (1968) |
[5] |
Luccio, F., Weighted increment linear search for scatter tables, Comm. ACM, 15, 1045-1047 (1972) |
[6] |
Nishihara, S.; Ikeda, K., Reducing the retrieval time of hashing method by using predictors, Comm. ACM, 26, 1082-1088 (1983) |
[7] |
Mairson, H. G., The program complexity of searching a table, (Proc. IEEE 24th Ann. Symp. on Foundations of Computer Science (1983)), 40-47 |