ACM

Communications of the ACM

Home/Magazine Archive/April 1975 (Vol. 18, No. 4)/The quadratic hash method when the table size is not.../Abstract

The quadratic hash method when the table size is not a prime number

By Vladimir Batagelj
Communications of the ACM, April 1975, Vol. 18 No. 4, Pages 216-217
10.1145/360715.360737
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.