1.4k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Microsoft (United States)US40 papers
- Massachusetts Institute of TechnologyUS32 papers
- Microsoft Research (United Kingdom)GB18 papers
- Harvard UniversityUS11 papers
- Cornell UniversityUS10 papers
- University of PennsylvaniaUS10 papers
- Princeton UniversityUS8 papers
- Stanford UniversityUS8 papers
- University of WashingtonUS8 papers
- Hebrew University of JerusalemIL7 papers
- Carnegie Mellon UniversityUS6 papers
- Rutgers, The State University of New JerseyUS6 papers
5 papers · 1 filter
Phase transitions of extremal cuts for the configuration model
Souvik Dhara, Debankur Mukherjee, Subhabrata Sen
The -section width and the Max-Cut for the configuration model are shown to exhibit phase transitions according to the values of certain parameters of the asymptotic degree dist…
On cap sets and the group-theoretic approach to matrix multiplication
Jonah Blasiak, Thomas Church, Henry Cohn +4
In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent of matrix multiplication by reducing matrix multiplication to group algebra multiplicatio…
Energy-minimizing error-correcting codes
Henry Cohn, Yufei Zhao
We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potent…
Left and right convergence of graphs with bounded degree
Christian Borgs, Jennifer Chayes, Jeff Kahn +1
The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorph…
Moments of Two-Variable Functions and the Uniqueness of Graph Limits
Christian Borgs, Jennifer Chayes, Laszlo Lovasz
For a symmetric bounded measurable function W on [0,1]^2, "moments" of W can be defined as values t(F,W) indexed by simple graphs. We prove that every such function is determined b…