### Publications

#### 2018

Monotone Matrix Estimation via Robust Deconvolution, by D. Shah and D. Song, arXiv preprint arXiv:1803.03469, 2018 (link).

Time Series Analysis via Matrix Estimation, by A. Agarwal, M. Amjad, D. Shah and D. Shen, arXiv preprin arXiv:1802.09064, 2018 (link).

Q-learning with Nearest Neighbors, by D. Shah and Q. Xie, arXiv preprint arXiv:1802.03900, 2018 (link).

Reducing Crowdsourcing to Graphon Estimation, Statistically, by D. Shah and C. Lee Yu, Proceedings of AISTAT, 2018 (link).

Robust Synthetic Control, by M. Amjad, D. Shah and D. Shen, arXiv preprint ArXiv:1711.06940, 2018 (link).

Leaders, Followers and Community Detection, by D. Parthasarthy, D. Shah and T. Zaman, preprint, 2018 (link).

Partition-Merge: Distributed Inference and Modularity Optimization, by V. Blondel, K. Jung, P. Kohli, D. Shah and S. Won, under review (submitted to JMLR 2013) (link).

#### 2017

Censored Demand Estimation In Retail, by M. Amjad and D. Shah, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 1(2): 31, 2017 (link).

Thy Friend Is My Friend: Iterative Collaborative Filtering For Sparse Matrix Estimation, by C. Borgs, J. Chayes, C. E. Lee, and D. Shah, Advances in Neural Information Processing Systems 30, Curran Associates, Inc.: 4715—4726, 2017 (link).

Feedback-Based Online Network Coding, by J. K. Sundararajan, D. Shah, M. Médard, P. Sadeghi, IEEE Transactions on Information Theory, Volume 63, no. 10, pp. 6628-6649, October 2017 (link).

Centralized Congestion Control and Scheduling in a Datacenter, by D. Shah, Q. Xie, arXiv preprint arXiv:1710.02548, 2017 (link).

Learning graphical models from the Glauber dynamics, by G Bresler, D Gamarnik, D Shah, IEEE Transactions on Information Theory, 2017 (link).

Blind Regression via Nearest Neighbors under Latent Variable Models, by C. E. Lee, Y Li, D Shah, D Song, arXiv preprint arXiv:1705.04867 (link).

Flowtune: Flowlet Control for Datacenter Networks, by J. Perry, H. Balakrishnan, D. Shah, 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 421-435 (link).

Optimal Resource Consumption with an Application to Cloud Computing via Data-Driven Prophet Inequalities, by M.J. Amjad, V.F. Farias, A.A. Li, D. Shah, Preprint, 2017 (link).

Building Optimized and Hyperlocal Product Assortments: A Nonparametric Choice Approach, by V.F. Farias, S. Jagabathula, D. Shah, Preprint, 2017 (link).

#### 2016

Finding rumor sources on random trees, by D. Shah, T. Zaman, Operations Research, Volume 64, No. 3, pp. 736 – 755, 2016 (link).

Rank Centrality: Ranking from Pairwise comparisons, by S. Negahban., S. Oh, D. Shah, Operations Research, Volume 65, No. 1, pp. 266-287, 2016 (link).

On queue-size scaling for input-queued switches, by D. Shah, J. N. Tsitsiklis and Y. Zhong, Stochastic Systems, Volume 6, No.1, pp. 1-25, 2016 (link).

Trading Bitcoins and Online Time Series Prediction, by D. Shah, M. Amjad, NIPS 2016 Time Series Workshop, Proceedings JMLR, pp. 1 -15 (link).

Blind regression: Nonparametric regression for latent variable models via collaborative filtering, by D. Song, C.E. Lee, Y. Li, D. Shah, Advances in Neural Information Processing Systems, pp. 2155-2163 (link).

Collaborative filtering with low regret, by G. Bresler, D. Shah, L.F. Voloch, Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science, pp. 207-220 (link).

#### 2015

A Latent Source Model for Patch-Based Image Segmentation, by G.H. Chen, D. Shah, P. Golland, International Conference on Medical Image Computing and Computer-Assisted Intervention, pp. 140-148 (link).

Fastpass: A centralized zero-queue datacenter network, by J. Perry, A. Ousterhout, H. Balakrishnan, D. Shah, ACM SIGCOMM Computer Communication Review – SIGCOMM’14, Volume 44 Issue 4, pp. 307-318 (link).

#### 2014

Optimal queue-size scaling in switched networks, by Shah D., N. S. Walton and Y. Zhong, The Annals of Applied Probability, Volume 24, No. 6, pp. 2207-2245, 2014 (link).

