Authors: Karger, DR

Citation: Dr. Karger, A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem, SIAM REV, 43(3), 2001, pp. 499-522

Authors: Karger, DR

Citation: Dr. Karger, Minimum cuts in near-linear time, J ACM, 47(1), 2000, pp. 46-76

Authors: Benczur, AA Karger, DR

Citation: Aa. Benczur et Dr. Karger, Augmenting undirected edge connectivity in O(n(2)) time, J ALGORITHM, 37(1), 2000, pp. 2-36

Authors: Karger, DR

Citation: Dr. Karger, Random sampling in cut, flow, and network design problems, MATH OPER R, 24(2), 1999, pp. 383-413

Authors: Karger, DR

Citation: Dr. Karger, A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem, SIAM J COMP, 29(2), 1999, pp. 492-514

Authors: Karger, DR Nisan, N Parnas, M

Citation: Dr. Karger et al., Fast connected components algorithms for the EREW PRAM, SIAM J COMP, 28(3), 1999, pp. 1021-1034