The following pages link to David R. Karger (Q598250):
Displaying 50 items.
- (Q290194) (redirect page) (← links)
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs (Q290195) (← links)
- Decoding turbo-like codes via linear programming (Q598251) (← links)
- On approximating the longest path in a graph (Q679451) (← links)
- Simple efficient load-balancing algorithms for peer-to-peer systems (Q863188) (← links)
- Subjective-cost policy routing (Q883998) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- (De)randomized construction of small sample spaces in \(\mathcal{NC}\) (Q1384529) (← links)
- (Q2721962) (← links)
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (Q2753004) (← links)
- Random Sampling in Cut, Flow, and Network Design Problems (Q2757600) (← links)
- (Q2768324) (← links)
- (Q2768351) (← links)
- Derandomization through approximation (Q2817641) (← links)
- Random sampling in cut, flow, and network design problems (Q2817658) (← links)
- Rounding algorithms for a geometric embedding of minimum multiway cut (Q2819596) (← links)
- (Q2921704) (← links)
- (Q2934716) (← links)
- Faster information dissemination in dynamic networks via network coding (Q2943412) (← links)
- (Q3128903) (← links)
- (Q3140397) (← links)
- Using Linear Programming to Decode Binary Linear Codes (Q3546868) (← links)
- Minimum-Cost Multicast over Coded Packet Networks (Q3547302) (← links)
- Random sampling in residual graphs (Q3579176) (← links)
- Finding nearest neighbors in growth-restricted metrics (Q3579253) (← links)
- (Q3579391) (← links)
- The complexity of matrix completion (Q3581565) (← links)
- Byzantine Modification Detection in Multicast Networks With Random Network Coding (Q3604604) (← links)
- Approximate graph coloring by semidefinite programming (Q3841651) (← links)
- (Q4228453) (← links)
- (Q4228454) (← links)
- Fast Connected Components Algorithms for the EREW PRAM (Q4229421) (← links)
- (Q4234046) (← links)
- (Q4234047) (← links)
- (Q4234075) (← links)
- (Q4250161) (← links)
- (Q4250217) (← links)
- (Q4250218) (← links)
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem (Q4268894) (← links)
- Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths (Q4277537) (← links)
- (Q4335203) (← links)
- An $\NC$ Algorithm for Minimum Cuts (Q4337444) (← links)
- A randomized linear-time algorithm to find minimum spanning trees (Q4369866) (← links)
- A new approach to the minimum cut problem (Q4371680) (← links)
- (Q4398367) (← links)
- Augmenting Undirected Edge Connectivity in Õ(n2) Time (Q4512571) (← links)
- (Q4526987) (← links)
- (Q4527033) (← links)
- (Q4542522) (← links)
