QUADRATIC HASH METHOD WHEN THE TABLE SIZE IS NOT A PRIME NUMBER.

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Previous work on quadratic hash methods is limited mainly to the case where the table size is a prime number. Here, certain results are derived for composite numbers. It is shown that all composite numbers containing at least the square of one of the component primes have full-period integer-coefficient quadratic hash functions.

Cite

CITATION STYLE

APA

Batagelj, V. (1975). QUADRATIC HASH METHOD WHEN THE TABLE SIZE IS NOT A PRIME NUMBER. Communications of the ACM, 18(4), 216–217. https://doi.org/10.1145/360715.360737

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free