L. Dolecek, M. Qazi, D. Shah and A. Chandrakasen, ``Breaking the simulation barrier: SRAM evaluation through norm minimization," Accepted to appear in Proceedings of ICCAD, pages: 8, November 2008.

S. Jagabathula and D. Shah, ``Optimal delay scheduling in networks with arbitrary constraints,’’ In Proceedings of ACM SIGMETRIC/Performance, pages: 12, 2008.

K. Jung, Y. Lu, D. Shah, M. Sharma and M. Squillante, ``Revisiting stochastic loss networks: structures and algorithms,” In proceedings of ACM SIGMETRIC/Performance, pages: 12, 2008.

S. Jagabathula, V. Doshi and D. Shah, “Fair scheduling through packet election,” In proceedings of IEEE INFOCOM, pages: 9, 2008.

R. Gummadi, K. Jung, D. Shah and R. Sreenivas, ``Feasible rate allocation in wireless networks,’’ In proceedings of IEEE INFOCOM, pages: 9, 2008.

K. Jung and D. Shah, “Local approximate inference algorithms for minor excluded graphs,” In proceedings of NIPS, pages: 8, December 2007.

S. Sanghavi, D. Shah and A. Willsky, ``Max-product for maximum weight independent set,’’In proceedings of NIPS, pages: 8, December 2007.

H. Waisanen, D. Shah and M. Dahleh, “Lower Bounds for Multi-Stage Vehicle Routing,” In proceedings of IEEE Conference on Decision and Control, New Orleans, LA, pages: 5, December 2007.

D. Mosk-aoyama, T. Roughgarden and D. Shah, ``Fully Distributed Algorithms for  Convex Optimization Problems,” in Proceedings of International symposium on distributed computation, pages: 8, September, 2007.

U. Niesen, D. Shah and G. Wornell, “Source Coding with Mismatched Distortion Measures,” in Proceedings of Allerton Conference on Computation, Communication and Control, pages: 8, Urbana, Illinois, 2007.

O. Ayaso, D. Shah and M. Dahleh, “Lower Bounds on Information Rates for Distributed Computation via Noisy Channels,” in Proceedings of Allerton Conference on Computation, Communication and Control, pages: 8, Urbana, Illinois, 2007.

V. Doshi, D. Shah, and M. Medard, “Source coding with distortion through graph coloring,” in Proceedings of IEEE ISIT, pages: 5, France, June 2007.

K. Jung and D. Shah, “Low delay scheduling in wireless networks,” in Proceedings of IEEE ISIT, pages: 5, France, 2007.

U. Niesen, D. Shah and G. Wornell, ``Adaptive Alternative Minimization Algorithm,’’ in Proceedings of IEEE ISIT, pages: 5, France, 2007.

M. Bayati, B. Prabhakar, D. Shah and M. Sharma, “Iterative Scheduling Algorithms,” in Proceedings of IEEE INFOCOM, pp. 445-453, 2007.

D. Shah and S. Shakkottai, ``Oblivious Routing with Mobile Fusion Centers over a Sensor Network,” in Proceedings of IEEE INFOCOM, pages: 9, 2007.

J. Sunderarajan, M. Medard, M. Kim, A. Eryilmaz, D. Shah and R. Koetter, ``Network coding in a multi-cast switch,” in Proceedings of IEEE INFOCOM, pages: 9, 2007.

V. Doshi, D. Shah, M. Medard and S. Jaggi, “Distributed functional compression through graph coloring,” in Proceedings of Data Compression Conference, 2007.

A. Montanari and D. Shah, “Counting Good Truth Assignment in Random k-SAT,” in Proceedings of ACM-SIAM SODA, pages: 9, New Orleans, 2007.

H. Waisanen, D. Shah and M. Dahleh, “Minimal Delay in Controlled Mobile Relay Networks,” Proceedings of IEEE Conference on Decision and Control, pages: 5, San Diego, CA, 2006.

D. Shah and D. Wischik, “Optimal Scheduling Algorithms for Input-Queued Switches,” Proceedings of IEEE INFOCOM, pages; 9, Spain, 2006.

D. Mosk-Aoyama and D. Shah, “Computing Separable Functions via Gossip,” Proceedings of IEEE PODC, pages: 9, Denver, USA, 2006.

E. Modiano, D. Shah and G. Zussman, “Maximizing throughput in wireless networks via Gossip,” in Proceedings of ACM SIGMETRIC/Performance, pages: 12, Nice, France, 2006. (Best paper award)

O. Leveque, R. Madan and D. Shah, “Capacity Scaling in Wireless Networks with Gaussian Channels,” Proceedings of IEEE ISIT, pages: 5, Seattle, USA, 2006.

D. Mosk-Aoyama and D. Shah, “Information Dissemination via Network Coding,” Proceedings of IEEE ISIT, pages: 5, Seattle, USA, 2006.

