| 2002 |
|---|
| 7 | EE | David R. Karger,
Matthew S. Levine:
Random sampling in residual graphs.
STOC 2002: 63-66 |
| 2000 |
|---|
| 6 | EE | Matthew S. Levine:
Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts.
SODA 2000: 735-742 |
| 5 | EE | Matthew S. Levine:
Finding the Right Cutting Planes for the TSP.
ACM Journal of Experimental Algorithmics 5: 6 (2000) |
| 1999 |
|---|
| 4 | EE | Matthew S. Levine:
Finding the Right Cutting Planes for the TSP.
ALENEX 1999: 266-281 |
| 1998 |
|---|
| 3 | EE | David R. Karger,
Matthew S. Levine:
Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching.
STOC 1998: 69-78 |
| 1997 |
|---|
| 2 | | Chandra Chekuri,
Andrew V. Goldberg,
David R. Karger,
Matthew S. Levine,
Clifford Stein:
Experimental Study of Minimum Cut Algorithms.
SODA 1997: 324-333 |
| 1 | EE | David R. Karger,
Eric Lehman,
Frank Thomson Leighton,
Rina Panigrahy,
Matthew S. Levine,
Daniel Lewin:
Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web.
STOC 1997: 654-663 |
