U. Niesen, P. Gupta and D. Shah, ``On capacity scaling in arbitrary wireless networks,” In proceedings of the Information Theory and Applications (ITA) workshop, pages: 5, University of California, San Dieogo, Febuary 2007 (Invited paper).

K. Jung and D. Shah, ``Local approximate inference algorithms,’’ in Proceedings of Allerton Conference on Computation, Communication and Control, pages: 8, Urbana, Illinois, 2007 (Invited paper).

K. Jung, D. Shah and J. Shin, ``Fast gossip through lifted Markov chains,” In proceedings of Allerton Conference on Computation, Communication and Control, pages: 8, Urbana, Illinois, 2007 (Invited paper).

K. Jung and D. Shah, “Approximate message-passing inference algorithms,” In proceedings of Information Theory Workshop, pages: 6, Tahoe, September, 2007 (Invited paper).

J. Sunderarajan, D. Shah and M. Medard, ``On queueing in coded networks - queue size follows degrees of freedom,’’ In proceedings of Information Theory Workshop, pages: 5, Norway, July, 2007 (Invited paper).

D. Shah and D. Wischik, “On optimality of MWM-0+ scheduling algorithm,” In proceedings of the Information Theory and Applications (ITA) workshop, pages: 5, University of California, San Dieogo, Febuary 2007 (Invited paper).

V. Doshi, D. Shah, M. Medard and S. Jaggi, “Graph Coloring for Computing,” in Proceedings of the Asilomar Conference, pages: 5, Pacific Groove, CA, 2006 (Invited paper).

M. Chiang, D. Shah and A. Tang, “Fair Bandwidth Allocation under General File-Size Distribution,”  in Proceedings of Allerton Conference on Computation, Communication and Control, pages:8, Urbana, Illinois, 2006 (Invited paper).

U. Niesen, D. Shah and G. Wornell, “Sampling Distortion Measures,” Invited Paper at the Allerton Conference on Computation, Communication and Control, pages: 8, Urbana, Illinois, 2006.

S. Deb, D. Shah and S. Shakkottai, “Fast matching algorithms for repetitive optimization: an application to switch scheduling,” in Proceedings of CISS, pages: 6, Princeton, 2006 (Invited paper).

K. Jung and D. Shah, “On Computationally Bounded Adversarial Capacity,” In proceedings of the Information Theory and Applications (ITA) workshop, pages: 5, University of California, San Dieogo, Febuary 2006 (Invited paper).

K. Jung and D. Shah, “Fast Gossip via Non-reversible Random Walks,” In proceedings of the Information Theory Workshop, pages: 5, Uruguay, March 2006 (Invited Paper).

H. Waisanen, D. Shah and M. Dahleh, “Control reduces delay in mobile wireless networks,” In proceedings of Allerton Conference on Communication, Control, and Computing, pages: 8, Urbana, Illinois, 2005.

R. Madan and D. Shah, “Capacity scaling for arbitrary wireless networks,” in Proceedings of Allerton Conference on Communication, Control, and Computing, pages: 8, Urbana, Illinois, 2005.

A. El Gamal, J. Mammen, B. Prabhakar and D. Shah, “Throughput delay trade-off wireless networks: constant packet-size,” in Proceedings of Allerton Conference on Communication, Control, and Computing, pages:8, Urbana, Illinois, 2004.

P. Giaccone, B. Prabhakar and D. Shah, “Efficient randomized algorithms for input-queued switch scheduling,” IEEE Micro, 22(1), pages: 6, 2002.

P. Giaccone, B. Prabhakar and D. Shah, “An implementable parallel scheduler for input-queued switches,” IEEE Micro, 22(1), 2002.