| 2009 |
|---|
| 65 | EE | Jay Kumar Sundararajan,
Devavrat Shah,
Muriel Médard:
Feedback-based online network coding
CoRR abs/0904.1730: (2009) |
| 64 | EE | Urs Niesen,
Devavrat Shah,
Gregory W. Wornell:
Adaptive Alternating Minimization Algorithms.
IEEE Transactions on Information Theory 55(3): 1423-1429 (2009) |
| 2008 |
|---|
| 63 | EE | Shreevatsa Rajagopalan,
Devavrat Shah:
Distributed algorithm and reversible network.
CISS 2008: 498-502 |
| 62 | EE | Atilla Eryilmaz,
Asuman E. Ozdaglar,
Devavrat Shah,
Eytan Modiano:
Imperfect randomized algorithms for the optimal control of wireless networks.
CISS 2008: 932-937 |
| 61 | EE | Lara Dolecek,
Masood Qazi,
Devavrat Shah,
Anantha Chandrakasan:
Breaking the simulation barrier: SRAM evaluation through norm minimization.
ICCAD 2008: 322-329 |
| 60 | EE | Srikanth Jagabathula,
Vishal Doshi,
Devavrat Shah:
Fair Scheduling through Packet Election.
INFOCOM 2008: 301-305 |
| 59 | EE | Ramakrishna Gummadi,
Kyomin Jung,
Devavrat Shah,
Ramavarapu Sreenivas:
Feasible Rate Allocation in Wireless Networks.
INFOCOM 2008: 995-1003 |
| 58 | EE | Srikanth Jagabathula,
Devavrat Shah:
Inferring rankings under constrained sensing.
NIPS 2008: 753-760 |
| 57 | EE | Srikanth Jagabathula,
Devavrat Shah:
Optimal delay scheduling in networks with arbitrary constraints.
SIGMETRICS 2008: 395-406 |
| 56 | EE | Kyomin Jung,
Yingdong Lu,
Devavrat Shah,
Mayank Sharma,
Mark S. Squillante:
Revisiting stochastic loss networks: structures and algorithms.
SIGMETRICS 2008: 407-418 |
| 55 | EE | Jay Kumar Sundararajan,
Devavrat Shah,
Muriel Médard:
ARQ for Network Coding
CoRR abs/0802.1754: (2008) |
| 54 | EE | Urs Niesen,
Devavrat Shah,
Gregory W. Wornell:
Source Coding with Mismatched Distortion Measures
CoRR abs/0804.0635: (2008) |
| 53 | EE | 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 | EE | Sujay Sanghavi,
Devavrat Shah,
Alan S. Willsky:
Message-passing for Maximum Weight Independent Set
CoRR abs/0807.5091: (2008) |
| 51 | EE | Srikanth Jagabathula,
Devavrat Shah:
Fair Scheduling in Networks Through Packet Election
CoRR abs/0808.2530: (2008) |
| 50 | EE | Urs Niesen,
Piyush Gupta,
Devavrat Shah:
The Capacity Region of Large Wireless Networks
CoRR abs/0809.1344: (2008) |
| 49 | EE | Jay Kumar Sundararajan,
Devavrat Shah,
Muriel Médard,
Michael Mitzenmacher,
João Barros:
Network coding meets TCP
CoRR abs/0809.5022: (2008) |
| 48 | EE | 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 | EE | 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 | EE | Damon Mosk-Aoyama,
Devavrat Shah:
Fast Distributed Algorithms for Computing Separable Functions.
IEEE Transactions on Information Theory 54(7): 2997-3007 (2008) |
| 2007 |
|---|
| 45 | EE | Vishal Doshi,
Devavrat Shah,
Muriel Médard,
Sidharth Jaggi:
Distributed Functional Compression through Graph Coloring.
DCC 2007: 93-102 |
| 44 | EE | Damon Mosk-Aoyama,
Tim Roughgarden,
Devavrat Shah:
Fully Distributed Algorithms for Convex Optimization Problems.
DISC 2007: 492-493 |
| 43 | EE | 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 | EE | Devavrat Shah,
Sanjay Shakkottai:
Oblivious Routing with Mobile Fusion Centers over a Sensor Network.
INFOCOM 2007: 1541-1549 |
| 41 | EE | Mohsen Bayati,
Balaji Prabhakar,
Devavrat Shah,
Mayank Sharma:
Iterative Scheduling Algorithms.
INFOCOM 2007: 445-453 |
| 40 | EE | Kyomin Jung,
Devavrat Shah:
Local Algorithms for Approximate Inference in Minor-Excluded Graphs.
NIPS 2007 |
| 39 | EE | Sujay Sanghavi,
Devavrat Shah,
Alan S. Willsky:
Message Passing for Max-weight Independent Set.
NIPS 2007 |
| 38 | EE | Andrea Montanari,
Devavrat Shah:
Counting good truth assignments of random k-SAT formulae.
SODA 2007: 1255-1264 |
| 37 | EE | Urs Niesen,
Piyush Gupta,
Devavrat Shah:
On Capacity Scaling in Arbitrary Wireless Networks
CoRR abs/0711.2745: (2007) |
| 36 | EE | Urs Niesen,
Devavrat Shah,
Gregory W. Wornell:
Adaptive Alternating Minimization Algorithms
CoRR abs/cs/0701043: (2007) |
| 35 | EE | Paolo Giaccone,
Emilio Leonardi,
Devavrat Shah:
Throughput Region of Finite-Buffered Networks.
IEEE Trans. Parallel Distrib. Syst. 18(2): 251-263 (2007) |
| 34 | EE | 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 | EE | Urs Niesen,
Uri Erez,
Devavrat Shah,
Gregory W. Wornell:
Rateless Codes for the Gaussian Multiple Access Channel.
GLOBECOM 2006 |
| 32 | EE | Devavrat Shah,
Damon Wischik:
Optimal Scheduling Algorithms for Input-Queued Switches.
INFOCOM 2006 |
| 31 | EE | Damon Mosk-Aoyama,
Devavrat Shah:
Computing separable functions via gossip.
PODC 2006: 113-122 |
| 30 | EE | Eytan Modiano,
Devavrat Shah,
Gil Zussman:
Maximizing throughput in wireless networks via gossiping.
SIGMETRICS/Performance 2006: 27-38 |
| 29 | EE | Ritesh Madan,
Devavrat Shah,
Olivier Lévêque:
Product Multicommodity Flow in Wireless Networks
CoRR abs/cs/0601012: (2006) |
| 28 | EE | Andrea Montanari,
Devavrat Shah:
Counting good truth assignments of random k-SAT formulae
CoRR abs/cs/0607073: (2006) |
| 27 | EE | Chandra Nair,
Balaji Prabhakar,
Devavrat Shah:
On entropy for mixtures of discrete and continuous variables
CoRR abs/cs/0607075: (2006) |
| 26 | EE | 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 | EE | Kyomin Jung,
Devavrat Shah:
Local approximate inference algorithms
CoRR abs/cs/0610111: (2006) |
| 24 | EE | 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 | EE | Stephen P. Boyd,
Arpita Ghosh,
Balaji Prabhakar,
Devavrat Shah:
Randomized gossip algorithms.
IEEE Transactions on Information Theory 52(6): 2508-2530 (2006) |
| 22 | EE | 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 | EE | Stephen P. Boyd,
Arpita Ghosh,
Balaji Prabhakar,
Devavrat Shah:
Mixing Times for Random Walks on Geometric Random Graphs.
ALENEX/ANALCO 2005: 240-249 |
| 20 | EE | Stephen P. Boyd,
Arpita Ghosh,
Balaji Prabhakar,
Devavrat Shah:
Gossip algorithms: design, analysis and applications.
INFOCOM 2005: 1653-1664 |
| 19 | EE | 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 | EE | Damon Mosk-Aoyama,
Devavrat Shah:
Fast Distributed Algorithms for Computing Separable Functions
CoRR abs/cs/0504029: (2005) |
| 17 | EE | James P. Mammen,
Devavrat Shah:
Throughput and Delay in Random Wireless Networks with Restricted Mobility
CoRR abs/cs/0508074: (2005) |
| 16 | EE | Devavrat Shah:
Max Product for Max-Weight Independent Set and Matching
CoRR abs/cs/0508097: (2005) |
| 15 | EE | Mohsen Bayati,
Devavrat Shah,
Mayank Sharma:
Maximum Weight Matching via Max-Product Belief Propagation
CoRR abs/cs/0508101: (2005) |
| 14 | EE | 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 | EE | Abbas El Gamal,
James P. Mammen,
Balaji Prabhakar,
Devavrat Shah:
Throughput-Delay Trade-off in Wireless Networks.
INFOCOM 2004 |
| 12 | EE | 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 | EE | Gagan Aggarwal,
Rajeev Motwani,
Devavrat Shah,
An Zhu:
Switch Scheduling via Randomized Edge Coloring.
FOCS 2003: 502- |
| 10 | EE | Yashar Ganjali,
Abtin Keshavarzian,
Devavrat Shah:
Input Queued Switches: Cell Switching vs. Packet Switching.
INFOCOM 2003 |
| 2002 |
|---|
| 9 | EE | Michael Mitzenmacher,
Balaji Prabhakar,
Devavrat Shah:
Load Balancing with Memory.
FOCS 2002: 799-808 |
| 8 | EE | Devavrat Shah,
Milind Kopikare:
Delay bounds for the approximate Maximum weight matching algorithm for input queued switches.
INFOCOM 2002 |
| 7 | EE | Paolo Giaccone,
Balaji Prabhakar,
Devavrat Shah:
Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches.
INFOCOM 2002 |
| 6 | EE | Devavrat Shah,
Paolo Giaccone,
Balaji Prabhakar:
Efficient Randomized Algorithms for Input-Queued Switch Scheduling.
IEEE Micro 22(1): 10-18 (2002) |
| 5 | EE | Paolo Giaccone,
Devavrat Shah,
Balaji Prabhakar:
An Implementable Parallel Scheduler for Input-Queued Switches.
IEEE Micro 22(1): 19-25 (2002) |
| 4 | EE | Devavrat Shah,
Sundar Iyer,
Balaji Prabhakar,
Nick McKeown:
Maintaining Statistics Counters in Router Line Cards.
IEEE Micro 22(1): 76-81 (2002) |
| 2001 |
|---|
| 3 | EE | Devavrat Shah,
Pankaj Gupta:
Fast Updating Algorithms for TCAMs.
IEEE Micro 21(1): 36-47 (2001) |
| 2000 |
|---|
| 2 | EE | 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 | EE | 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 |
