Polynomial hash functions are reliable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 623 LNCS, Issue , 1992, Pages 235-246

  Dietzfelbinger, M ^a   Gil, J ^b   Matias, Y ^c,d   Pippenger, N ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^c UNIVERSITY OF MARYLAND   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; AUTOMATA THEORY; POLYNOMIALS;

HIGH PROBABILITY; LINEAR HASH FUNCTION; POSITIVE SIDES; PROGRAM SIZE; RANDOM BITS; REAL TIME; UPPER BOUND;

HASH FUNCTIONS;

EID: 84860839700     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-55719-9_77     Document Type: Conference Paper

References (29)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Alg., 7:567-583, 1986.
2. L. J. Carter and M. N. Wegman. Universal classes of hash functions. JCSS, 18:143-154, 1979.
3. B. Clior and O. Goldreich. On the power of two-point based sampling. J. Complexity, 5:96-106, 1989.
4. M. Dietzfelbinger, A. R. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. Technical Report 70, Universität Paderborn, Gesamthochschule, Jan. 1991. Revised Version of the paper of the same title that appeared in FOCS '88, pp. 524-531.
5. M. Dietzfelbinger and F. Meyer auf der Heide. A new universal class of hash functions and dynamic hashing in real time. In ICALP '90(LNCS 443), pp. 6-19, July 1990.
6. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with 0(1) worst case access time. J. ACM, 31(3):538-544, July 1984.
7. J. Gil and Y. Matias. Fast hashing on a PRAM-designing by expectation. In SODA '91, pp. 271-280, Jan. 1991.
8. J. Gil, Y. Matias, and U. Vishkin. Towards a theory of nearly constant time parallel algorithms. In FOGS '91, pp. 698-710.
9. C. T. M. Jacobs and P. van Emde Boas, Two results on tables. IPL, 22(1):43-48, 1986.
10. A. Joffe. On a set of almost deterministic κ-independent random variables. The Annals of Prob., 2:161-162, 1974.
11. A. R. Karlin and E. Upfal. Parallel hashing-an efficient implementation of shared memory. In STOC '86, pp. 160-168.
12. D. E. Knuth. Sorting and Searching, volume 3 of The Art, of Computer Programming.
13. C. P. Kniskal. L. Rudolph, and M. Snir. A complexity theory of efficient parallel algorithms. TCS, 71:9-5-132, 1990.
14. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Cornput., 15(4):1036-1053, 1986.
15. H. G. Mairson. The program complexity of searching a table. In FOCS '83, pp. 40-75.
16. G. Markowsky, L. J. Carter, and M. N. Wegman. Analysis of a universal class of hash functions. In MFCS '78, pp. 345-354, 1978.
17. K. Mehlhorn. On the program size of perfect and universal hash functions. In FOCS '82, pp. 170-175.
18. K. Mehlhorn. Data Structures and Algorithms. Springer-Verlag, Berlin Heidelberg, 1984.
19. K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories. Acta Inf., 21:339-374, 1984.
20. N. Nisan. Pseudorandom generators for space-bounded computations. In STOC '90, pp. 204-212.
21. M. V. Ramakrishna and P.-A. Larson. File organization using composite perfect hashing. ACM Trans. Database Syst., 14(9):231-263, 1989.
22. A. G. Ranade. How to emulate shared memory. In FOCS '87, pp. 185-194.
23. A, G. Ranade, S. N. Bhatt, and S. L. Johnsson. The fluent abstract machine. In Proc. of the 5th MIT Conference on Advanced Research in VLSI, pp. 71-93, 1988.
24. J, P. Schmidt, and A. Siegel. The spatial complexity of oblivions fc-probe hash functions, SIAM J. Comput., 19(5):775-786, 1990.
25. A. Siegel. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In FOCS '89, pp. 20-25.
26. C. Slot and P. van Emde Boas. On tape versus core; an application of space efficient hash functions to the invariance of space. In STOC '84, pp. 391-400.
27. M. N. Wegman and L. J. Carter. New classes and applications of hash functions. In FOCS '79, pp. 175-182.
28. M. N. Wegman and L. J, Carter, New hash functions and their use in authentication and set equality. JCSS, 22:265-279, 1981.
29. A. C. Yao. Should tables be sorted? J. ACM, 28(3):615-628, July 1981.