Qualitative properties of alpha-fair policies in bandwidth-sharing networks, by D. Shah, J. N. Tsitsikli, Y. Zhong, The Annals of Applied Probability, Volume 24, No. 1, pp. 76-113, 2014 (link).

Budget-optimal task allocation for reliable crowdsourcing systems, by Karger D., S. Oh and D. Shah, Operations Research, Volume 62, No. 1, pp. 1-24, 2014 (link).

Resource sharing networks: overview and an open problem, by M. Harrison, C. Mandayam, D. Shah, Y. Yang, Stochastic Systems, Volume 4, No. 2, pp. 524-555, 2014 (link).

A Latent Source Model for Online Collaborative Filtering, by G. Bresler, G.H. Chen, D. Shah, Advances in Neural Information Processing Systems 27, pp. 3347-3355 (link).

Learning Mixed Multinomial Logit Model from Ordinal Data, by S. Oh, D. Shah, Advances in Neural Information Processing Systems, pp. 593-603 (link).

Structure learning of antiferromagnetic Ising models, by G. Bresler, D. Gamarnik, D. Shah, Advances in Neural Information Processing Systems, pp. 2852-2860 (link).

Hardness of parameter estimation in graphical models, by G. Bresler, D. Gamarnik, D. Shah, Advances in Neural Information Processing Systems 27, pp. 1062-1070 (link).

Solving for a Single Component of the Solution to a Linear System, Asynchronously, by C.E. Lee, A. Ozdaglar, D. Shah, arXiv preprint arXiv:1411.2647, 2014 (link).

Bayesian regression and Bitcoin, by D. Shah, K. Zhang, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2014, pp. 409-414 (link).

Statistical inference with probabilistic graphical models, by A. Drémeau, C. Schülke, Y. Xu, D. Shah, Statistical Physics, Optimization, Inference, and Message-Passing Algorithms: Lecture Notes of the Les Houches School of Physics: Special Issue, October 2013 (link).

What’s your choice?: learning the mixed multi-nomial, by A. Ammar, S. Oh, D. Shah, L.F. Voloch, ACM SIGMETRICS Performance Evaluation Review – Performance evaluation review, Volume 42 Issue 1, June 2014 , Pages 565-566 (link).

#### 2013

Technique for Efficient Evaluation of SRAM Timing Failure, by Qazi M., M Titekar, L. Dolecek, D. Shah and A. Chandrakasan, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Volume 21, No. 8, pp. 1558-1562, 2013 (link).

A Nonparametric Approach to Modeling Choice with Limited Data, by V. Farias, S. Jagabathula, D. Shah, Management Science, Volume 59, No. 2, pp. 305-322, 2013 (link).

Efficient crowdsourcing for multi-class labeling, by D. Karger, S. Oh, D. Shah, ACM SIGMETRICS Performance Evaluation Review, Volume 41, No. 1, pp. 81-92, 2013 (link).

A Latent Source Model for Nonparametric Time Series Classification, by G. Chen, S. Nikolov, D. Shah, Advances in Neural Information Processing Systems 26, pp. 1088-1096, 2013 (link).

Computing the Stationary Distribution Locally, by C.E. Lee, A. Ozdaglar, D. Shah, Advances in Neural Information Processing Systems, pp. 1376-1384, 2013 (link) also arXiv:1312.1986 (link).

#### 2012

Switched networks with maximum weight policies: fluid approximation and multiplicative state space collapse, by D.Shah, D. Wischik, The Annals of Applied Probability, Volume 22, No. 1, pp. 70-127, 2012 (link).

Randomized scheduling algorithm for queueing networks, by Shah D., and J. Shin, The Annals of Applied Probability, Volume 22, No. 1, pp. 128-171, 2012 (link).

Belief propagation for min-cost network flow: convergence & correctness, by D. Gamarnik, D. Shah, Y. Wei, Operations Research, Volume 60, No. 2, pp. 410-428, 2012 (link).

Caching in Wireless Networks, by U. Niesen, D. Shah and G. Wornell, IEEE Transactions on Information Theory, Volume 58, No. 10, pp. 6524-6540, 2012 (link).

Log-weight scheduling in switched networks, by D. Shah and D. Wischik, Queueing Systems, Volume 71, No. 1-2, pp. 97-136, 2012 (link).

Iterative ranking from pair-wise comparisons, by S. Negahban, S. Oh and D. Shah, Proceedings of Neural Information Processing Systems (NIPS), pp. 2474-2482, 2012 (link). Also arXiv:1209.1688 (link).

