W. H. Payne
W. H. Payne

homepage
bpayne37atcomcast.net

  Affiliation history
Bibliometrics: publication history
Average citations per article8.89
Citation Count80
Publication count9
Publication years1969-1990
Available for download8
Average downloads per article818.00
Downloads (cumulative)6,544
Downloads (12 Months)195
Downloads (6 Weeks)17
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


9 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 9 of 9
Sort by:

1
September 1990
Bibliometrics:
Citation Count: 1


2 published by ACM
June 1979 ACM Transactions on Mathematical Software (TOMS): Volume 5 Issue 2, June 1979
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 10,   Downloads (12 Months): 116,   Downloads (Overall): 2,305

Full text available: PDFPDF

3 published by ACM
April 1978 Communications of the ACM: Volume 21 Issue 4, April 1978
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 361

Full text available: PDFPDF
Nonsingular binary matrices of order N , i.e., nonsingular over the field {0, 1}, and an initial segment of the natural numbers are placed in one-to-one correspondence. Each natural number corresponds to two intermediate vectors. These vectors are mapped into a nonsingular binary matrix. Examples of complete enumeration of all ...
Keywords: binary matrices, combinatorics, random numbers, combinations, nonsingular matrices, pseudorandom numbers, Vernam, encryption, feedback shift register sequences

4 published by ACM
December 1977 ACM Transactions on Mathematical Software (TOMS): Volume 3 Issue 4, Dec. 1977
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 0,   Downloads (12 Months): 1,   Downloads (Overall): 489

Full text available: PDFPDF

5 published by ACM
April 1974 Communications of the ACM: Volume 17 Issue 4, April 1974
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 3,   Downloads (Overall): 176

Full text available: PDFPDF
Keywords: Ph.D. production, accreditation, graduate education

6 published by ACM
July 1973 Journal of the ACM (JACM): Volume 20 Issue 3, July 1973
Publisher: ACM
Bibliometrics:
Citation Count: 44
Downloads (6 Weeks): 3,   Downloads (12 Months): 42,   Downloads (Overall): 1,914

Full text available: PDFPDF
The generalized feedback shift register pseudorandom number algorithm has several advantages over all other pseudorandom number generators. These advantages are: (1) it produces multidimensional pseudorandom numbers; (2) it has an arbitrarily long period independent of the word size of the computer on which it is implemented; (3) it is faster ...

7 published by ACM
March 1973 Communications of the ACM: Volume 16 Issue 3, March 1973
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 0,   Downloads (12 Months): 5,   Downloads (Overall): 198

Full text available: PDFPDF
[Two years ago the author was elected by the Washington State University faculty to a three-year term as a faculty representative to a Graduate Studies Committee charged “to examine and evaluate proposed changes in the policy of the Graduate School.” After his experiences and considerable study, the author says he ...
Keywords: Ph.D., accreditation, graduate education, production

8 published by ACM
January 1970 Communications of the ACM: Volume 13 Issue 1, Jan. 1970
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Downloads (Overall): 275

Full text available: PDFPDF
Intermediate computations in an “Extremely Portable Random Number Generator” by J. B. Kruskal [ Comm. ACM 12 , 2 (Feb. 1969), 93-94] exceed 15 bits plus sign. This is a severe limitation since the majority of small computers uses a 16 bit (15 bits plus sign) word or less. ASA ...
Keywords: pseudorandom numbers, shift register sequences, random numbers

9 published by ACM
February 1969 Communications of the ACM: Volume 12 Issue 2, Feb. 1969
Publisher: ACM
Bibliometrics:
Citation Count: 26
Downloads (6 Weeks): 2,   Downloads (12 Months): 20,   Downloads (Overall): 826

Full text available: PDFPDF
An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random number generator modulo 2 ** 31 - 1, a prime Mersenne number which produces 2 ** 31 - 2 numbers, on a p -bit (greater than 31) computer. The computation method is extendible to limited problems ...
Keywords: modular arithmetic, primitive roots, random number, uniform frequency function, prime factorization, pseudo-random number, simulation, uniform probability density



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us