Location Cambridge, Massachusetts, United States Regions Greater Boston Area, East Coast, New England Gender Male
LinkedIn View on LinkedIn
David Karger is a professor of computer science and a member of the Computer Science and Artificial Intelligence Laboratory (CSAIL) at the Massachusetts Institute of Technology.
He is responsible for Karger's algorithm, a Monte Carlo method to compute the minimum cut of a connected graph. Karger developed the fastest minimum spanning tree
algorithm to date with Philip Klein, and Robert Tarjan. With Ion Stoica, Robert Morris, Frans Kaashoek, and Hari Balakrishnan, he also developed Chord, one of the four original distributed hash table protocols.
