Matthew S. Levine

According to our database, Matthew S. Levine authored at least 8 papers between 1997 and 2015.

Collaborative distances:

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

2015

Fast Augmenting Paths by Random Sampling from Residual Graphs.

David R. Karger, Matthew S. Levine

SIAM J. Comput., 2015

2002

Algorithms for connectivity problems in undirected graphs: maximum flow and minimun [kappa]-way cut.

Matthew S. Levine

PhD thesis, 2002

Random sampling in residual graphs.

David R. Karger, Matthew S. Levine

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2000

Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts.

Matthew S. Levine

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Finding the Right Cutting Planes for the TSP.

Matthew S. Levine

Proceedings of the Algorithm Engineering and Experimentation, 1999

1998

Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching.

David R. Karger, Matthew S. Levine

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.

David R. Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S. Levine, Daniel Lewin

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

Experimental Study of Minimum Cut Algorithms.

Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein

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