## Devavrat Shah – All Publications## Book, Book chapter and SurveyD. Shah, Message-passing in stochastic processing networks, D. Shah, Gossip Algorithms, D. Shah, Network scheduling and message-passing, ## Pre-print/SubmittedV. Farias, S. Jagabathula and D. Shah, Sparse Choice Model, D. Shah, J. N. Tsitsiklis and Y. Zhong, Qualitative properties of alpha-fair policies in bandwidth-sharing networks, V. Farias, S. Jagabathula and D. Shah, A Nonparametric Approach to Modeling Choice with Limited Data, ## 2011D. Karger, S. Oh and D. Shah, Iterative learning for reliable crowd-sourcing systems, D. Gamarnik, D. Shah and Y. Wei, Belief propagation for network flow: convergence and correctness, D. Shah, J. Shin and P. Tetali, Medium access using queues, D. Shah and D. Wischik, Fluid models of congestion collapse in overloaded switched networks, D. Shah and J. Shin, Randomized scheduling algorithm for queueing networks, S. Jagabathula and D. Shah, Inferring rankings using
constrained sensing, D. Shah, D. N. C. Tse and J. N. Tsitsiklis, Hardness of Low Delay Network Scheduling, D. Shah and D. Wischik, Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse, D. Shah, J. N. Tsitsiklis and Y. Zhong, Optimal
scaling of average queue sizes in an input-queued switch: an open problem, D. Shah and T. Zaman, Rumors in a network: who's the culprit?, S. Jagabathula and D. Shah, Fair scheduling in networks through packet election, S. Rajagopalan and D. Shah, Distributed averaging in dynamic networks, S. Bodas and D. Shah, Fast averaging, ## 2010L. Jiang, D. Shah, J. Shin and J. Walrand, Distributed Random Access Algorithm: Scheduling and Congestion Control, O. Ayaso, D. Shah and M. Dahleh, Information Theoretic Bounds for Distributed Computation over Networks of Point-to-Point Channels, D. Shah and T. Zaman, Detecting Sources of Viruses in Network: Theory and Application, D. Shah and J. Shin, Dynamics in Congestion Games, D. Shah, J. N. Tsitsiklis and Y. Zhong, Qualitative Properties of alpha weighted scheduling policies, C. Moallemi and D. Shah, On the Flow level dynamics of packet-switched network, V. Doshi, D. Shah, M. Medard and M. Effros, Functional Compression through Graph Coloring, D. Mosk-aoyama, T. Roughgarden and D. Shah, Fully Distributed Algorithms for Convex Optimization Problems, M. Tikekar, M. Qazi, L. Dolecek, D. Shah and A. Chandrakasen, Loop Flattening and Spherical Importance Sampling: A Highly Efficient Model Reduction Techniques For SRAM Yield Analysis, D. Gamarnik, D. Shah and Y. Wei, Belief Propagation for Min-Cost Network Flow: Convergence & Correctness, ## 2009K. Jung, D. Shah and J. Shin, Minimizing the rate of convergence for iterative algorithms, S. Sanghavi, D. Shah and A. Willsky, Message-passing for Max-weight independent set, U. Niesen, P. Gupta and D. Shah, Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks, U. Niesen, P. Gupta and D. Shah, Capacity scaling for
arbitrary wireless networks, K. Jung, P. Kohli, and D. Shah, Local Rules for Global MAP: When Do They Work, V. Farias, S. Jagabathula and D. Shah, A Data Driven Approach to Modeling Choice, S. Jagabathula and D. Shah, Conditions for Recovery of Rankings from Partial Information, D. Shah and T. Zaman, Rumor in a network: Who's the culprit?", S. Rajagopalan, D. Shah and J. Shin, Network adiabatic theorem: an efficient randomized protocol for contention resolution, U. Niesen, D. Shah and G. Wornell, Adaptive alternating minimization algorithm, J. Sundararajan, D. Shah, M. Medard, M. Mitzenmacher and J. Barros, Network coding meets TCP, J. Salez and D. Shah, Belief propagation: optimal algorithm for random assignment problem, S. Sanghavi and D. Shah, Tightness of LP via Max-product Belief Propagation, R. Gummadi, K. Jung, D. Shah and R. Sreenivas, Computing the Capacity Region of a Wireless Network, ## 2008D. Shah and J. N. Tsitsiklis, Bin packing with queues, S. Jagabathula and D. Shah, Inferring popular rankings under constrained sensing, S. Sanghavi, D. Shah and A. Willsky, Message-passing for Max-weight independent set, R. Madan, D. Shah and O. Leveque, Product multi-commodity flow in wireless networks, L. Dolecek, M. Qazi, A. Chandrakasen and D. Shah, Breaking the Simulation Barrier: SRAM Evaluation Through Norm Minimization, O. Ayaso, D. Shah and M. Dahleh, Counting Bits for Distributed Function Computation, J. Sundararajan, D. Shah and M. Medard, ARQ for Network Coding, A. Eryilmaz, A. Ozdaglar, D. Shah and E. Modiano, Cross-Layer Algorithms for the Optimal Control of Multi-hop Wireless Networks, K. Jung, Y. Lu, D. Shah, M. Sharma and M. Squillante, Revisiting stochastic loss networks: structures and algorithms, S. Jagabathula and D. Shah, Optimal delay scheduling in networks with arbitrary constraints, D. Shah and D. Wischik, Lower bound and optimality in switched networks, M. Bayati, D. Shah and M. Sharma, Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality, D. Mosk-aoyama and D. Shah, Fast gossip algorithm for computing separable function, H. Waisanen, D. Shah and M. Dahleh, A Dynamic Pickup and Delivery Problem in Mobile Networks under Information Constraints, S. Jagabathula, V. Doshi and D. Shah, Fair scheduling through packet election, J. Salez and D. Shah, Optimality of belief propagation for random assignment problem, R. Gummadi, K. Jung, D. Shah and R. Sreenivas, Feasible rate allocation in wireless networks, ## 2007K. Jung and D. Shah, Local Approximate Inference Algorithms for Minor Excluded Graphs, M. Bayati, B. Prabhakar, D. Shah and M. Sharma, Iterative Scheduling Algorithms, D. Shah and S. Shakkottai, Oblivious Routing with Mobile Fusion Centers over a Sensor Network, J. Sunderarajan, M. Medard, M. Kim, A. Eryilmaz, D. Shah and R. Koetter, Network coding in a multi-cast switch, J. Mammen and D. Shah, Throughput and
Delay in Random Wireless Networks with Restricted Mobility, D. Mosk-aoyama, T. Roughgarden and D. Shah, Fully Distributed Algorithms for Convex Optimization Problems, V. Doshi, D. Shah and M. Medard, ource Coding with Distortion through Graph Coloring, P. Giaccone, E. Leonardi and D. Shah, Throughput Region in Finite-Buffered Networks, A. Montanari and D. Shah, Counting Good Truth Assignment in Random k-SAT, ## 2006S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, Randomized Gossip Algorithms, A. El Gamal, J. Mammen, B. Prabhakar and D. Shah, Throughput and Delay in wireless networks – Part II: Constant-size packet, A. El Gamal, J. Mammen, B. Prabhakar and D. Shah, Throughput and Delay in wireless networks – Part I: Fluid case, E. Modiano, D. Shah and G. Zussman, Maximizing throughput in wireless networks via Gossip, U. Niesen, U. Erez, D. Shah and G. Wornell, Rate-less Codes for Multi-Access Channels, D. Mosk-Aoyama and D. Shah, Information Dissemination via Network Coding, R. Madan, D. Shah and O. Leveque, Uniform Multi-commodity Flow in Wireless Networks with Gaussian Fading Channels, M. Bayati, D. Shah and M. Sharma, A simple max-product maximum weight matching algorithm and the auction algorithm, D. Mosk-aoyama and D. Shah, Computing separable function via Gossip, D. Shah and D. Wischik, Optimal Scheduling Algorithms for Input-Queued Switches, ## 2005S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, Gossip algorithms: design, analysis and applications, Y. Ganjali, A. Keshavarzian and D. Shah, Cell switching versus packet switching in input queued switches, M. Bayati, D. Shah and M. Sharma, Maximum weight matching via max-product belief propagation, S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, Mixing Times for Random Walks on Geometric Random Graphs, ## 2004J. Mammen and D. Shah, Throughput and delay
in random wireless networks: 1-D mobility is just as good as 2-D, A. El Gamal, J. Mammen, B. Prabhakar and D. Shah, Throughput and delay tradeoff in wireless networks, P. Giaccone, E. Leonardi, B. Prabhakar and D. Shah, Delay bounds for combined input-output queued switches with low speedup, N. Kumar, R. Pan and D. Shah, Fair
scheduling in input-queued switches under inadmissible traffic, ## 2003D. Shah, S. Iyer, B. Prabhakar and N. McKeown, Maintaining Statistics Counters in Router Line Cards, G. Aggarwal, R. Motwani, D. Shah and A. Zhu, Switch scheduling via edge coloring, Y. Ganjali, A. Keshavarzian and D. Shah, Input queued switches: cell switching v/s packet switching, D. Shah, matching is good enough, P. Giaccone, B. Prabhakar and D. Shah, Randomized scheduling algorithms for high-aggregate bandwidth switches, ## 2002M. Mitzenmacher, B. Prabhakar and D. Shah, Balls and Bins with Memory, D. Shah and M. Kopikare, Delay bounds for approximate maximum weight matching algorithms for input-queued switches, P. Giaccone, B. Prabhakar and D. Shah, Towards Simple, High- Performance Schedulers for High-Aggregate Bandwidth Switches, ## 1998-2001D. Shah, Stable algorithms for input-queued switches, D. Shah and P. Gupta, Fast Updating
Algorithms for TCAMs, P. Shenoy, J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa and D. Shah,
Turbo-charging Vertical Mining
of Large Databases, D. Shah, Laks V. S. Lakshmanan, K. Ramamritham and S. Sudarshan, [http:web.mit.edu |