default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn McKay 0001
Other persons with the same name
- John McKay — disambiguation page
- John McKay 0002
![[0000-0003-3646-2867]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-3646-2867")
— Pennsylvania State University, University Park, PA, USA
2010 – 2019
- 2017
[j24]Abdelkrim El Basraoui, John McKay:
The Schwarzian equation for completely replicable functions. LMS J. Comput. Math. 20(1): 30-52 (2017)- 2013
- [j23]Yang-Hui He, John McKay, James Read:
Modular subgroups, dessins d'enfants and elliptic K3 surfaces. LMS J. Comput. Math. 16: 271-318 (2013)
2000 – 2009
- 2008
- [j22]John McKay, David Sevilla:
Decomposing Replicable Functions. LMS J. Comput. Math. 11: 146-171 (2008) - [i1]John McKay, David Sevilla:
Decomposing replicable functions. CoRR abs/0803.3419 (2008) - 2000
- [j21]B. Heinrich Matzat, John McKay, Kazuhiro Yokoyama:
Special Issue on Algorithmic Methods in Galois Theory - Foreword of the Guest Editors. J. Symb. Comput. 30(6): 631-633 (2000)
1990 – 1999
- 1998
- [j20]John H. Conway, Alexander Hulpke, John McKay:
On Transitive Permutation Groups. LMS J. Comput. Math. 1: 1-8 (1998) - 1997
- [j19]Thomas Mattman, John McKay:
Computation of Galois groups over function fields. Math. Comput. 66(218): 823-831 (1997) - [c4]Masayuki Noro, John McKay:
Computation of replicable functions on Risa/Asir. PASCO 1997: 130-138 - [c3]John McKay, Richard Stauduhar:
Finding Relations Among the Roots of an Irreducible Polynomial. ISSAC 1997: 75-77 - 1996
- [j18]David Casperson, David Ford, John McKay:
Ideal Decompositions and Subfields. J. Symb. Comput. 21(2): 133-137 (1996) - [j17]Harvey Cohn, John McKay:
Spontaneous generation of modular invariants. Math. Comput. 65(215): 1295-1309 (1996)
1980 – 1989
- 1985
- [c2]David Ford, John McKay:
From Polynominals to Galois Groups. European Conference on Computer Algebra (2) 1985: 535-536 - 1983
- [j16]Clement W. H. Lam, Larry H. Thiel, Stan Swiercz, John McKay:
The nonexistence of ovals in a projective plane of order 10. Discret. Math. 45(2-3): 319-321 (1983)
1970 – 1979
- 1979
- [j15]John McKay:
Some Remarks on Computing Galois Groups. SIAM J. Comput. 8(3): 344-347 (1979) - 1974
- [j14]John McKay, Eric Regener:
Transitivity Sets [G7] (Algorithm 482). Commun. ACM 17(8): 470 (1974) - 1973
- [j13]Clement Wing Hong Lam, John McKay:
Arithmetic Overa Finite Field [A1] (Algorithm 469). Commun. ACM 16(11): 699 (1973) - 1971
- [c1]John McKay:
Groups and subgroups, presentations and representations. SYMSAC 1971: 104 - 1970
- [b1]J. K. S. McKay:
Computing with finite groups. University of Edinburgh, UK, 1970 - [j12]J. K. S. McKay:
Algorithm 371: Partitions in natural order [A1]. Commun. ACM 13(1): 52 (1970) - [j11]John McKay:
Algorithm 391: Unitary symmetric polynomials. Commun. ACM 13(8): 512 (1970)
1960 – 1969
- 1968
- [j10]J. K. S. McKay:
Remark on algorithm 307: Symmetric group characters. Commun. ACM 11(1): 14 (1968) - [j9]J. K. S. McKay:
Algorithms: Remark on algorithm 305: Symmetric polynomials. Commun. ACM 11(4): 272 (1968) - [j8]J. K. S. McKay:
Letters to the editor: on the evalution of multiplicative combinatorial expressions. Commun. ACM 11(6): 392 (1968) - 1967
- [j7]J. K. S. McKay:
On the representation of symmetric polynomials. Commun. ACM 10(7): 428-429 (1967) - [j6]Paul Bratley, J. K. S. McKay:
Algorithm 305: symmetric polynomial. Commun. ACM 10(7): 450 (1967) - [j5]J. K. S. McKay:
Algorithms 307: Symmetric group characters. Commun. ACM 10(7): 451-452 (1967) - [j4]Paul Bratley, J. K. S. McKay:
Algorithm 313: Multi-dimensional partition generator. Commun. ACM 10(10): 666 (1967) - 1965
- [j3]J. K. S. McKay:
Algorithm 262: Number of restricted partitions of N. Commun. ACM 8(8): 493 (1965) - [j2]J. K. S. McKay:
Algorithm 264: Map of partitions into integers. Commun. ACM 8(8): 493 (1965) - [j1]J. K. S. McKay:
Algorithm 263: Partition generator. Commun. ACM 8(8): 493 (1965)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
