default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHenry Cohn
Person information
- affiliation: Microsoft Research
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]Henry Cohn, David de Laat, Nando Leijenhorst:
Optimality of spherical codes via exact semidefinite programming bounds. CoRR abs/2403.16874 (2024)- [i11]Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, Chris Umans:
Finite matrix multiplication algorithms from infinite groups. CoRR abs/2410.14905 (2024) - 2023
- [c8]Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, Chris Umans:
Matrix Multiplication via Matrix Groups. ITCS 2023: 19:1-19:16 - 2022
- [j10]Henry Cohn, Nicholas Triantafillou:
Dual linear programming bounds for sphere packing via modular forms. Math. Comput. 91(333): 491-508 (2022) - [i10]Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, Chris Umans:
Matrix multiplication via matrix groups. CoRR abs/2204.03826 (2022)
2010 – 2019
- 2017
- [j9]Christian Borgs, Jennifer T. Chayes, Henry Cohn, Nina Holden:
Sparse Exchangeable Graphs and Their Limits via Graphon Processes. J. Mach. Learn. Res. 18: 210:1-210:71 (2017) - [i9]Jonah Blasiak, Thomas Church
, Henry Cohn, Joshua A. Grochow, Chris Umans:
Which groups are amenable to proving exponent two for matrix multiplication? CoRR abs/1712.02302 (2017) - 2016
- [i8]Jonah Blasiak, Thomas Church, Henry Cohn, Joshua A. Grochow, Chris Umans:
On cap sets and the group-theoretic approach to matrix multiplication. CoRR abs/1605.06702 (2016) - 2015
- [j8]Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. Adv. Math. Commun. 9(3): 311-339 (2015) - 2014
- [j7]Henry Cohn, Yufei Zhao:
Energy-Minimizing Error-Correcting Codes. IEEE Trans. Inf. Theory 60(12): 7442-7450 (2014) - [c7]Nir Bitansky, Ran Canetti, Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai, Omer Paneth, Alon Rosen:
The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator. CRYPTO (2) 2014: 71-89 - [i7]Henry Cohn, Shafi Goldwasser, Yael Tauman Kalai:
The impossibility of obfuscation with a universal simulator. CoRR abs/1401.0348 (2014) - 2013
- [c6]Henry Cohn, Abhinav Kumar, Christian Reiher, Achill Schürmann:
Formal duality and generalizations of the Poisson summation formula. Discrete Geometry and Algebraic Combinatorics 2013 - [c5]Henry Cohn:
Solving equations with size constraints for the solutions. ISSAC 2013: 1-2 - [c4]Henry Cohn, Christopher Umans:
Fast matrix multiplication using coherent configurations. SODA 2013: 1074-1087 - 2012
- [i6]Douglas N. Arnold, Henry Cohn:
Mathematicians take a stand. CoRR abs/1204.1351 (2012) - [i5]Henry Cohn, Christopher Umans:
Fast matrix multiplication using coherent configurations. CoRR abs/1207.6528 (2012) - [i4]Henry Cohn, Yufei Zhao:
Energy-minimizing error-correcting codes. CoRR abs/1212.1913 (2012) - 2011
- [c3]Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. ICS 2011: 298-308 - [i3]Henry Cohn, Nadia Heninger:
Approximate common divisors via lattices. CoRR abs/1108.2714 (2011) - [i2]Henry Cohn, Nadia Heninger:
Approximate common divisors via lattices. IACR Cryptol. ePrint Arch. 2011: 437 (2011) - 2010
- [i1]Henry Cohn, Nadia Heninger:
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. CoRR abs/1008.1284 (2010)
2000 – 2009
- 2009
- [j6]Brandon Ballinger, Grigoriy Blekherman, Henry Cohn, Noah Giansiracusa, Elizabeth Kelly, Achill Schürmann:
Experimental Study of Energy-Minimizing Point Configurations on Spheres. Exp. Math. 18(3): 257-283 (2009) - 2007
- [j5]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
- [j4]Henry Cohn:
A Short Proof of the Simple Continued Fraction Expansion of. Am. Math. Mon. 113(1): 57-62 (2006) - 2005
- [c2]Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, Christopher Umans:
Group-theoretic Algorithms for Matrix Multiplication. FOCS 2005: 379-388 - 2004
- [j3]Henry Cohn:
Projective Geometry over and the Gaussian Binomial Coefficients. Am. Math. Mon. 111(6): 487-495 (2004) - 2003
- [c1]Henry Cohn, Christopher Umans:
A Group-Theoretic Approach to Fast Matrix Multiplication. FOCS 2003: 438-449 - 2002
- [j2]Henry Cohn, Robin Pemantle, James Gary Propp:
Generating a Random Sink-free Orientation in Quadratic Time. Electron. J. Comb. 9(1) (2002)
1990 – 1999
- 1999
- [j1]Henry Cohn:
2-adic Behavior of Numbers of Domino Tilings. Electron. J. Comb. 6 (1999)
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-12-01 00:16 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:
