Jonah Sherman

I'm a first second-year PhD student at Berkeley, in the theory group. I'm interested in algorithms and complexity theory. I graduated from Carnegie Mellon with a BS in Computer Science and Discrete Math/Logic. More to be added to this page eventually.


Breaking the Multicommodity Flow Barrier for √log(n)-Approximations to Sparsest Cut (FOCS 2009 Best Student Paper Award)