Spinal-codes, by J. Perry, PA Iannucci, KE Fleming, H. Balakrishnan and D. Shah, Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication, Pages 49-60 (link).

No Symbol Left Behind: A Link-Layer Protocol for Rateless Codes, by PA Iannucci PA, J Perry, H. Balakrishnan, D. Shah, Proceedings of the 18th Annual International Conference on Mobile Computing and Networking, pp.17-28 (link).

De-randomizing Shannon: The design and analysis of a capacity-achieving rateless code, by H. Balakrishnan, P. Iannucci, J. Perry, D. Shah, arXiv preprint arXiv:1206.0418 (link).

Optimal queue-size scaling in switched networks, by D. Shah, N. Walton, Y. Zhong, ACM SIGMETRICS Performance Evaluation Review, Volume 40, Issue 1, pp.17-28 (link).

Efficient rank aggregation using partial data, by A. Ammar, D. Shah, ACM SIGMETRICS Performance Evaluation Review, Volume 40, Issue 1, pp.355-366 (link).

On the Flow-level Dynamics of a Packet-switched Network, by C. Moallemi, D. Shah, ACM SIGMETRICS Performance Evaluation Review – Performance evaluation review, Volume 38, Issue 1, June 2010, Pages 83-94 (link).

Sparse choice models, by V. F. Farias, S. Jagabathula, D. Shah, 2012 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, 2012, pp. 1-28 (link).

A hardware spinal decoder, by PA Iannucci, KE Fleming, J Perry, H Balakrishnan, ANCS ’12 Proceedings of the eighth ACM/IEEE Symposium on Architectures for networking and communications systems, Pages 151-162 (link).

Learning sparse Boolean polynomials, by S. Negahban, D. Shah, 2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2012, pp. 2032-2036 (link).

#### 2011

Distributed averaging in dynamic networks, by S. Rajagopalan, D. Shah, IEEE Journal of Selected Topics in Signal Processing, Volume 5, No. 4, pp. 845-854, August 2011 (link).

Fair scheduling in networks through packet election, by S. Jagabathula, D. Shah, IEEE Transactions on Information Theory, Volume 57, No. 3, pp.1368-1381, March 2011 (link).

Network coding meets TCP: Theory and application, by J.K. Sunderarajan, D. Shah, M. Medard, S. Jakubczak, M. Mitzenmacher, J. Barros, Proceedings of the IEEE, Volume 99, No. 3, pp. 490-512, 2011 (link).

Optimal scaling of average queue sizes in an input-queued switch: an open problem, by D. Shah, J. N. Tsitsiklis, Y. Zhong, Queueing Systems, Volume 68, No. 3-4, pp. 375-384, 2011 (link).

Reduction of variation-induced energy overhead in multi-core processors, by N. Drego, A. Chandrakasen, D. Boning and D. Shah, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Volume 30, No. 6, pp. 891-904, June 2011 (link).

Rumors in a network: who’s the culprit?, by Shah D., and Zaman T., IEEE Transactions on Information Theory, Volume 57, No. 8, pp. 5163-5181, 2011 (link).

Inferring rankings using constrained sensing, by Jagabathula S. and D. Shah, IEEE Transactions on Information Theory, Volume 57, No. 11, pp. 7288-7306, 2011 (link).

Hardness of low delay network scheduling, by D. Shah, D. N. C. Tse and J. N. Tsitsiklis, IEEE Transactions on Information Theory, Volume 57, No. 12, pp. 7810-7817, 2011 (link).

Fluid models of congestion collapse in overloaded switched networks, by D. Shah, D. Wischik, Queuing Systems, Volume 69, No. 2, pp. 121-143, 2011 (link).

Message-passing in stochastic processing networks, by Shah D., Surveys in Operations Research and Management Science, Volume 16, No. 2, pp. 83-104, 2011 (link).

Iterative learning for reliable crowdsourcing systems, by D. Karger, Oh S., and Shah D., Advances in Neural Information Processing Systems 24, pp. 1953-1961, 2011 (link).

Budget-optimal crowdsourcing using low-rank matrix approximations, by DR Karger, S Oh, D Shah, 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 284-291, 2011 (link).

Rateless spinal codes, by J. Perry, H. Balakrishnan, D. Shah, Proceedings of the 10th ACM Workshop on Hot Topics in Networks, 6 pages, 2011 (link).

Medium access using queues, by D. Shah, J. Shin, P. Tetali, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, Palm Springs, CA, 2011, pp. 698-707 (link). Longer version (link).

