Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo

2010 | ||
---|---|---|

77 | Venkat Chandar, Devavrat Shah, Gregory W. Wornell: A Simple Message-Passing Algorithm for Compressed Sensing CoRR abs/1001.4110: (2010) | |

2009 | ||

76 | Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, Ramavarapu Sreenivas: Computing the Capacity Region of a Wireless Network. INFOCOM 2009: 1341-1349 | |

75 | Urs Niesen, Piyush Gupta, Devavrat Shah: The Multicast Capacity Region of Large Wireless Networks. INFOCOM 2009: 1881-1889 | |

74 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros: Network Coding Meets TCP. INFOCOM 2009: 280-288 | |

73 | Shreevatsa Rajagopalan, Devavrat Shah, Jinwoo Shin: Network adiabatic theorem: an efficient randomized protocol for contention resolution. SIGMETRICS/Performance 2009: 133-144 | |

72 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard: Feedback-based online network coding CoRR abs/0904.1730: (2009) | |

71 | Libin Jiang, Devavrat Shah, Jinwoo Shin, Jean C. Walrand: Distributed Random Access Algorithm: Scheduling and Congesion Control CoRR abs/0907.1266: (2009) | |

70 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Caching in Wireless Networks CoRR abs/0908.1916: (2009) | |

69 | Devavrat Shah, Jinwoo Shin: Randomized Scheduling Algorithm for Queueing Networks CoRR abs/0908.3670: (2009) | |

68 | Kyomin Jung, Devavrat Shah, Jinwoo Shin: Distributed Averaging via Lifted Markov Chains CoRR abs/0908.4073: (2009) | |

67 | Devavrat Shah: Gossip Algorithms. Foundations and Trends in Networking 3(1): 1-125 (2009) | |

66 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Adaptive Alternating Minimization Algorithms. IEEE Transactions on Information Theory 55(3): 1423-1429 (2009) | |

65 | Justin Salez, Devavrat Shah: Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem. Math. Oper. Res. 34(2): 468-480 (2009) | |

2008 | ||

64 | Ola Ayaso, Devavrat Shah, Munther A. Dahleh: Distributed computation under bit constraints. CDC 2008: 4837-4842 | |

63 | Shreevatsa Rajagopalan, Devavrat Shah: Distributed algorithm and reversible network. CISS 2008: 498-502 | |

62 | Atilla Eryilmaz, Asuman E. Ozdaglar, Devavrat Shah, Eytan Modiano: Imperfect randomized algorithms for the optimal control of wireless networks. CISS 2008: 932-937 | |

61 | Lara Dolecek, Masood Qazi, Devavrat Shah, Anantha Chandrakasan: Breaking the simulation barrier: SRAM evaluation through norm minimization. ICCAD 2008: 322-329 | |

60 | Srikanth Jagabathula, Vishal Doshi, Devavrat Shah: Fair Scheduling through Packet Election. INFOCOM 2008: 301-305 | |

59 | Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, Ramavarapu Sreenivas: Feasible Rate Allocation in Wireless Networks. INFOCOM 2008: 995-1003 | |

58 | Srikanth Jagabathula, Devavrat Shah: Inferring rankings under constrained sensing. NIPS 2008: 753-760 | |

57 | Srikanth Jagabathula, Devavrat Shah: Optimal delay scheduling in networks with arbitrary constraints. SIGMETRICS 2008: 395-406 | |

56 | Kyomin Jung, Yingdong Lu, Devavrat Shah, Mayank Sharma, Mark S. Squillante: Revisiting stochastic loss networks: structures and algorithms. SIGMETRICS 2008: 407-418 | |

55 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard: ARQ for Network Coding CoRR abs/0802.1754: (2008) | |

54 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Source Coding with Mismatched Distortion Measures CoRR abs/0804.0635: (2008) | |

53 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard: Online network coding for optimal throughput and delay -- the two-receiver case CoRR abs/0806.4264: (2008) | |

52 | Sujay Sanghavi, Devavrat Shah, Alan S. Willsky: Message-passing for Maximum Weight Independent Set CoRR abs/0807.5091: (2008) | |

