| 2000 |
| 8 | | Carter Bays,
Richard H. Hudson:
Zeroes of Dirichlet L-functions and irregularities in the distribution of primes.
Math. Comput. 69(230): 861-866 (2000) |
| 7 | | Carter Bays,
Richard H. Hudson:
A new bound for the smallest x with pi(x) > li(x).
Math. Comput. 69(231): 1285-1296 (2000) |
| 1977 |
| 6 | | Carter Bays:
A Comparison of Next-fit, First-fit, and Best-fit.
Commun. ACM 20(3): 191-192 (1977) |
| 1976 |
| 5 | EE | Carter Bays,
S. D. Durham:
Improving a Poor Random Number Generator.
ACM Trans. Math. Softw. 2(1): 59-64 (1976) |
| 4 | | Carter Bays:
A Non-Recursive Technique for Recreating a Digraph from its K-Formula Representation.
Comput. J. 19(4): 326-328 (1976) |
| 1973 |
| 3 | | Carter Bays:
The Reallocation of Hash-Coded Tables.
Commun. ACM 16(1): 11-14 (1973) |
| 2 | | Carter Bays:
A Note on When To Chain Overflow Items Within a Direct-Access Table.
Commun. ACM 16(1): 46-47 (1973) |
| 1 | | Carter Bays:
Some Techniques for Structuring Chained Hash Tables.
Comput. J. 16(2): 126-131 (1973) |