description David Karger Overview
David Karger is an American computer scientist at MIT known for his work in algorithms and graph theory. He developed Karger's algorithm for finding minimum cuts in graphs, a randomized approach that has become a standard topic in algorithm design courses. His research also includes contributions to network algorithms, data structures, and information retrieval.
insights Ranking position
David Karger ranks #104 of 185 in the Computer Scientist ranking, behind Prabhakar Raghavan, ahead of Irit Dinur.
help David Karger FAQ
What is Karger's algorithm in computer science?
Karger's algorithm is a famous randomized algorithm used to find the global minimum cut in a connected, undirected graph. The technique works by randomly contracting edges until only two vertices remain, defining the cut.
Where does David Karger teach?
David Karger is a long-time professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT). He is affiliated with the MIT Computer Science and Artificial Intelligence Laboratory (CSAIL).
Has David Karger won any major awards for his research?
Yes, he has been named an ACM Fellow for his profound contributions to network algorithm design and combinatorial optimization. His work on randomized algorithms is heavily cited across theoretical computer science literature.
What other algorithms is David Karger known for?
Beyond graph cuts, he has made significant contributions to the design of algorithms for information retrieval and peer-to-peer systems. He has also researched human-computer interaction to improve the usability of complex data structures.
explore Explore More
Reviews & Comments
Write a Review
Be the first to review
Share your thoughts with the community and help others make better decisions.