M. Bayati, D. Shah and M. Sharma, “A Simpler Max-Product Maximum Weight Matching Algorithm and The Auction Algorithm,” Proceedings of IEEE ISIT, pages: 5, Seattle, USA, 2006.

H. Waisanen, D. Shah and M. Dahleh, “Optimal Delay in Networks with Controlled Mobility,” Proceedings of Mathematical Theory of Networks and Systems, pages: 6, Japan, 2006.

U. Niesen, U. Erez, D. Shah and G. Wornell, “Rate-less Codes for Multi-Access Channels,” Proceedings of IEEE Globecom, pages: 8, San Francisco, CA, 2006.

H. Waisanen, D. Shah and M. Dahleh, "Control reduces delay in mobile wireless networks," in Proceedings of Allerton

conference on Communication, Control and Computing, Monticello, IL, 2005.

S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, “Mixing Times for Random Walks on Geometric Random Graphs,” in Proceedings of workshop on Analytic Algorithms and Combinatorics (ANALCO), pp. 240-249, Van Couver, 2005.

A. El Gamal, J. Mammen, B. Prabhakar and D. Shah, “Throughput-delay scaling in wireless network with constant-size packets,” in Proceedings of IEEE ISIT, pages: 5, Australia, 2005.

M. Bayati, D. Shah and M. Sharma, “Maximum weight matching via max-product belief propagation,” in Proceedings of IEEE ISIT, pages: 5, Australia, 2005.

P. Giaccone, E. Leonardi and D. Shah, “On the maximal throughput of networks with finite buffers and its application to buffered crossbars,” in Proceedings of IEEE INFOCOM, pages: 9, Miami, 2005.

S. Boyd, A. Ghosh, B. Prabhakar and D. Shah, “Gossip algorithm: design, analysis and application,” in Proceedings of IEEE INFOCOM, pages:9, Miami, 2005.

A El Gamal, J. Mammen, B. Prabhakar and D. Shah, “Throughput-Delay tradeoff in wireless network,” in Proceedings of IEEE INFOCOM, pages: 10, Hong Kong, 2004. (Infocom best paper)

N. Kumar, R. Pan and D. Shah, “Fair scheduling in input-queued switches under inadmissible traffic,” in Proceedings of IEEE Globecom, pages: 6, Dallas, 2004.

D. Shah, “Maximal matching is good enough,” in Proceedings of IEEE Globecom, pages: 5, San Francisco, 2003.

G. Aggarwal, R. Motwani, D. Shah and A. Zhu, “Switch scheduling via edge coloring,”  in Proceedings of IEEE FOCS, pages: 10, Boston, 2003.

Y. Ganjali, A. Keshavarzian and D. Shah, “Input queued switches: cell switching v/s packet switching,” in Proceedings of IEEE INFOCOM, pages: 10, San Francisco, 2003. (Infocom top ten papers)

P. Giaccone, E. Leonardi, B. Prabhakar and D. Shah, “Delay performance of high-speed packet switches with low-speedup,” in Proceedings of IEEE Globecom, pages: 6, Taiwan, 2002.

M. Mitzenmacher, B. Prabhakar and D. Shah, “Balls and Bins with Memory,” in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 799-808, Van Couver, 2002.

P. Giaccone, B. Prabhakar and D. Shah, “Towards simple high-performance schedulers for high-aggregate switches,” in Proceedings of IEEE INFOCOM, New York, 2002.

D. Shah and M. Kopikare, “Delay bounds for approximate maximum weight matching algorithms for input-queued switches,” in Proceedings of IEEE INFOCOM, pages: 10, New York, 2002.

D. Shah, “Stable algorithms for input-queued switches,” in Proceedings of Allerton Conference on Communication, Control, and Computing, pages: 8, Urbana, Illinois, 2001.

D. Shah, S. Iyer, B. Prabhakar and N. McKeown, “Maintaining Statistics Counters in Router Line Cards,” in Proceedings of Hot Interconnects IX, pages: 6, Stanford, 2002.

P. Giaccone, B. Prabhakar and D. Shah, “An efficient randomized algorithm for input-queued switch scheduling,” in Proceedings of Hot Interconnects IX, pages: 6, Stanford, 2001.

P. Giaccone, B. Prabhakar and D. Shah, "An implementable parallel scheduler for input-queued switches,” in Proceedings of Hot Interconnects IX, pages: 6, Stanford, 2001.

D. Shah and P. Gupta, “Fast Updating Algorithms for TCAMs,” in Proceedings of Hot Interconnects IX, pages :6, Stanford, 2000.

P. Shenoy, J. R. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa and Devavrat Shah, “Turbo-charging Vertical Mining of Large Databases,” in Proceedings of ACM SIGMOD, pp. 22-33, 2000.

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