A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
暂无分享,去创建一个
[1] Alan Siegel,et al. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications , 1989, 30th Annual Symposium on Foundations of Computer Science.
[2] Alfred V. Aho,et al. Storing a dynamic sparse table , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[3] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[4] Eli Upfal,et al. Parallel hashing: an efficient implementation of shared memory , 1988, JACM.
[5] Sampath Kannan,et al. The Generation of Random Permutations on the Fly , 1988, Inf. Process. Lett..
[6] Friedhelm Meyer auf der Heide,et al. Dynamic perfect hashing: upper and lower bounds , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[7] Larry Rudolph,et al. A Complexity Theory of Efficient Parallel Algorithms , 1990, Theor. Comput. Sci..
[8] Friedhelm Meyer auf der Heide,et al. How to distribute a dictionary in a complete network , 1990, STOC '90.
[9] Abhiram G. Ranade,et al. How to emulate shared memory (Preliminary Version) , 1987, FOCS.
[10] Friedhelm Meyer auf der Heide,et al. An optimal parallel dictionary , 1989, SPAA '89.
[11] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[12] Eli Upfal,et al. Efficient schemes for parallel communication , 1982, PODC '82.
[13] Micha Hofri,et al. Probabilistic Analysis of Algorithms , 1987, Texts and Monographs in Computer Science.
[14] Friedhelm Meyer auf der Heide,et al. Not all keys can be hashed in constant time , 1990, STOC '90.
[15] Alfred V. Aho,et al. Data Structures and Algorithms , 1983 .