The following pages link to Amir Salman Avestimehr (Q2799531):
Displaying 42 items.
- Multihop Wireless Networks: A Unified Approach to Relaying and Interference Management (Q2799532) (← links)
- An Approximation Approach to Network Information Theory (Q2809806) (← links)
- Two-Hop Interference Channels: Impact of Linear Schemes (Q2977227) (← links)
- Improving the Thresholds of Sparse Recovery: An Analysis of a Two-Step Reweighted Basis Pursuit Algorithm (Q2977308) (← links)
- Network Compression: Worst Case Analysis (Q2977385) (← links)
- On the Optimality of Treating Interference as Noise (Q2978682) (← links)
- Interference Networks With no CSIT: Impact of Topology (Q2978776) (← links)
- Linear Degrees of Freedom of the MIMO X-Channel With Delayed CSIT (Q2979103) (← links)
- Computing Half-Duplex Schedules in Gaussian Relay Networks via Min-Cut Approximations (Q2983364) (← links)
- Capacity Results for Binary Fading Interference Channels With Delayed CSIT (Q2986093) (← links)
- Degrees of Freedom of Two-Hop Wireless Networks: Everyone Gets the Entire Cake (Q2986362) (← links)
- Linear Degrees of Freedom of the $X$-Channel With Delayed CSIT (Q2986440) (← links)
- Layered Interference Networks With Delayed CSI: DoF Scaling With Distributed Transmitters (Q2986505) (← links)
- Worst-Case Additive Noise in Wireless Networks (Q2989209) (← links)
- Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom (Q2989465) (← links)
- Outage Capacity of the Fading Relay Channel in the Low-SNR Regime (Q3548898) (← links)
- Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory (Q4566512) (← links)
- A Fundamental Tradeoff Between Computation and Communication in Distributed Computing (Q4566621) (← links)
- The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching (Q4566701) (← links)
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models (Q4572911) (← links)
- Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2 (Q4611462) (← links)
- Binary Fading Interference Channel With No CSIT (Q4682970) (← links)
- Fundamental resource trade-offs for encoded distributed optimization (Q5006488) (← links)
- Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding (Q5123827) (← links)
- Coded Computing for Distributed Graph Analytics (Q5138834) (← links)
- A Sampling Theory Perspective of Graph-Based Semi-Supervised Learning (Q5223935) (← links)
- Capacity Region of the Symmetric Injective $K$ -User Deterministic Interference Channel (Q5224051) (← links)
- Coded Computation Over Heterogeneous Clusters (Q5224069) (← links)
- Distributed Solution of Large-Scale Linear Systems via Accelerated Projection-Based Consensus (Q5238935) (← links)
- On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels (Q5271911) (← links)
- Interference Channels With Rate-Limited Feedback (Q5271949) (← links)
- Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network (Q5272025) (← links)
- Cross-Layer Optimization for Wireless Networks With Deterministic Channel Models (Q5272364) (← links)
- Blind Index Coding (Q5280885) (← links)
- On Achieving Local View Capacity Via Maximal Independent Graph Scheduling (Q5280924) (← links)
- Wireless Network Information Flow: A Deterministic Approach (Q5280955) (← links)
- Network Error Correction With Unequal Link Capacities (Q5281104) (← links)
- Diamond Networks With Bursty Traffic: Bounds on the Minimum Energy-Per-Bit (Q5346174) (← links)
- Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms (Q5346233) (← links)
- Approximate Sum-Capacity of the Y-Channel (Q5346386) (← links)
- Fundamental Limits of Non-Coherent Interference Alignment via Matroid Theory (Q5347975) (← links)
- Fundamental Resource Trade-offs for Encoded Distributed Optimization (Q6299812) (← links)