Ranking: Compare, don’t score, by A. Ammar, D. Shah, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 776-783 (link).

Counting Independent Sets Using the Bethe Approximation, by V. Chandrasekaran, M. Chertkov, D. Gamarnik, D. Shah, J. Shin, SIAM Journal on Discrete Mathematics, Volume 22, No. 2, pp. 1012-1034, 2011 (link).

Informational limits of neural circuits, by L. R. Varshney, D. Shah, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2011, pp. 1757-1763 (link).

Three metrics for stochastic networks: Capacity, queue-size and complexity, by D. Shah, Proceedings of IEEE Communication Systems and Networks (COMSNET), pp. 1-4, 2011 (link).

#### 2010

The balanced unicast and multicast capacity regions of large wireless networks, by U. Niesen, P. Gupta and D. Shah, IEEE Transactions on Information Theory, Volume 56, No. 5, pp. 2249-2271, 2010 (link).

Functional compression through graph coloring, by V. Doshi, D. Shah, M. Medard, M. Effros, IEEE Transactions on Information Theory, Volume 56, No. 8, pp. 3901-3917, August 2010 (link).

Information theoretic bounds for distributed computation over networks of point-to-point channels, by O. Ayaso, O., D. Shah, M. Dahleh, IEEE Transactions on Information Theory, Volume 56, No. 12, pp. 6020-6039, December 2010 (link).

Distributed random access algorithm: scheduling and congestion control, by L. Jiang, D. Shah, J. Shin and J. Walrand, IEEE Transactions on Information Theory, Volume 56, No. 12, pp. 6182-6207, December 2010 (link).

Fully distributed algorithms for convex optimization problems, by D. Mosk-Aoyama, T. Roughgarden, D. Shah, SIAM Journal on Optimization, Volume 20, No. 6, pp. 3260-3279, 2010 (link).

Distributed Cross-Layer Algorithms for the Optimal Control of Multihop Wireless Networks, by A. Eryilmaz, A. Ozdaglar, D.Shah, E. Modiano, IEEE/ACM Transactions on Networking, Volume 18, No.2, pp.638-651, April 2010 (link).

Loop flattening & spherical sampling: Highly efficient model reduction techniques for SRAM yield analysis, by M. Qazi, M. Titekar, L. Dolecek, D. Shah, A. Chandrakasen, Proceedings of the Conference on Design, Automation and Test in Europe, pp.801-806, 2010 (link).

Delay optimal queue-based CSMA, by D. Shah, J. Shin, ACM SIGMETRICS Performance Evaluation Review, Volume 38, Issue 1, pp. 373-374, 2010 (link).

Dynamics in congestion games, by D. Shah, J. Shin, ACM SIGMETRICS Performance Evaluation Review, Volume 38, Issue 1, pp. 107-118, 2010 (link).

A simple message-passing algorithm for compressed sensing, by V. Chandar, D. Shah, G. W. Wornell, 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), Austin, TX, 2010, pp. 1968-1972 (link).

Qualitative properties of α-weighted scheduling policies, by D. Shah, J.N. Tsitsiklis, Y. Zhong, ACM SIGMETRICS Performance Evaluation Review, Volume 38, Issue 1, pp. 239-250 (link).

Message-passing for wireless scheduling: an experimental study, by P. Giaccone, D. Shah, Proceedings of 19th International Conference on Computer Communications and Networks 2010 (ICCCN) (link)

Algorithmically Efficient Networks, by K Jung, D Shah, Unpublished Manuscript (link).

#### 2009

Gossip Algorithms, by Shah D., Foundations and Trends in Networking, Vol. 3, No. 1, pages: 1-125, 2008 (link).

Adaptive alternating minimization algorithm, by U. Niesen , D. Shah, and G. Wornell, IEEE Transactions on Information Theory, Volume 55, No. 3, pp. 1423-1429, 2009 (link).

On capacity scaling in arbitrary wireless networks, by U. Niesen, P. Gupta and D. Shah, IEEE Transactions on Information Theory, Volume 55, No. 9, pp. 3959-3982, 2009 (link).

Message Passing for Maximum Weight Independent Set, by S. Sanghavi, D. Shah, A. Willsky, IEEE Transactions on Information Theory, Volume 55, No. 11, pp. 4822-4834, 2009 (link).

Distributed averaging via lifted Markov chains, by K. Jung, D. Shah, J. Shin, IEEE Transactions on Information Theory, Volume 56, No. 1, pp. 634-647, 2009 (link).

