default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas C. Hales
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2010
[j11]Thomas C. Hales, John Harrison, Sean McLaughlin, Tobias Nipkow
, Steven Obua, Roland Zumkeller:
A Revision of the Proof of the Kepler Conjecture. Discret. Comput. Geom. 44(1): 1-34 (2010)- 2007
- [j10]Thomas C. Hales:
The Jordan Curve Theorem, Formally and Informally. Am. Math. Mon. 114(10): 882-894 (2007) - 2006
- [j9]Thomas C. Hales:
Historical Overview of the Kepler Conjecture. Discret. Comput. Geom. 36(1): 5-20 (2006) - [j8]Thomas C. Hales, Samuel P. Ferguson:
A Formulation of the Kepler Conjecture. Discret. Comput. Geom. 36(1): 21-69 (2006) - [j7]Thomas C. Hales:
Sphere Packing, III. Extremal Cases. Discret. Comput. Geom. 36(1): 71-110 (2006) - [j6]Thomas C. Hales:
Sphere Packing, IV. Detailed Bounds. Discret. Comput. Geom. 36(1): 111-166 (2006) - [j5]Thomas C. Hales:
Sphere Packings, VI. Tame Graphs and Linear Programs. Discret. Comput. Geom. 36(1): 205-265 (2006) - 2001
- [j4]Thomas C. Hales:
The Honeycomb Conjecture. Discret. Comput. Geom. 25(1): 1-22 (2001) - 1997
- [j3]Thomas C. Hales:
Sphere Packings, I. Discret. Comput. Geom. 17(1): 1-51 (1997) - [j2]Thomas C. Hales:
Sphere Packings, II. Discret. Comput. Geom. 18(2): 135-149 (1997) - 1993
- [j1]Thomas C. Hales:
Remarks on the density of sphere packings in three dimensions. Comb. 13(2): 181-197 (1993)
Conference and Workshop Papers
- 2020
- [c10]Thomas C. Hales, Rodrigo Raya:
Formal Proof of the Group Law for Edwards Elliptic Curves. IJCAR (2) 2020: 254-269 - 2013
- [c9]Thomas C. Hales:
External Tools for the Formal Proof of the Kepler Conjecture. PxTP@CADE 2013: 1 - [c8]Alexey Solovyev, Thomas C. Hales:
Formal Verification of Nonlinear Inequalities with Taylor Interval Approximations. NASA Formal Methods 2013: 383-397 - 2011
- [c7]Alexey Solovyev, Thomas C. Hales:
Efficient Formal Verification of Bounds of Linear Programs. Calculemus/MKM 2011: 123-132 - 2010
- [c6]Thomas C. Hales:
Computational Discrete Geometry. ICMS 2010: 1-3 - [c5]Thomas C. Hales:
Linear Programs for the Kepler Conjecture - (Extended Abstract). ICMS 2010: 149-151 - 2007
- [c4]Thomas C. Hales:
Some Methods of Problem Solving in Elementary Geometry. LICS 2007: 35-40 - 2006
- [c3]Thomas C. Hales:
Equidecomposable Quadratic Regions. Automated Deduction in Geometry 2006: 24-38 - 2004
- [c2]Thomas C. Hales:
Formalizing the Proof of the Kepler Conjecture. TPHOLs 2004: 117 - 2001
- [c1]Thomas C. Hales:
Sphere packings and generative. SCG 2001: 69
Parts in Books or Collections
- 2014
- [p1]Thomas C. Hales:
Mathematics in the age of the Turing machine. Turing's Legacy 2014: 253-298
Informal and Other Publications
- 2015
- [i4]Thomas C. Hales, Mark Adams, Gertrud Bauer, Dat Tat Dang, John Harrison, Truong Le Hoang, Cezary Kaliszyk, Victor Magron, Sean McLaughlin, Thang Tat Nguyen, Truong Quang Nguyen, Tobias Nipkow, Steven Obua, Joseph Pleso, Jason M. Rute, Alexey Solovyev, An Hoai Thi Ta, Trung Nam Tran, Diep Thi Trieu, Josef Urban, Ky Khac Vu, Roland Zumkeller:
A formal proof of the Kepler conjecture. CoRR abs/1501.02155 (2015) - 2014
- [i3]Thomas C. Hales:
Developments in Formal Proofs. CoRR abs/1408.6474 (2014) - 2013
- [i2]Alexey Solovyev, Thomas C. Hales:
Formal Verification of Nonlinear Inequalities with Taylor Interval Approximations. CoRR abs/1301.1702 (2013) - 2005
- [i1]Thomas C. Hales:
Introduction to the Flyspeck Project. Mathematics, Algorithms, Proofs 2005
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 2025-01-09 13:11 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:
