Technical correspondence

Authors:
Diane Crawford
Affiliations:
-
Venue:
Communications of the ACM
Year:
1991

Citing 3
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The linear quotient hash code

Communications of the ACM

Quantified Score

Hi-index	48.22

Visualization

Abstract

I read with interest Peter Pearson's article, “Fast Hashing of Variable-Length Text Strings” (June 1990, pp. 677-680). In it he defines a hash function, given a text C1 … CN, by Exclusive OR'ing the bytes and modifying each intermediate result through a table of 256 randomish bytes.