Belief propagation: an asymptotically optimal algorithm for the random assignment problem, by J. Salez, D. Shah, Mathematics of Operations Research, Volume 34, No. 2, pp. 468-480, 2009 (link).

Network Coding Meets TCP, by JK Sundararajan, Shah D., Médard M., Mitzenmacher M., Barros J., IEEE INFOCOM, 2009 (link).

Inferring rankings under constrained sensing, by S. Jagabathula, D. Shah, Advances in Neural Information Processing Systems, pp. 753-760, 2009 (link).

A Data-Driven Approach to Modeling Choice, by V. Farias, S. Jagabathula, D. Shah, Advances in Neural Information Processing Systems, 2009, pp.504-512 (link).

Optimality of belief propagation for random assignment problem, by J. Salez, D.Shah, Proceeding SODA ’09 Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, Pages 187-196 (link).

Network Adiabatic Theorem: An Efficient Randomized Protocol For Contention Resolution, by S. Rajagopalan, D. Shah and J. Shin, Proceedings of ACM Sigmetrics, 2009 (link).

Local rules for global map: When do they work?, by K. Jung, P. Kohli, D. Shah, Advances in Neural Information Processing Systems, pp. 871-879, 2009 (link).

Network gossip algorithms, by D. Shah, 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, Taipei, 2009, pp. 3673-3676 (link).

A locally encodable and decodable compressed data structure, by V. Chandar, D. Shah, G. W. Wornell, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, 2009, pp. 613-619 (link).

#### 2008

Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality, by M. Bayati, D. Shah, and M. Sharma, IEEE Transactions on Information Theory, Volume: 54, No.3, pp.1241-1251, March 2008 (link).

Product Multicommodity Flow in Wireless Networks, by R. Madan , D. Shah, O. Leveque, IEEE Transaction on Information Theory, Volume 54, No. 4, pp. 1460-1476, April 2008 (link).

Fast Distributed algorithms for computing separable functions, by D. Mosk-aoyama and D. Shah, IEEE Transaction on Information Theory, Volume 54, No. 7, pp. 2997-3007, July 2008 (link).

A Dynamic Pickup and Delivery Problem in Mobile Networks under Information Constraints, by H. Waisanen, D. Shah, M. Dahleh, IEEE Transactions on Automatic Control, Volume 53, No. 6, pp. 1419-1433, July 2008 (link).

Bin packing with queues, by D. Shah, J. N. Tsitsiklis, Journal of Applied Probability, Volume 45, Issue 4, pp. 922-939, 2008 (link).

ARQ for network coding, by J.K. Sundararajan, Shah D., Médard M., IEEE International Symposium on Information Theory, pp. 1651-1655, 2008 (link).

Breaking the Simulation Barrier: SRAM Evaluation Through Norm Minimization, by L Dolecek, M Qazi, D Shah, A Chandrakasan, Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, pp. 322-329, 2008 (link).

Online network coding for optimal throughput and delay-the three-receiver case, by JK Sundararajan, D. Shah, M. Médard, International Symposium on Information Theory and Its Applications, 2008, pp. 1-6, ISITA 2008 (link).

Distributed algorithm and reversible network, by S. Rajagopalan, D. Shah, 2008 42nd Annual Conference on Information Sciences and Systems, Princeton, NJ, pp. 498-502, 2008 (link).

Optimal delay scheduling in networks with arbitrary constraints, by Jagabathula S., Shah D., Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Issue 1, pp. 395-406 (link).

Message passing for max-weight independent set, by S. Sanghavi, D. Shah, AS Willsky, Advances in Neural Information Processing Systems, pp. 1281-1288 (link).

Revisiting stochastic loss networks: structures and algorithms, by K. Jung, Y. Lu, D. Shah, M. Sharma, M.S. Squillante, ACM SIGMETRICS Performance Evaluation Review, Volume 36, Issue 1, pp. 407-418 (link).

Local Algorithms for Approximate Inference in Minor-Excluded Graphs, by K. Jung, D. Shah, Advances in Neural Information Processing Systems, pp. 729-736, 2008 (link).

Network scheduling and message-passing, by D. Shah, Performance Modeling and Engineering, pp. 147-184 (link).

Fair Scheduling through Packet Election, by S. Jagabathula, V. Doshi, D. Shah, IEEE INFOCOM 2008 – The 27th Conference on Computer Communications, Phoenix, AZ, pp 301-305, 2008 (link).

Feasible Rate Allocation in Wireless Networks, by R. Gummadi, K. Jung, D. Shah, R. Sreeniva, IEEE INFOCOM 2008 – The 27th Conference on Computer Communications, Phoenix, AZ, 2008, pp.995-1003 (link).

