Jonah Sherman

Learn More
  • Jonah Sherman
  • 2013 IEEE 54th Annual Symposium on Foundations of…
  • 2013
We introduce a new approach to the maximum flow problem in undirected, capacitated graphs using congestion-approximators: easy-to-compute functions that approximate the congestion required to route single-commodity demands in a graph to within some factor α. Our algorithm maintains an arbitrary flow that may have some residual excess and deficits,(More)
  • Jonah Sherman
  • 2009 50th Annual IEEE Symposium on Foundations of…
  • 2009
This paper ties the line of work on algorithms that find an O(√log(n))-approximation to the sparsest cut together with the line of work on algorithms that run in sub-quadratic time by using only single-commodity flows. We present an algorithm that simultaneously achieves both goals, finding an O(√log(n)/epsilon)-approximation using(More)
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the δ-two-sided-error randomized decision tree complexity of (1 − 2δ)(5/2), improving the lower bound of (1 − 2δ)(7/3) given by Jayram et al. (STOC ’03). We also state a conjecture which would further(More)
We consider approximation algorithms for the problem of finding x of minimal norm ‖x‖ satisfying a linear system Ax = b, where the norm ‖ · ‖ is arbitrary and generally non-Euclidean. We show a simple general technique for composing solvers, converting iterative solvers with residual error ‖Ax−b‖ ≤ t−Ω(1) into solvers with residual error exp(−Ω(t)), at the(More)
The minimal number of nested Kleene stars required in a regular expression representing a language provides a simple complexity measure on the regular languages. For restricted regular expressions in which complementation is not allowed, much is known about the measure. In particular, Eggan(1963) showed that for any n, there is a language of star-height(More)