51 | Srikanth Jagabathula, Devavrat Shah: Fair Scheduling in Networks Through Packet Election CoRR abs/0808.2530: (2008) | |

50 | Urs Niesen, Piyush Gupta, Devavrat Shah: The Capacity Region of Large Wireless Networks CoRR abs/0809.1344: (2008) | |

49 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros: Network coding meets TCP CoRR abs/0809.5022: (2008) | |

48 | Mohsen Bayati, Devavrat Shah, Mayank Sharma: Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality. IEEE Transactions on Information Theory 54(3): 1241-1251 (2008) | |

47 | Ritesh Madan, Devavrat Shah, Olivier Lévêque: Product Multicommodity Flow in Wireless Networks. IEEE Transactions on Information Theory 54(4): 1460-1476 (2008) | |

46 | Damon Mosk-Aoyama, Devavrat Shah: Fast Distributed Algorithms for Computing Separable Functions. IEEE Transactions on Information Theory 54(7): 2997-3007 (2008) | |

2007 | ||

45 | Vishal Doshi, Devavrat Shah, Muriel Médard, Sidharth Jaggi: Distributed Functional Compression through Graph Coloring. DCC 2007: 93-102 | |

44 | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493 | |

43 | Jay Kumar Sundararajan, Muriel Médard, MinJi Kim, Atilla Eryilmaz, Devavrat Shah, Ralf Koetter: Network Coding in a Multicast Switch. INFOCOM 2007: 1145-1153 | |

42 | Devavrat Shah, Sanjay Shakkottai: Oblivious Routing with Mobile Fusion Centers over a Sensor Network. INFOCOM 2007: 1541-1549 | |

41 | Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma: Iterative Scheduling Algorithms. INFOCOM 2007: 445-453 | |

40 | Kyomin Jung, Devavrat Shah: Local Algorithms for Approximate Inference in Minor-Excluded Graphs. NIPS 2007 | |

39 | Sujay Sanghavi, Devavrat Shah, Alan S. Willsky: Message Passing for Max-weight Independent Set. NIPS 2007 | |

38 | Andrea Montanari,
Devavrat Shah:
Counting good truth assignments of random k-SAT formulae.
SODA 2007: 1255-1264 | |

37 | Urs Niesen, Piyush Gupta, Devavrat Shah: On Capacity Scaling in Arbitrary Wireless Networks CoRR abs/0711.2745: (2007) | |

36 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Adaptive Alternating Minimization Algorithms CoRR abs/cs/0701043: (2007) | |

35 | Paolo Giaccone, Emilio Leonardi, Devavrat Shah: Throughput Region of Finite-Buffered Networks. IEEE Trans. Parallel Distrib. Syst. 18(2): 251-263 (2007) | |

34 | James P. Mammen, Devavrat Shah: Throughput and Delay in Random Wireless Networks With Restricted Mobility. IEEE Transactions on Information Theory 53(3): 1108-1116 (2007) | |

2006 | ||

33 | Urs Niesen, Uri Erez, Devavrat Shah, Gregory W. Wornell: Rateless Codes for the Gaussian Multiple Access Channel. GLOBECOM 2006 | |

32 | Devavrat Shah, Damon Wischik: Optimal Scheduling Algorithms for Input-Queued Switches. INFOCOM 2006 | |

31 | Damon Mosk-Aoyama, Devavrat Shah: Computing separable functions via gossip. PODC 2006: 113-122 | |

30 | Eytan Modiano, Devavrat Shah, Gil Zussman: Maximizing throughput in wireless networks via gossiping. SIGMETRICS/Performance 2006: 27-38 | |

29 | Ritesh Madan, Devavrat Shah, Olivier Lévêque: Product Multicommodity Flow in Wireless Networks CoRR abs/cs/0601012: (2006) | |

28 | Andrea Montanari, Devavrat Shah: Counting good truth assignments of random k-SAT formulae CoRR abs/cs/0607073: (2006) | |

27 | Chandra Nair, Balaji Prabhakar, Devavrat Shah: On entropy for mixtures of discrete and continuous variables CoRR abs/cs/0607075: (2006) | |

