David R. Karger

Massachusetts Inst. Tech., Lab. for Computer Science
http://theory.lcs.mit.edu/~karger/
karger@lcs.mit.edu

Author, editor, or reviewer of:

• An experimental study of polylogarithmic fully-dynamic connectivity algorithms
• Dynamic graph algorithms with applications
• Random sampling in cut, flow, and network design problems
• Random Sampling in Graph Optimization Problems
• Using randomized sparsification to approximate minimum cuts