Distributed computation under bit constraints, by O. Ayaso, D. Shah and M. A. Dahleh, 2008 47th IEEE Conference on Decision and Control, Cancun, 2008, pp. 4837-4842 (link).

#### 2007

Throughput region in finite-buffered networks, by P. Giaccone, E. Leonardi and D. Shah, IEEE Transactions on Parallel and Distributed Systems, Volume 18, No. 2, pp. 251-263, Feb. 2007 (link).

Throughput and Delay in Random Wireless Networks with Restricted Mobility, by J. Mammen, D. Shah, IEEE Transaction on Information Theory, Volume 53, No. 3, pp. 1108-1116, March 2007 (link).

Low delay scheduling in wireless network, by K. Jung, D. Shah, IEEE International Symposium on Information Theory, pp. 1396-1400, 2007 (link).

Network Coding in a Multicast Switch, by J. K. Sundararajan, M. Medard, M. Kim, A. Eryilmaz, D. Shah and R. Koetter, IEEE INFOCOM 2007 – 26th IEEE International Conference on Computer Communications, Anchorage, AK, pp. 1145-1153, 2007 (link).

Distributed Functional Compression through Graph Coloring, by V. Doshi, D. Shah, M. Medard, S. Jaggi, Data Compression Conference, 2007. DCC ’07, Snowbird, UT, 2007, pp. 93-102 (link).

On queueing in coded networks – queue size follows degrees of freedom, by J. K. Sundararajan, D. Shah, M. Medard, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, Solstrand, pp. 1-6 (link).

Oblivious Routing with Mobile Fusion Centers over a Sensor Network, by D. Shah, S. Shakkottai, IEEE INFOCOM 2007 – 26th IEEE International Conference on Computer Communications, Anchorage, AK, pp. 1541-1549 (link).

Iterative scheduling algorithms, by M. Bayati, B. Prabhakar, D. Shah, M. Sharma, IEEE INFOCOM 2007 – 26th IEEE International Conference on Computer Communications, Anchorage, AK, pp. 445-453 (link).

Counting good truth assignments of random k-SAT formulae, by A. Montanari, D. Shah, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, pp. 1255-1264 (link).

Fully distributed algorithms for convex optimization problems, by D. Mosk-Aoyama, T. Roughgarden, D. Shah, Proceedings of International Symposium on distributed computing (DISC) (Lecture Notes in Computer Science), Volume 4731, pp. 492-499, September 2007. (link).

Source Coding with Distortion through Graph Coloring, by V. Doshi, D. Shah, M. Médard, 2007 IEEE International Symposium on Information Theory, Nice, 2007, pp. 1501-1505 (link).

Approximate message-passing inference algorithm, by K. Jung, D. Shah, 2007 IEEE Information Theory Workshop, Tahoe City, CA, 2007, pp. 224-229 (link).

Fundamental Performance Limits for Multi-Stage Vehicle Routing Problems, by H. Waisanen, D. Shah, M. Dahleh, Operations Research, 2007 (link).

Lower bounds on information rates for distributed computation via noisy channels, by Ola Ayaso, Devavrat Shah, M Dahleh, Proceedings of the forty-fifth Allerton Conference on Computation, Communication and Control (link).

Fast and Slim Lifted Markov Chains, by K. Jung, D. Shah, J. Shin, Allerton Conference on Communication, Control and Computing (link).

#### 2006

Randomized Gossip Algorithms, by S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, In special joint issue of IEEE Transaction on Information Theory and IEEE/ACM Transaction on Networking, Vol. 52, No. 6, pp. 2508- 2530, 2006 (link).

Optimal throughput-delay scaling in wireless networks: Part I: the fluid model, by A El Gamal, J. Mammen, B. Prabhakar, D. Shah, IEEE/ACM Transaction on Networking, Volume 52, No. 6, pp. 2568- 2592, 2006 (link).

Maximizing throughput in wireless networks via gossiping, by E. Modiano, Shah D., Zussman G., ACM SIGMETRICS Performance Evaluation Review – Performance evaluation review, Volume 34 Issue 1,

Pages 27 – 38, June 2006 (link).

Optimal throughput–delay scaling in wireless networks—Part II: Constant-size packets, by A. El Gamal, J. Mammen, B. Prabhakar, D. Shah, IEEE Transactions on Information Theory, Volume 52, Issue 11, pp. 5111-5116, 2006 (link).