26 | Jay Kumar Sundararajan, Muriel Médard, MinJi Kim, Atilla Eryilmaz, Devavrat Shah, Ralf Koetter: Network Coding in a Multicast Switch CoRR abs/cs/0608044: (2006) | |

25 | Kyomin Jung, Devavrat Shah: Local approximate inference algorithms CoRR abs/cs/0610111: (2006) | |

24 | Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets. IEEE Transactions on Information Theory 52(11): 5111-5116 (2006) | |

23 | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6): 2508-2530 (2006) | |

22 | Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Optimal throughput-delay scaling in wireless networks: part I: the fluid model. IEEE Transactions on Information Theory 52(6): 2568-2592 (2006) | |

2005 | ||

21 | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Mixing Times for Random Walks on Geometric Random Graphs. ALENEX/ANALCO 2005: 240-249 | |

20 | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Gossip algorithms: design, analysis and applications. INFOCOM 2005: 1653-1664 | |

19 | Paolo Giaccone, Emilio Leonardi, Devavrat Shah: On the maximal throughput of networks with finite buffers and its application to buffered crossbars. INFOCOM 2005: 971-980 | |

18 | Damon Mosk-Aoyama, Devavrat Shah: Fast Distributed Algorithms for Computing Separable Functions CoRR abs/cs/0504029: (2005) | |

17 | James P. Mammen, Devavrat Shah: Throughput and Delay in Random Wireless Networks with Restricted Mobility CoRR abs/cs/0508074: (2005) | |

16 | Devavrat Shah: Max Product for Max-Weight Independent Set and Matching CoRR abs/cs/0508097: (2005) | |

15 | Mohsen Bayati, Devavrat Shah, Mayank Sharma: Maximum Weight Matching via Max-Product Belief Propagation CoRR abs/cs/0508101: (2005) | |

14 | Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah: Cell switching versus packet switching in input-queued switches. IEEE/ACM Trans. Netw. 13(4): 782-789 (2005) | |

2004 | ||

13 | Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Throughput-Delay Trade-off in Wireless Networks. INFOCOM 2004 | |

12 | Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah: Delay bounds for combined input-output switches with low speedup. Perform. Eval. 55(1-2): 113-128 (2004) | |

2003 | ||

11 | Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An Zhu: Switch Scheduling via Randomized Edge Coloring. FOCS 2003: 502- | |

10 | Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah: Input Queued Switches: Cell Switching vs. Packet Switching. INFOCOM 2003 | |

2002 | ||

9 | Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah: Load Balancing with Memory. FOCS 2002: 799-808 | |

8 | Devavrat Shah, Milind Kopikare: Delay bounds for the approximate Maximum weight matching algorithm for input queued switches. INFOCOM 2002 | |

7 | Paolo Giaccone, Balaji Prabhakar, Devavrat Shah: Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. INFOCOM 2002 | |

6 | Devavrat Shah, Paolo Giaccone, Balaji Prabhakar: Efficient Randomized Algorithms for Input-Queued Switch Scheduling. IEEE Micro 22(1): 10-18 (2002) | |

5 | Paolo Giaccone, Devavrat Shah, Balaji Prabhakar: An Implementable Parallel Scheduler for Input-Queued Switches. IEEE Micro 22(1): 19-25 (2002) | |

4 | Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown: Maintaining Statistics Counters in Router Line Cards. IEEE Micro 22(1): 76-81 (2002) | |

2001 | ||

3 | Devavrat Shah, Pankaj Gupta: Fast Updating Algorithms for TCAMs. IEEE Micro 21(1): 36-47 (2001) | |

2000 | ||

2 | Pradeep Shenoy, Jayant R. Haritsa, S. Sudarshan, Gaurav Bhalotia, Mayank Bawa, Devavrat Shah: Turbo-charging Vertical Mining of Large Databases. SIGMOD Conference 2000: 22-33 | |

1999 | ||

1 | Devavrat Shah, Laks V. S. Lakshmanan, Krithi Ramamritham, S. Sudarshan: Interestingness and Pruning of Mined Patterns. 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery 1999 |