Search the dblp DataBase
Matthew S. Levine: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Matthew S. Levine
Finding the Right Cutting Planes for the TSP. [Citation Graph (0, 0)][DBLP]
ALENEX, 1999, pp:266-281 [Conf] - Chandra Chekuri, Andrew V. Goldberg, David R. Karger, Matthew S. Levine, Clifford Stein
Experimental Study of Minimum Cut Algorithms. [Citation Graph (0, 0)][DBLP]
SODA, 1997, pp:324-333 [Conf] - Matthew S. Levine
Fast randomized algorithms for computing minimum {3, 4, 5, 6}-way cuts. [Citation Graph (0, 0)][DBLP]
SODA, 2000, pp:735-742 [Conf] - David R. Karger, Matthew S. Levine
Random sampling in residual graphs. [Citation Graph (0, 0)][DBLP]
STOC, 2002, pp:63-66 [Conf] - David R. Karger, Matthew S. Levine
Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching. [Citation Graph (0, 0)][DBLP]
STOC, 1998, pp:69-78 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
STOC, 1997, pp:654-663 [Conf] - Matthew S. Levine
Finding the Right Cutting Planes for the TSP. [Citation Graph (0, 0)][DBLP]
ACM Journal of Experimental Algorithms, 2000, v:5, n:, pp:6- [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002