default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJesse Michael Han
Person information
- affiliation: University of Pittsburgh, Department of Mathematics, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c6]Stanislas Polu, Jesse Michael Han, Kunhao Zheng, Mantas Baksys, Igor Babuschkin, Ilya Sutskever:
Formal Mathematics Statement Curriculum Learning. ICLR 2023- 2022
- [c5]Jesse Michael Han, Jason Rute, Yuhuai Wu, Edward W. Ayers, Stanislas Polu:
Proof Artifact Co-Training for Theorem Proving with Language Models. ICLR 2022 - [c4]Kunhao Zheng, Jesse Michael Han, Stanislas Polu:
miniF2F: a cross-system benchmark for formal Olympiad-level mathematics. ICLR 2022 - [i10]Arvind Neelakantan, Tao Xu, Raul Puri, Alec Radford, Jesse Michael Han, Jerry Tworek, Qiming Yuan, Nikolas Tezak, Jong Wook Kim, Chris Hallacy, Johannes Heidecke, Pranav Shyam, Boris Power, Tyna Eloundou Nekoul, Girish Sastry, Gretchen Krueger, David Schnurr, Felipe Petroski Such, Kenny Hsu, Madeleine Thompson, Tabarak Khan, Toki Sherbakov, Joanne Jang, Peter Welinder, Lilian Weng:
Text and Code Embeddings by Contrastive Pre-Training. CoRR abs/2201.10005 (2022) - [i9]Stanislas Polu, Jesse Michael Han, Kunhao Zheng, Mantas Baksys, Igor Babuschkin, Ilya Sutskever:
Formal Mathematics Statement Curriculum Learning. CoRR abs/2202.01344 (2022) - 2021
- [c3]Ryan Krueger
, Jesse Michael Han, Daniel Selsam:
Automatically Building Diagrams for Olympiad Geometry Problems. CADE 2021: 577-588 - [i8]Daniel Selsam, Jesse Michael Han:
k-Equivalence Relations and Associated Algorithms. CoRR abs/2102.04633 (2021) - [i7]Jesse Michael Han, Jason Rute, Yuhuai Wu, Edward W. Ayers, Stanislas Polu:
Proof Artifact Co-training for Theorem Proving with Language Models. CoRR abs/2102.06203 (2021) - [i6]Kunhao Zheng, Jesse Michael Han, Stanislas Polu:
MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics. CoRR abs/2109.00110 (2021) - [i5]Jesse Michael Han, Igor Babuschkin, Harrison Edwards, Arvind Neelakantan, Tao Xu, Stanislas Polu, Alex Ray, Pranav Shyam, Aditya Ramesh, Alec Radford, Ilya Sutskever:
Unsupervised Neural Machine Translation with Generative Language Models Only. CoRR abs/2110.05448 (2021) - 2020
- [c2]Jesse Michael Han, Floris van Doorn:
A formal proof of the independence of the continuum hypothesis. CPP 2020: 353-366 - [i4]Jesse Michael Han:
Enhancing SAT solvers with glue variable predictions. CoRR abs/2007.02559 (2020) - [i3]Ryan Krueger, Jesse Michael Han, Daniel Selsam:
Automatically Building Diagrams for Olympiad Geometry Problems. CoRR abs/2012.02590 (2020) - [i2]Daniel Selsam, Jesse Michael Han, Leonardo de Moura, Patrice Godefroid:
Universal Policies for Software-Defined MDPs. CoRR abs/2012.11401 (2020)
2010 – 2019
- 2019
- [c1]Jesse Michael Han, Floris van Doorn:
A Formalization of Forcing and the Unprovability of the Continuum Hypothesis. ITP 2019: 19:1-19:19 - [i1]Jesse Michael Han, Floris van Doorn:
A formalization of forcing and the unprovability of the continuum hypothesis. CoRR abs/1904.10570 (2019)
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-07-25 20:21 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:
