The following pages link to Michael Langberg (Q692634):
Displaying 18 items.
- \(f\)-sensitivity distance oracles and routing schemes (Q692635) (← links)
- The multi-multiway cut problem (Q884458) (← links)
- Contraction and expansion of convex sets (Q1042459) (← links)
- (Q1603472) (redirect page) (← links)
- A note on approximating Max-Bisection on regular graphs (Q1603473) (← links)
- (Q2753732) (← links)
- Approximation Algorithms for Maximization Problems Arising in Graph Partitioning (Q2775885) (← links)
- A Characterization of the Capacity of Online (causal) Binary Channels (Q2941517) (← links)
- Communication Efficient Secret Sharing (Q2976440) (← links)
- Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes (Q2976709) (← links)
- Coded Cooperative Data Exchange Problem for General Topologies (Q2977246) (← links)
- A Characterization of the Number of Subsequences Obtained via the Deletion Channel (Q2978606) (← links)
- An Equivalence Between Network Coding and Index Coding (Q2978620) (← links)
- H-wise independence (Q2986900) (← links)
- Upper Bounds on the Capacity of Binary Channels With Causal Adversaries (Q2989203) (← links)
- Improved approximation of Max-Cut on graphs of bounded degree (Q3150283) (← links)
- (Q5212563) (← links)
- The RPR2 rounding technique for semidefinite programs (Q5483509) (← links)
