Sherman, Jonah

1. Nearly Maximum Flows in Nearly Linear Time
   2013/04/07 by Jonah Sherman, Sherman, Jonah · 9 citations
   Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Markov Chains and Monte Carlo Methods #Stochastic Gradient Optimization Techniques #cs.DS
2. Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut
   2009/08/10 by Jonah Sherman, Sherman, Jonah · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #cs.DS