Information Dissemination via Network Coding, by D. Mosk-Aoyama, D. Shah, 2006 IEEE International Symposium on Information Theory, pp. 1748-1752, 2006 (link).

Fast Matching Algorithms for Repetitive Optimization: An Application to Switch Scheduling, by S. Deb, D. Shah, S. Shakkottai, 2006 40th Annual Conference on Information Sciences and Systems, Princeton, NJ, 2006, pp. 1266-1271 (link).

Stochastic stability under network utility maximization: General file size distribution, by M. Chiang, D. Shah, A. Tang, Proceedings of 44th Allerton Conference on Communication, Control and Computing (link).

Graph Coloring and Conditional Graph Entropy, by V. Doshi, D. Shah, M. Medard, S. Jaggi, 2006 Fortieth Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 2006, pp. 2137-2141 (link).

A Simpler Max-Product Maximum Weight Matching Algorithm and the Auction Algorithm, by M. Bayati, D. Shah, M. Sharma, 2006 IEEE International Symposium on Information Theory, Seattle, WA, 2006, pp. 557-561 (link).

Computing Separable Function via Gossip, by D. Mosk-Aoyama, D. Shah, Proceedings of ACM symposium on Principles of distributed computing (PODC) 2006 (link).

Inference in Binary Pair-wise Markov Random Fields through Self-Avoiding Walks, by K. Jung, D. Shah, ArXiv Preprint (link).

On entropy for mixtures of discrete and continuous variables, by C. Nair, B. Prabhakar, D. Shah, arXiv Preprint (link).

Fast Gossip via Non-reversible Random Walk, by K. Jung, D. Shah, 2006 IEEE Information Theory Workshop – ITW ’06 Punta del Este, Punta del Este, Uruguay, 2006, pp. 67-71 (link).

Minimal Delay in Controlled Mobile Relay Networks, by H. A. Waisanen, D. Shah, M. A. Dahleh, Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, 2006, pp. 1918-1922 (link).

Optimal Delay in Networks with Controlled Mobility, by H. Waisanen, D. Shah, M. Dahleh, 17th International Symposium on Mathematical Theory of Networks and Systems (link).

#### 2005

Cell switching versus packet switching in input queued switches, by Y. Ganjali, A. Keshavarzian, D. Shah, IEEE/ACM Transactions on Networking, Volume 13, No.4, pp. 782-789, 2005 (link).

Maximum Weight Matching via Max-Product Belief Propagation, by M. Bayati, D. Shah and M. Sharma, Proceedings of International Symposium on Information Theory, pp. 1763-1767 ISIT 2005 (link).

Mixing Times for Random Walks on Geometric Random Graphs, by SP Boyd, A Ghosh, B Prabhakar, D Shah, Proceedings of Analytic Algorithms and Combinatorics (ALENEX/ANALCO), Vancouver, Canada, pp. 240-249, 2005 (link).

Gossip Algorithms: Design, Analysis and Applications, by SP Boyd, A Ghosh, B Prabhakar, D Shah, Proceedings of IEEE INFOCOM 2005. (link).

On the maximal throughput of networks with finite buffers and its application to buffered crossbars, by P. Giaccone, E. Leonardi, D. Shah, Proceedings IEEE INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. (link).

Stable algorithms for input queued switches, by D. Shah, Proceedings of the Annual Allerton Conference on Communication, Control, and Computing, Volume 39: No.2, 2001, p.1108 (link).

Tightness of lp via max-product belief propagation, by S. Sanghavi, D. Shah, arXiv preprint cs/0508097 (link).

Throughput-Delay Scaling in Wireless Networks with Constant-Size Packets, by A El Gamal, J Mammen, B Prabhakar, D Shah, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., Adelaide, SA, 2005, pp. 1329-1333 (link).

Control reduces delay in mobile wireless networks, by HA Waisanen, D Shah, MA Dahleh, 43rd Annual Allerton Conference on Communcation, Control, and Computing (link).

#### 2004

Delay bounds for combined input-output queued switches with low speedup, by P. Giaccone, E. Leonardi, B. Prabhakar, D. Shah, Performance Evaluation, Volume 55, Issue 1, pp. 113-128, 2004 (link).

Analysis and optimization of randomized gossip algorithms, by S.Boyd, A. Ghosh, B. Prabhakar, D. Shah, 43rd IEEE Conference on Decision and Control, Volume 5, pp. 5310-5315, 2004 (link).

Throughput-Delay Trade-off in Energy Constrained Wireless Networks, by A. E. Gamal, J. Mammen, B. Prabhakar, D. Shah, International Symposium on Information Theory, 2004. ISIT 2004. Proceedings., 2004, pp. 439 (link).

