Not all keys can be hashed in constant time
暂无分享,去创建一个
[1] 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.
[2] Kurt Mehlhorn,et al. Data Structures and Algorithms 1: Sorting and Searching , 2011, EATCS Monographs on Theoretical Computer Science.
[3] Friedhelm Meyer auf der Heide,et al. How to distribute a dictionary in a complete network , 1990, STOC '90.
[4] Eli Upfal,et al. Parallel hashing: an efficient implementation of shared memory , 1988, JACM.
[5] Andrew Chi-Chih Yao,et al. Should Tables Be Sorted? , 1981, JACM.
[6] Michael Sipser,et al. A complexity theoretic approach to randomness , 1983, STOC.
[7] Friedhelm Meyer auf der Heide,et al. A New Universal Class of Hash Functions and Dynamic Hashing in Real Time , 1990, ICALP.
[8] Journal of the Association for Computing Machinery , 1961, Nature.
[9] 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).