The following pages link to Michael Langberg (Q692634):
Displaying 50 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)
- (Q3547208) (← links)
- f-Sensitivity Distance Oracles and Routing Schemes (Q3586453) (← links)
- Approximation Algorithms for Graph Homomorphism Problems (Q3595371) (← links)
- Oblivious Communication Channels and Their Capacity (Q3604442) (← links)
- Resilient Network Coding in the Presence of Byzantine Adversaries (Q3604533) (← links)
- Optimal Universal Schedules for Discrete Broadcast (Q3604826) (← links)
- (Q4535020) (← links)
- Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel (Q4566595) (← links)
- Tight Network Topology Dependent Bounds on Rounds of Communication (Q4575916) (← links)
- Constructing cospectral graphs via a new form of graph product (Q4580053) (← links)
- Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers (Q4651517) (← links)
- The Birthday Problem and Zero-Error List Codes (Q4958266) (← links)
- Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases (Q4958273) (← links)
- Network Coding: A Computational Perspective (Q4975683) (← links)
- Latency and Alphabet Size in the Context of Multicast Network Coding (Q5088554) (← links)
- Reduced-Rank L1-Norm Principal-Component Analysis With Performance Guarantees (Q5103284) (← links)
- Fault-tolerant spanners for general graphs (Q5172738) (← links)
- Sufficiently Myopic Adversaries Are Blind (Q5211400) (← links)
- The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding (Q5211641) (← links)
- (Q5212563) (← links)
- The Capacity of Online (Causal) $q$ -Ary Error-Erasure Channels (Q5224005) (← links)
- Constant-Weight Gray Codes for Local Rank Modulation (Q5272244) (← links)
- On the Hardness of Approximating the Network Coding Capacity (Q5281090) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313043) (← links)
- Algorithm Theory - SWAT 2004 (Q5315379) (← links)
- Generalized Gray Codes for Local Rank Modulation (Q5346314) (← links)
- Trajectory Codes for Flash Memory (Q5346472) (← links)
- The Unbounded Benefit of Encoder Cooperation for the k-User MAC (Q5375541) (← links)
- Can Negligible Rate Increase Network Reliability? (Q5375575) (← links)
- Single-Unicast Secure Network Coding and Network Error Correction are as Hard as Multiple-Unicast Network Coding (Q5375591) (← links)
- Fault Tolerant Spanners for General Graphs (Q5390599) (← links)
- Distributed broadcasting and mapping protocols in directed anonymous networks (Q5401476) (← links)
- (Q5417651) (← links)
- A unified framework for approximating and clustering data (Q5419127) (← links)
