The following pages link to Devavrat Shah (Q383212):
Displaying 50 items.
- Optimal scaling of average queue sizes in an input-queued switch: an open problem (Q383214) (← links)
- Log-weight scheduling in switched networks (Q383251) (← links)
- (Q473152) (redirect page) (← links)
- Optimal queue-size scaling in switched networks (Q473153) (← links)
- Fluid models of congestion collapse in overloaded switched networks (Q660147) (← links)
- Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse (Q2428046) (← links)
- Randomized scheduling algorithm for queueing networks (Q2428047) (← links)
- Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks (Q2443186) (← links)
- Finding Rumor Sources on Random Trees (Q2830756) (← links)
- Belief Propagation for Min-Cost Network Flow: Convergence and Correctness (Q2917635) (← links)
- (Q2934721) (← links)
- On Queue-Size Scaling for Input-Queued Switches (Q2956539) (← links)
- Caching in Wireless Networks (Q2989743) (← links)
- Statistical inference with probabilistic graphical models (Q2990196) (← links)
- Counting Independent Sets Using the Bethe Approximation (Q3094955) (← links)
- Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem (Q3169045) (← links)
- Gossip Algorithms (Q3400007) (← links)
- (Q3546603) (← links)
- Throughput and Delay in Random Wireless Networks With Restricted Mobility (Q3548095) (← links)
- Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality (Q3604573) (← links)
- Product Multicommodity Flow in Wireless Networks (Q3604576) (← links)
- Fast Distributed Algorithms for Computing Separable Functions (Q3604693) (← links)
- (Q4558163) (← links)
- Feedback-Based Online Network Coding (Q4566517) (← links)
- (Q4633825) (← links)
- Explaining the Success of Nearest Neighbor Methods in Prediction (Q4682659) (← links)
- On Capacity Scaling in Arbitrary Wireless Networks (Q4973963) (← links)
- Message Passing for Maximum Weight Independent Set (Q4974041) (← links)
- A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints (Q4974261) (← links)
- Adaptive Alternating Minimization Algorithms (Q4975783) (← links)
- Distributed Averaging Via Lifted Markov Chains (Q4976076) (← links)
- Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
- Nonasymptotic Analysis of Monte Carlo Tree Search (Q5060499) (← links)
- Revisiting Stochastic Loss Networks: Structures and Approximations (Q5108223) (← links)
- Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model (Q5123817) (← links)
- (Q5136293) (← links)
- Inferring Sparse Preference Lists from Partial Information (Q5141707) (← links)
- Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems (Q5166295) (← links)
- Computing separable functions via gossip (Q5177272) (← links)
- Resource sharing networks: Overview and an open problem (Q5247118) (← links)
- Hardness of Low Delay Network Scheduling (Q5272203) (← links)
- Inferring Rankings Using Constrained Sensing (Q5272233) (← links)
- Rumors in a Network: Who's the Culprit? (Q5273480) (← links)
- Fair Scheduling in Networks Through Packet Election (Q5281025) (← links)
- Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels (Q5281160) (← links)
- Distributed Random Access Algorithm: Scheduling and Congestion Control (Q5281174) (← links)
- Functional Compression Through Graph Coloring (Q5281350) (← links)
- The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks (Q5281493) (← links)
- Learning Graphical Models From the Glauber Dynamics (Q5375563) (← links)
- (Q5417624) (← links)
