He is responsible for Karger's algorithm, a Monte Carlo method to compute the minimum cut of a connected graph.
[4] Karger developed the fastest minimum spanning tree algorithm to date, with Philip Klein and Robert Tarjan.
[5] With Ion Stoica, Robert Morris, Frans Kaashoek, and Hari Balakrishnan, he also developed Chord, one of the four original distributed hash table protocols.
This work has focused on new interfaces and algorithms for helping people sift effectively through large masses of information.
he has been researching retrieval systems that personalize themselves to best fit their individual users' needs and behaviors, leading the Haystack project.