Algorithm 262: Number of restricted partitions of N. - J. K. S. McKay (Commun. ACM, 1965)

Algorithm 264: Map of partitions into integers. - J. K. S. McKay (Commun. ACM, 1965)

Algorithm 263: Partition generator. - J. K. S. McKay (Commun. ACM, 1965)

Algorithm 305: symmetric polynomial. - Paul Bratley; J. K. S. McKay (Commun. ACM, 1967)

Algorithm 313: Multi-dimensional partition generator. - Paul Bratley; J. K. S. McKay (Commun. ACM, 1967)

Algorithms 307: Symmetric group characters. - J. K. S. McKay (Commun. ACM, 1967)

On the representation of symmetric polynomials. - J. K. S. McKay (Commun. ACM, 1967)

Remark on algorithm 307: Symmetric group characters. - J. K. S. McKay (Commun. ACM, 1968)

Algorithms: Remark on algorithm 305: Symmetric polynomials. - J. K. S. McKay (Commun. ACM, 1968)

Letters to the editor: on the evalution of multiplicative combinatorial expressions. - J. K. S. McKay (Commun. ACM, 1968)

Algorithm 371: Partitions in natural order [A1]. - J. K. S. McKay (Commun. ACM, 1970)

Algorithm 391: Unitary symmetric polynomials. - John McKay 001 (Commun. ACM, 1970)

Computing with finite groups. - J. K. S. McKay (1970)

Groups and subgroups, presentations and representations. - John McKay 001 (SYMSAC, 1971)

Arithmetic Overa Finite Field [A1] (Algorithm 469). - Clement Wing Hong Lam; John McKay 001 (Commun. ACM, 1973)

Transitivity Sets [G7] (Algorithm 482). - John McKay 001; Eric Regener (Commun. ACM, 1974)

Some Remarks on Computing Galois Groups. - John McKay 001 (SIAM J. Comput., 1979)

The nonexistence of ovals in a projective plane of order 10. - Clement W. H. Lam; Larry H. Thiel; Stan Swiercz; John McKay 001 (Discret. Math., 1983)

From Polynominals to Galois Groups. - David Ford 001; John McKay 001 (European Conference on Computer Algebra (2), 1985)

Ideal Decompositions and Subfields. - David Casperson; David Ford 001; John McKay 001 (J. Symb. Comput., 1996)

Spontaneous generation of modular invariants. - Harvey Cohn; John McKay 001 (Math. Comput., 1996)

Computation of replicable functions on Risa/Asir. - Masayuki Noro; John McKay 001 (PASCO, 1997)

Finding Relations Among the Roots of an Irreducible Polynomial. - John McKay 001; Richard Stauduhar (ISSAC, 1997)

Computation of Galois groups over function fields. - Thomas Mattman; John McKay 001 (Math. Comput., 1997)

On Transitive Permutation Groups. - John H. Conway; Alexander Hulpke; John McKay 001 (LMS J. Comput. Math., 1998)

Special Issue on Algorithmic Methods in Galois Theory - Foreword of the Guest Editors. - B. Heinrich Matzat; John McKay 001; Kazuhiro Yokoyama (J. Symb. Comput., 2000)

Decomposing Replicable Functions. - John McKay 001; David Sevilla (LMS J. Comput. Math., 2008)

Modular subgroups, dessins d'enfants and elliptic K3 surfaces. - Yang-Hui He; John McKay 001; James Read (LMS J. Comput. Math., 2013)

The Schwarzian equation for completely replicable functions. - Abdelkrim El Basraoui; John McKay 001 (LMS J. Comput. Math., 2017)