Author:
Lueker George S.,Molodowitch Mariko
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference15 articles.
1. Mikl�s Ajtai, J�nos Koml�s, andEndre Szemer�di: There Is No Fast Single Hashing Algorithm,Information Processing Letters 7 (1978), 270?273.
2. B�la Bollob�s, Andrei Z. Broder andIstvan Simon: The Cost Distribution of Clustering in Random Probing,J. ACM 37 (1990), 224?237.
3. G. H. Gonnet andR. Baeza-Yates:Handbook of Algorithms and Data Structures: In Pascal and C, Second Edition, Addison-Wesley, Wokingham, England, 1991.
4. Wassily Hoeffding: Probability Inequalities for Sums of Bounded Random Variables,J. American Statistical Association 58 (1963), 13?30.
5. Kumar Jog-Dev andS. M. Samuels: Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation,The Annals of Mathematical Statistics 39 (1968), 1191?1195.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Way Linear Probing Revisited;Algorithms;2023-10-28
2. Data deduplication concepts;Data Deduplication Approaches;2021
3. A genetic algorithm for obtaining memory constrained near-perfect hashing;2018 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR);2018-05
4. Balanced allocations and double hashing;Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures;2014-06-21
5. Unique permutation hashing;Theoretical Computer Science;2013-03