John McKay

According to our database, John McKay authored at least 29 papers between 1965 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2017

The Schwarzian equation for completely replicable functions.

Abdelkrim El Basraoui, John McKay

LMS J. Comput. Math., 2017

2013

Modular subgroups, <i>dessins d'enfants</i> and elliptic K3 surfaces.

Yang-Hui He, John McKay, James Read

LMS J. Comput. Math., 2013

2008

Decomposing Replicable Functions.

John McKay, David Sevilla

LMS J. Comput. Math., 2008

2000

Special Issue on Algorithmic Methods in Galois Theory - Foreword of the Guest Editors.

B. Heinrich Matzat, John McKay, Kazuhiro Yokoyama

J. Symb. Comput., 2000

1998

On Transitive Permutation Groups.

John H. Conway, Alexander Hulpke, John McKay

LMS J. Comput. Math., 1998

1997

Computation of Galois groups over function fields.

Thomas Mattman, John McKay

Math. Comput., 1997

Finding Relations Among the Roots of an Irreducible Polynomial.

John McKay, Richard Stauduhar

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Computation of replicable functions on Risa/Asir.

Masayuki Noro, John McKay

Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, 1997

1996

Spontaneous generation of modular invariants.

Harvey Cohn, John McKay

Math. Comput., 1996

Ideal Decompositions and Subfields.

David Casperson, David Ford, John McKay

J. Symb. Comput., 1996

1985

From Polynominals to Galois Groups.

David Ford, John McKay

Proceedings of the EUROCAL '85, 1985

1983

The nonexistence of ovals in a projective plane of order 10.

Clement W. H. Lam, Larry H. Thiel, Stan Swiercz, John McKay

Discret. Math., 1983

1979

Some Remarks on Computing Galois Groups.

John McKay

SIAM J. Comput., 1979

1974

Transitivity Sets [G7] (Algorithm 482).

John McKay, Eric Regener

Commun. ACM, 1974

1973

Arithmetic Overa Finite Field [A1] (Algorithm 469).

Clement Wing Hong Lam, John McKay

Commun. ACM, 1973

1971

Groups and subgroups, presentations and representations.

John McKay

Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, 1971

1970

Computing with finite groups.

J. K. S. McKay

PhD thesis, 1970

Algorithm 391: Unitary symmetric polynomials.

John McKay

Commun. ACM, 1970

Algorithm 371: Partitions in natural order [A1].

J. K. S. McKay

Commun. ACM, 1970

1968

Letters to the editor: on the evalution of multiplicative combinatorial expressions.

J. K. S. McKay

Commun. ACM, 1968

Algorithms: Remark on algorithm 305: Symmetric polynomials.

J. K. S. McKay

Commun. ACM, 1968

Remark on algorithm 307: Symmetric group characters.

J. K. S. McKay

Commun. ACM, 1968

1967

On the representation of symmetric polynomials.

J. K. S. McKay

Commun. ACM, 1967

Algorithms 307: Symmetric group characters.

J. K. S. McKay

Commun. ACM, 1967

Algorithm 313: Multi-dimensional partition generator.

Paul Bratley, J. K. S. McKay

Commun. ACM, 1967

Algorithm 305: symmetric polynomial.

Paul Bratley, J. K. S. McKay

Commun. ACM, 1967

1965

Algorithm 263: Partition generator.

J. K. S. McKay

Commun. ACM, 1965

Algorithm 264: Map of partitions into integers.

J. K. S. McKay

Commun. ACM, 1965

Algorithm 262: Number of restricted partitions of N.

J. K. S. McKay

Commun. ACM, 1965