Jonah Sherman

According to our database, Jonah Sherman authored at least 8 papers between 2009 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

New Techniques for Continuous Optimization and Fast Algorithms for Flow.

Jonah Sherman

PhD thesis, 2017

Area-convexity, l_∞ regularization, and undirected multicommodity flow.

Jonah Sherman

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Generalized Preconditioning and Undirected Minimum-Cost Flow.

Jonah Sherman

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016

Improved bounds for the randomized decision tree Complexity of recursive majority.

Frédéric Magniez, Ashwin Nayak, Miklos Santha, Jonah Sherman, Gábor Tardos, David Xiao

Random Struct. Algorithms, 2016

Generalized Preconditioning and Network Flow Problems.

Jonah Sherman

CoRR, 2016

2013

Nearly Maximum Flows in Nearly Linear Time.

Jonah Sherman

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2009

Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut

Jonah Sherman

CoRR, 2009

Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut.

Jonah Sherman

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009