A new universal class of hash functions and dynamic hashing in real time

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

Volumn 443 LNCS, Issue , 1990, Pages 6-19

  Dietzfelbinger, Martin ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY;

CONSTANT TIME; DESIRABLE FEATURES; DYNAMIC HASHING; LINEAR SPACES; NUMBER OF DATUM; RANDOM FUNCTIONS; SUBLINEAR TIME; TIME INTERVAL;

HASH FUNCTIONS;

EID: 85031912155     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (17)

1. Aho, H. V., and Lee, D., Storing a dynamic sparse table, Proc. of the 27th IEEE FOCS, 1986, pp. 55–60.
2. Angluin, D., and Valiant, L. G., Fast probabilistic algorithms for Hamiltonian circuits and matchings, J. Comput. Syst. Sci. 18 (1979), 155–193.
3. Brassard, G., and Kannan, S., The generation of random permutations on the fly, IPL 28 (1988) 207–212.
4. Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E., Dynamic perfect hashing: Upper and lower bounds, Proc. of the 29th IEEE FOCS, 1988, pp. 524–531; also: Tech. Report No. 282, Fachbereich Informatik, Universität Dortmund, 1988.
5. Dietzfelbinger, M., and Meyer auf der Heide, F., An optimal parallel dictionary, Proc. of ACM Symp. on Parallel Algorithms and Architectures, 1989, pp. 360–368.
6. Dietzfelbinger, M., Meyer auf der Heide, F., How to distribute a dictionary in a complete network, Proceedings of the 22nd ACM STOC, 1990.
7. Fredman, M. L., Komlós, J., and Szemerédi, E., Storing a sparse table with O(1) worst case access time, J. ACM 31(3), 1984, 538–544.
8. Gil, J., Meyer auf der Heide, F., and Wigderson, A., Not all keys can be hashed in constant time, Proc. of the 22nd ACM STOC, 1990.
9. Hofri, M., Probabilistic Analysis of Algorithms, Springer Verlag, New York, 1987.
10. Karlin, A., and Upfal, E., Parallel hashing — an efficient implementation of shared memory, Proc. of the 18th ACM STOC, 1986, pp. 160–168.
11. Kruskal, C. P., Rudolph, L., and Snir, M., A complexity theory of efficient parallel algorithms, Proc. of 15th ICALP, 1988, pp. 333–346, Springer LNCS 317; also: revised preprint.
12. Lipton, R.J., and Naughton, J.G. Clocked adversaries for hashing, Tech. Rep. CS-TR-203-89, Princeton, 1989.
13. Mehlhorn, K., Data Structures and Algorithms, Vol. 1, 1984, Springer Verlag, Berlin.
14. Mehlhorn, K., and Vishkin, U., Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memory, Acta Informatica 21, 1984, 339–374.
15. Ranade, A. G., How to emulate shared memory, Proc. of the 28th IEEE FOCS, 1987, pp. 185–194.
16. Siegel, A., On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications, Proc. of the 30th IEEE FOCS, 1989, pp. 20–25.
17. Upfal, E., Efficient schemes for parallel communication, J. ACM 31(3), 1984, 507–517.