Fair scheduling in input-queued switches under inadmissible traffic, by N. Kumar, R. Pan, D. Shah, Global Telecommunications Conference, 2004. GLOBECOM ’04. IEEE, 2004, Volume 3, pp. 1713-1717 (link).

Throughput and delay in random wireless networks: 1-D mobility is just as good as 2-D, by J. Mammen, D. Shah, International Symposium on Information Theory, 2004. ISIT 2004. Proceedings., 2004, pp. 440 (link).

#### 2003

Randomized scheduling algorithms for high-aggregate bandwidth switches, by P. Giaccone, B. Prabhakar, D. Shah, IEEE Journal on Selected Areas in Communications, Volume 21, Issue 4, pp. 546-559, 2003 (link).

Input queued switches: cell switching vs. packet switching, by Y. Ganjali, A. Keshavarzian, D. Shah, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428), 2003, Volume 3, pp. 1651-1658 (link).

Maximal matching scheduling is good enough, by D. Shah, Global Telecommunications Conference, 2003. GLOBECOM ’03. IEEE, 2003, Volume 6, pp. 3009-3013 (link).

Switch Scheduling via Randomized Edge Coloring, by G. Aggarwal, R. Motwani, D. Shah, An Zhu, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., 2003, pp. 502-512. (link).

#### 2002

Maintaining Statistics Counters in Router Line Cards, by D. Shah, S. Iyer, B. Prabhakar and N. McKeown, IEEE Micro, CA, 6 pages, 2002 (link).

Efficient randomized algorithms for input-queued switch scheduling, by Giaccone P., B. Prabhakar and D. Shah, IEEE Micro, 22(1), pp. 10-18, 2002 (link).

Towards simple high-performance schedulers for high-aggregate switches, by P. Giaccone , B. Prabhakar, D. Shah, Proceedings. IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Volume 3, pp. 1160-1169, 2002 (link).

Delay Bounds for Approximate Maximum Weight Matching Algorithms for Input Queued Switches, by D. Shah and M. Kopikare, Proceedings of IEEE INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, Volume 2, pp. 1024-1031 (link).

Load balancing with memory, by M. Mitzenmacher, B. Prabhakar and D. Shah, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. pp. 799-808 (link).

The use of memory in randomized load balancing, by D. Shah, B. Prabhakar, Proceedings IEEE International Symposium on Information Theory, 2002, pp. 125 (link).

Delay performance of high-speed packet switches with low speedup, by P. Giaccone, E. Leonardi, B. Prabhakar and D. Shah, Global Telecommunications Conference, 2002. GLOBECOM ’02. IEEE, 2002, Volume 3, pp. 2629-2633 (link).

#### 2001

An efficient randomized algorithm for input-queued switch scheduling, by P. Giaccone, B. Prabhakar and D. Shah, Proceedings of Hot Interconnects IX, Stanford, CA, pp. 3-8, 2001 (link).

Fast Updating Algorithms for TCAMs, by D.Shah, P. Gupta, Proceedings of Hot Interconnects IX, Stanford, CA, pp. 36-47, 2001 (link).

An implementable parallel scheduler for input-queued switches, by P. Giaccone, B. Prabhakar, D. Shah, Proceedings of Hot Interconnects IX, Stanford, Stanford, CA, pp. 9-14, 2001 (link).

Analysis of a statistics counter architecture, by D.Shah, S. Iyer, B. Prabhakar, N. McKeown, HOT Interconnects 9. Symposium on High Performance Interconnects, Stanford, CA, 2001, pp. 107-111 (link).

The randomness in randomized load balancing, by C Nair, B Prabhakar, D Shah, PROCEEDINGS OF THE ANNUAL ALLERTON CONFERENCE ON COMMUNICATION CONTROL AND COMPUTING, Volume 32, Issue 2, pp.912-921 (link).

#### 2000

Turbo-charging Vertical Mining of Large Databases, by Shenoy P., J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa and D. Shah, Proceedings of ACM SIGMOD, Volume 29, pp. 22-33, 2000 (link).

Fast incremental updates on Ternary-CAMs for routing lookups and packet classification, by D. Shah, P. Gupta, Proceedings of Hot Interconnects, 2000 (link).

#### 1999

Interestingness and Pruning of Mined Patterns, by D. Shah., Laks V. S. Lakshmanan, K. Ramamritham, S. Sudarshan, Proceedings of ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 7 pages, 1999 (link).