Experimental Study of Minimum Cut Algorithms. - Chandra Chekuri; Andrew V. Goldberg; David R. Karger; Matthew S. Levine; Clifford Stein 001 (SODA, 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 001 (STOC, 1997)

Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching. - David R. Karger; Matthew S. Levine (STOC, 1998)

Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts. - Matthew S. Levine (SODA, 2000)

Finding the Right Cutting Planes for the TSP. - Matthew S. Levine (ACM J. Exp. Algorithmics, 2000)

Random sampling in residual graphs. - David R. Karger; Matthew S. Levine (STOC, 2002)

Algorithms for connectivity problems in undirected graphs: maximum flow and minimun [kappa]-way cut. - Matthew S. Levine (2002)

Fast Augmenting Paths by Random Sampling from Residual Graphs. - David R. Karger; Matthew S. Levine (SIAM J. Comput., 2015)