| 2013 | ||
|---|---|---|
| c4 | Henry Cohn, Christopher Umans: Fast matrix multiplication using coherent configurations. SODA 2013: 1074-1087 | |
| 2012 | ||
| i6 | ||
| i5 | Henry Cohn, Christopher Umans: Fast matrix multiplication using coherent configurations. CoRR abs/1207.6528 (2012) | |
| i4 | ||
| 2011 | ||
| c3 | Henry Cohn, Nadia Heninger: Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding. ICS 2011: 298-308 | |
| i3 | ||
| i2 | Henry Cohn, Nadia Heninger: Approximate common divisors via lattices. IACR Cryptology ePrint Archive 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) | |
| 2009 | ||
| j6 | Brandon Ballinger, Grigoriy Blekherman, Henry Cohn, Noah Giansiracusa, Elizabeth Kelly, Achill Schürmann: Experimental Study of Energy-Minimizing Point Configurations on Spheres. Experimental Mathematics 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. Experimental Mathematics 16(3): 313-320 (2007) | |
| 2006 | ||
| j4 | Henry Cohn: A Short Proof of the Simple Continued Fraction Expansion of. The American Mathematical Monthly 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. The American Mathematical Monthly 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. Electr. J. Comb. 9(1) (2002) | |
| 1999 | ||
| j1 | ||
Colors in the list of coauthors
Last update Thu May 23 05:49:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page