default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn H. Conway
Person information
- affiliation: Princeton University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j36]John H. Conway, M. S. Paterson:
A Headache-Causing Problem. Am. Math. Mon. 127(4): 291-296 (2020)
2010 – 2019
- 2015
- [j35]Eugene M. Izhikevich, John H. Conway, Anil Seth:
Game of Life. Scholarpedia 10(6): 1816 (2015) - 2013
- [j34]John H. Conway:
On Unsettleable Arithmetical Problems. Am. Math. Mon. 120(3): 192-198 (2013) - 2010
- [j33]William Cavendish, John H. Conway:
Symmetrically Bordered Surfaces. Am. Math. Mon. 117(7): 571-580 (2010)
2000 – 2009
- 2007
- [j32]John H. Conway, Neil J. A. Sloane:
The optimal isodual lattice quantizer in three dimensions. Adv. Math. Commun. 1(2): 257-260 (2007) - [j31]Henry Cohn, John H. Conway, Noam D. Elkies, Abhinav Kumar:
The D 4 Root System Is Not Universally Optimal. Exp. Math. 16(3): 313-320 (2007) - 2006
- [j30]John H. Conway, Noam D. Elkies, Jeremy L. Martin:
The Mathieu Group M 12 and Its Pseudogroup Extension M 13. Exp. Math. 15(2): 223-236 (2006) - 2001
- [b2]John H. Conway:
On numbers and games, Second Edition. A K Peters 2001, ISBN 978-1-56881-127-7, pp. I-XI, 1-242 - 2000
- [j29]John H. Conway, Charles Radin, Lorenzo Sadun:
Relations in SO (3) Supported by Geodetic Angles. Discret. Comput. Geom. 23(4): 453-463 (2000)
1990 – 1999
- 1999
- [j28]John H. Conway, Charles Radin, Lorenzo Sadun:
On Angles Whose Squared Trigonometric Functions Are Rational. Discret. Comput. Geom. 22(3): 321-332 (1999) - 1998
- [j27]John H. Conway, Alexander Hulpke
, John McKay:
On Transitive Permutation Groups. LMS J. Comput. Math. 1: 1-8 (1998) - 1997
- [j26]John H. Conway, Ronald H. Hardin, Neil J. A. Sloane:
Editors' Note on Packing Lines, Planes, etc.: Packings in Grassmannian Spaces. Exp. Math. 6(2): 175 (1997) - 1996
- [j25]John H. Conway, Ronald H. Hardin, Neil J. A. Sloane:
Packing Lines, Planes, etc.: Packings in Grassmannian Spaces. Exp. Math. 5(2): 139-159 (1996) - 1995
- [j24]John H. Conway, Neil J. A. Sloane:
What are All the Best Sphere Packings n Low Dimensions?. Discret. Comput. Geom. 13: 383-403 (1995) - [j23]Neil J. A. Sloane, Ronald H. Hardin, T. D. S. Duff, John H. Conway:
Minimal-Energy Clusters of Hard Spheres. Discret. Comput. Geom. 14(3): 237-259 (1995) - 1994
- [j22]John H. Conway, Neil J. A. Sloane:
Quaternary Constructions for the Binary Single-Error-Correcting Codes of Julin, Best and Others. Des. Codes Cryptogr. 4(1): 31-42 (1994) - 1993
- [j21]John H. Conway, Neil J. A. Sloane:
Self-Dual Codes over the Integers Modulo 4. J. Comb. Theory A 62(1): 30-45 (1993) - 1992
- [j20]John H. Conway, Neil J. A. Sloane:
On the Covering Multiplicity of Lattices. Discret. Comput. Geom. 8: 109-130 (1992) - [j19]John H. Conway, Vera Pless, Neil J. A. Sloane:
The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration. J. Comb. Theory A 60(2): 183-195 (1992) - 1991
- [c1]John H. Conway:
From Hyperbolic Reflections to Finite Groups. Groups And Computation 1991: 41-51 - 1990
- [j18]John H. Conway, Samuel J. Lomonaco, Neil J. A. Sloane:
A [45, 13] code with minimal distance 16. Discret. Math. 83(2-3): 213-217 (1990) - [j17]John H. Conway:
Integral lexicographic codes. Discret. Math. 83(2-3): 219-235 (1990) - [j16]John H. Conway, Jeffrey C. Lagarias:
Tiling with polyominoes and combinatorial group theory. J. Comb. Theory A 53(2): 183-208 (1990) - [j15]John H. Conway, Neil J. A. Sloane:
Orbit and coset analysis of the Golay and related codes. IEEE Trans. Inf. Theory 36(5): 1038-1050 (1990) - [j14]John H. Conway, Neil J. A. Sloane:
A new upper bound on the minimal distance of self-dual codes. IEEE Trans. Inf. Theory 36(6): 1319-1333 (1990)
1980 – 1989
- 1989
- [j13]John H. Conway, Neil J. A. Sloane, Allan R. Wilks:
Gray codes for reflection groups. Graphs Comb. 5(1): 315-325 (1989) - 1988
- [b1]John H. Conway, Neil J. A. Sloane:
Sphere Packings, Lattices and Groups. Grundlehren der mathematischen Wissenschaften 290, Springer 1988, ISBN 978-1-4757-2018-1, pp. 1-665 - 1986
- [j12]John H. Conway, Neil J. A. Sloane:
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice. IEEE Trans. Inf. Theory 32(1): 41-50 (1986) - [j11]John H. Conway, Neil J. A. Sloane:
Lexicographic codes: Error-correcting codes from game theory. IEEE Trans. Inf. Theory 32(3): 337-348 (1986) - 1985
- [j10]John H. Conway, Neil J. A. Sloane:
A lower bound on the average error of vector quantizers. IEEE Trans. Inf. Theory 31(1): 106-109 (1985) - 1983
- [j9]John H. Conway, Cameron McA. Gordon:
Knots and links in spatial graphs. J. Graph Theory 7(4): 445-453 (1983) - [j8]John H. Conway, Vera Pless:
Monomials of orders 7 and 11 cannot be in the group of a (24, 12, 10) self-dual quaternary code. IEEE Trans. Inf. Theory 29(1): 137-140 (1983) - [j7]John H. Conway, Neil J. A. Sloane:
A fast encoding method for lattice codes and quantizers. IEEE Trans. Inf. Theory 29(6): 820-824 (1983) - 1982
- [j6]John H. Conway, Vera Pless:
On primes dividing the group order of a doubly-even (72, 36, 16) code and the group order of a quaternary (24, 12, 10) code. Discret. Math. 38(2-3): 157-162 (1982) - [j5]John H. Conway, Neil J. A. Sloane:
The Unimodular Lattices of Dimension up to 23 and the Minkowski-Siegel Mass Constants. Eur. J. Comb. 3(3): 219-231 (1982) - [j4]John H. Conway, Neil J. A. Sloane:
Voronoi regions of lattices, second moments of polytopes, and quantization. IEEE Trans. Inf. Theory 28(2): 211-226 (1982) - [j3]John H. Conway, Neil J. A. Sloane:
Fast quantizing and decoding and algorithms for lattice quantizers and codes. IEEE Trans. Inf. Theory 28(2): 227-231 (1982) - 1980
- [j2]John H. Conway, Vera Pless:
On the Enumeration of Self-Dual Codes. J. Comb. Theory A 28(1): 26-53 (1980)
1970 – 1979
- 1979
- [j1]John H. Conway, Vera Pless, Neil J. A. Sloane:
Self-dual codes over GF(3) and GF(4) of length not exceeding 16. IEEE Trans. Inf. Theory 25(3): 312-322 (1979)
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-06-10 21:22 CEST 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:
