1978
DOI: 10.2307/2347180
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm AS 131: Tabulating Frequency Distributions for Variables with Structured Code Sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

1989
1989
1992
1992

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 3 publications
(2 reference statements)
0
2
0
Order By: Relevance
“…The following changes to the THA function given by Chou (1985) in remark AS R55 are suggested. University of Liverpool, UK [Received December 1988] In algorithm AS 131 (Leathers, 1978) the hash function consists of a pseudorandom number generator using the key as seed. The description stresses the need to choose a multiplier and constant on the basis of the machine word length but does not point out that integer overflow will occur.…”
Section: Methodsmentioning
confidence: 99%
“…The following changes to the THA function given by Chou (1985) in remark AS R55 are suggested. University of Liverpool, UK [Received December 1988] In algorithm AS 131 (Leathers, 1978) the hash function consists of a pseudorandom number generator using the key as seed. The description stresses the need to choose a multiplier and constant on the basis of the machine word length but does not point out that integer overflow will occur.…”
Section: Methodsmentioning
confidence: 99%
“…In algorithm AS 131 (Leathers, 1978) the hash function consists of a pseudorandom number generator using the key as seed. The description stresses the need to choose a multiplier and constant on the basis of the machine word length but does not point out that integer overflow will occur.…”
mentioning
confidence: 99%