Universal classes of hash functions
- 1 April 1979
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 18 (2), 143-154
- https://doi.org/10.1016/0022-0000(79)90044-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- Analysis of a universal class of hash functionsLecture Notes in Computer Science, 1978
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Hashing LEMMAs on time complexities with applications to formula manipulationPublished by Association for Computing Machinery (ACM) ,1976
- Arithmetic complexity of unordered sparse polynomialsPublished by Association for Computing Machinery (ACM) ,1976
- Multifont OCR Postprocessing SystemIBM Journal of Research and Development, 1975
- Computational complexity of probabilistic Turing machinesPublished by Association for Computing Machinery (ACM) ,1974