| 2013 | ||
|---|---|---|
| j43 | Vivek F. Farias, Srikanth Jagabathula, Devavrat Shah: A Nonparametric Approach to Modeling Choice with Limited Data. Management Science 59(2): 305-322 (2013) | |
| i36 | George H. Chen, Stanislav Nikolov, Devavrat Shah: A Latent Source Model for Online Time Series Classification. CoRR abs/1302.3639 (2013) | |
| 2012 | ||
| j42 | David Gamarnik, Devavrat Shah, Yehua Wei: Belief Propagation for Min-Cost Network Flow: Convergence and Correctness. Operations Research 60(2): 410-428 (2012) | |
| j41 | Devavrat Shah, Damon Wischik: Log-weight scheduling in switched networks. Queueing Syst. 71(1-2): 97-136 (2012) | |
| j40 | Devavrat Shah: Product-form distributions and network algorithms (abstract only). SIGMETRICS Performance Evaluation Review 39(4): 24 (2012) | |
| j39 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Caching in Wireless Networks. IEEE Transactions on Information Theory 58(10): 6524-6540 (2012) | |
| c71 | Peter Anthony Iannucci, Kermin Elliott Fleming, Jonathan Perry, Hari Balakrishnan, Devavrat Shah: A hardware spinal decoder. ANCS 2012: 151-162 | |
| c70 | ||
| c69 | Peter Anthony Iannucci, Jonathan Perry, Hari Balakrishnan, Devavrat Shah: No symbol left behind: a link-layer protocol for rateless codes. MOBICOM 2012: 17-28 | |
| c68 | Sahand Negahban, Sewoong Oh, Devavrat Shah: Iterative ranking from pair-wise comparisons. NIPS 2012: 2483-2491 | |
| c67 | Jonathan Perry, Peter Iannucci, Kermin Fleming, Hari Balakrishnan, Devavrat Shah: Spinal codes. SIGCOMM 2012: 49-60 | |
| c66 | Devavrat Shah, Neil Walton, Yuan Zhong: Optimal queue-size scaling in switched networks. SIGMETRICS 2012: 17-28 | |
| c65 | Devavrat Shah, Tauhid Zaman: Rumor centrality: a universal source detector. SIGMETRICS 2012: 199-210 | |
| c64 | ||
| c63 | Shreeshankar Bodas, Devavrat Shah, Damon Wischik: Congestion control meets medium access: throughput, delay, and complexity. SIGMETRICS 2012: 399-400 | |
| i35 | Hari Balakrishnan, Peter Iannucci, Jonathan Perry, Devavrat Shah: De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code. CoRR abs/1206.0418 (2012) | |
| i34 | Sahand Negahban, Sewoong Oh, Devavrat Shah: Iterative Ranking from Pair-wise Comparisons. CoRR abs/1209.1688 (2012) | |
| 2011 | ||
| j38 | Shreevatsa Rajagopalan, Devavrat Shah: Distributed Averaging in Dynamic Networks. J. Sel. Topics Signal Processing 5(4): 845-854 (2011) | |
| j37 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Szymon Jakubczak, Michael Mitzenmacher, João Barros: Network Coding Meets TCP: Theory and Implementation. Proceedings of the IEEE 99(3): 490-512 (2011) | |
| j36 | Devavrat Shah, John N. Tsitsiklis, Yuan Zhong: Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Syst. 68(3-4): 375-384 (2011) | |
| j35 | Devavrat Shah, Damon Wischik: Fluid models of congestion collapse in overloaded switched networks. Queueing Syst. 69(2): 121-143 (2011) | |
| j34 | Venkat Chandrasekaran, Misha Chertkov, David Gamarnik, Devavrat Shah, Jinwoo Shin: Counting Independent Sets Using the Bethe Approximation. SIAM J. Discrete Math. 25(2): 1012-1034 (2011) | |
| j33 | Nigel Drego, Anantha P. Chandrakasan, Duane S. Boning, Devavrat Shah: Reduction of Variation-Induced Energy Overhead in Multi-Core Processors. IEEE Trans. on CAD of Integrated Circuits and Systems 30(6): 891-904 (2011) | |
| j32 | Srikanth Jagabathula, Devavrat Shah: Fair Scheduling in Networks Through Packet Election. IEEE Transactions on Information Theory 57(3): 1368-1381 (2011) | |
| j31 | Devavrat Shah, Tauhid Zaman: Rumors in a Network: Who's the Culprit? IEEE Transactions on Information Theory 57(8): 5163-5181 (2011) | |
| j30 | Srikanth Jagabathula, Devavrat Shah: Inferring Rankings Using Constrained Sensing. IEEE Transactions on Information Theory 57(11): 7288-7306 (2011) | |
| j29 | Devavrat Shah, David N. C. Tse, John N. Tsitsiklis: Hardness of Low Delay Network Scheduling. IEEE Transactions on Information Theory 57(12): 7810-7817 (2011) | |
| c62 | Devavrat Shah: Three metrics for stochastic networks: Capacity, queue-size and complexity. COMSNETS 2011: 1-4 | |
| c61 | ||
| c60 | ||
| c59 | ||
| c58 | David R. Karger, Sewoong Oh, Devavrat Shah: Iterative Learning for Reliable Crowdsourcing Systems. NIPS 2011: 1953-1961 | |
| i33 | Devavrat Shah, Jinwoo Shin, Prasad Tetali: Efficient Distributed Medium Access. CoRR abs/1104.2380 (2011) | |
| i32 | David R. Karger, Sewoong Oh, Devavrat Shah: Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems. CoRR abs/1110.3564 (2011) | |
| i31 | Devavrat Shah, Neil Walton, Yuan Zhong: Optimal Queue-Size Scaling in Switched Networks. CoRR abs/1110.4697 (2011) | |
| 2010 | ||
| j28 | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. SIAM Journal on Optimization 20(6): 3260-3279 (2010) | |
| j27 | Kyomin Jung, Devavrat Shah, Jinwoo Shin: Distributed averaging via lifted Markov chains. IEEE Transactions on Information Theory 56(1): 634-647 (2010) | |
| j26 | Urs Niesen, Piyush Gupta, Devavrat Shah: The balanced unicast and multicast capacity regions of large wireless networks. IEEE Transactions on Information Theory 56(5): 2249-2271 (2010) | |
| j25 | Vishal Doshi, Devavrat Shah, Muriel Médard, Michelle Effros: Functional compression through graph coloring. IEEE Transactions on Information Theory 56(8): 3901-3917 (2010) | |
| j24 | Ola Ayaso, Devavrat Shah, Munther A. Dahleh: Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels. IEEE Transactions on Information Theory 56(12): 6020-6039 (2010) | |
| j23 | Libin Jiang, Devavrat Shah, Jinwoo Shin, Jean C. Walrand: Distributed Random Access Algorithm: Scheduling and Congestion Control. IEEE Transactions on Information Theory 56(12): 6182-6207 (2010) | |
| j22 | Atilla Eryilmaz, Asuman E. Ozdaglar, Devavrat Shah, Eytan Modiano: Distributed cross-layer algorithms for the optimal control of multihop wireless networks. IEEE/ACM Trans. Netw. 18(2): 638-651 (2010) | |
| c57 | Masood Qazi, Mehul Tikekar, Lara Dolecek, Devavrat Shah, Anantha Chandrakasan: Loop flattening & spherical sampling: Highly efficient model reduction techniques for SRAM yield analysis. DATE 2010: 801-806 | |
| c56 | Paolo Giaccone, Devavrat Shah: Message-Passing for Wireless Scheduling: An Experimental Study. ICCCN 2010: 1-6 | |
| c55 | Venkat Chandar, Devavrat Shah, Gregory W. Wornell: A simple message-passing algorithm for compressed sensing. ISIT 2010: 1968-1972 | |
| c54 | Ciamac Cyrus Moallemi, Devavrat Shah: On the flow-level dynamics of a packet-switched network. SIGMETRICS 2010: 83-94 | |
| c53 | ||
| c52 | Devavrat Shah, Tauhid Zaman: Detecting sources of computer viruses in networks: theory and experiment. SIGMETRICS 2010: 203-214 | |
| c51 | Devavrat Shah, John N. Tsitsiklis, Yuan Zhong: Qualitative properties of alpha-weighted scheduling policies. SIGMETRICS 2010: 239-250 | |
| c50 | Shreevatsa Rajagopalan, Devavrat Shah: Distributed averaging in dynamic networks. SIGMETRICS 2010: 369-370 | |
| c49 | ||
| c48 | David Gamarnik, Devavrat Shah, Yehua Wei: Belief Propagation for Min-cost Network Flow: Convergence & Correctness. SODA 2010: 279-292 | |
| i30 | Venkat Chandar, Devavrat Shah, Gregory W. Wornell: A Simple Message-Passing Algorithm for Compressed Sensing. CoRR abs/1001.4110 (2010) | |
| i29 | Ciamac Cyrus Moallemi, Devavrat Shah: On the Flow-level Dynamics of a Packet-switched Network. CoRR abs/1003.0929 (2010) | |
| i28 | ||
| i27 | Devavrat Shah, John N. Tsitsiklis, Yuan Zhong: Qualitative Properties of alpha-Weighted Scheduling Policies. CoRR abs/1003.5979 (2010) | |
| i26 | David Gamarnik, Devavrat Shah, Yehua Wei: Belief Propagation for Min-cost Network Flow: Convergence and Correctness. CoRR abs/1004.1586 (2010) | |
| i25 | Devavrat Shah, Damon Wischik: Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse. CoRR abs/1004.1995 (2010) | |
| i24 | Devavrat Shah, Tauhid Zaman: Community Detection in Networks: The Leader-Follower Algorithm. CoRR abs/1011.0774 (2010) | |
| 2009 | ||
| j21 | ||
| j20 | Justin Salez, Devavrat Shah: Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem. Math. Oper. Res. 34(2): 468-480 (2009) | |
| j19 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Adaptive Alternating Minimization Algorithms. IEEE Transactions on Information Theory 55(3): 1423-1429 (2009) | |
| j18 | Urs Niesen, Piyush Gupta, Devavrat Shah: On capacity scaling in arbitrary wireless networks. IEEE Transactions on Information Theory 55(9): 3959-3982 (2009) | |
| j17 | Sujay Sanghavi, Devavrat Shah, Alan S. Willsky: Message passing for maximum weight independent set. IEEE Transactions on Information Theory 55(11): 4822-4834 (2009) | |
| c47 | ||
| c46 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros: Network Coding Meets TCP. INFOCOM 2009: 280-288 | |
| c45 | Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, Ramavarapu S. Sreenivas: Computing the Capacity Region of a Wireless Network. INFOCOM 2009: 1341-1349 | |
| c44 | Urs Niesen, Piyush Gupta, Devavrat Shah: The Multicast Capacity Region of Large Wireless Networks. INFOCOM 2009: 1881-1889 | |
| c43 | Lara Dolecek, Devavrat Shah: Influence in a large society: Interplay between information dynamics and network structure. ISIT 2009: 1574-1578 | |
| c42 | ||
| c41 | Vivek F. Farias, Srikanth Jagabathula, Devavrat Shah: A Data-Driven Approach to Modeling Choice. NIPS 2009: 504-512 | |
| c40 | Kyomin Jung, Pushmeet Kohli, Devavrat Shah: Local Rules for Global MAP: When Do They Work ? NIPS 2009: 871-879 | |
| c39 | Shreevatsa Rajagopalan, Devavrat Shah, Jinwoo Shin: Network adiabatic theorem: an efficient randomized protocol for contention resolution. SIGMETRICS/Performance 2009: 133-144 | |
| i23 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard: Feedback-based online network coding. CoRR abs/0904.1730 (2009) | |
| i22 | Libin Jiang, Devavrat Shah, Jinwoo Shin, Jean C. Walrand: Distributed Random Access Algorithm: Scheduling and Congesion Control. CoRR abs/0907.1266 (2009) | |
| i21 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Caching in Wireless Networks. CoRR abs/0908.1916 (2009) | |
| i20 | Devavrat Shah, Jinwoo Shin: Randomized Scheduling Algorithm for Queueing Networks. CoRR abs/0908.3670 (2009) | |
| i19 | Kyomin Jung, Devavrat Shah, Jinwoo Shin: Distributed Averaging via Lifted Markov Chains. CoRR abs/0908.4073 (2009) | |
| 2008 | ||
| j16 | Holly A. Waisanen, Devavrat Shah, Munther A. Dahleh: A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints. IEEE Trans. Automat. Contr. 53(6): 1419-1433 (2008) | |
| j15 | 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) | |
| j14 | Ritesh Madan, Devavrat Shah, Olivier Lévêque: Product Multicommodity Flow in Wireless Networks. IEEE Transactions on Information Theory 54(4): 1460-1476 (2008) | |
| j13 | Damon Mosk-Aoyama, Devavrat Shah: Fast Distributed Algorithms for Computing Separable Functions. IEEE Transactions on Information Theory 54(7): 2997-3007 (2008) | |
| c38 | Ola Ayaso, Devavrat Shah, Munther A. Dahleh: Distributed computation under bit constraints. CDC 2008: 4837-4842 | |
| c37 | Shreevatsa Rajagopalan, Devavrat Shah: Distributed algorithm and reversible network. CISS 2008: 498-502 | |
| c36 | Atilla Eryilmaz, Asuman E. Ozdaglar, Devavrat Shah, Eytan Modiano: Imperfect randomized algorithms for the optimal control of wireless networks. CISS 2008: 932-937 | |
| c35 | Lara Dolecek, Masood Qazi, Devavrat Shah, Anantha Chandrakasan: Breaking the simulation barrier: SRAM evaluation through norm minimization. ICCAD 2008: 322-329 | |
| c34 | Srikanth Jagabathula, Vishal Doshi, Devavrat Shah: Fair Scheduling through Packet Election. INFOCOM 2008: 301-305 | |
| c33 | Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, Ramavarapu S. Sreenivas: Feasible Rate Allocation in Wireless Networks. INFOCOM 2008: 995-1003 | |
| c32 | Urs Niesen, Piyush Gupta, Devavrat Shah: Hierarchical cooperation for arbitrary wireless networks. ISIT 2008: 181-185 | |
| c31 | Ola Ayaso, Devavrat Shah, Munther A. Dahleh: Counting bits for distributed function computation. ISIT 2008: 652-656 | |
| c30 | ||
| c29 | Srikanth Jagabathula, Devavrat Shah: Inferring rankings under constrained sensing. NIPS 2008: 753-760 | |
| c28 | Srikanth Jagabathula, Devavrat Shah: Optimal delay scheduling in networks with arbitrary constraints. SIGMETRICS 2008: 395-406 | |
| c27 | Kyomin Jung, Yingdong Lu, Devavrat Shah, Mayank Sharma, Mark S. Squillante: Revisiting stochastic loss networks: structures and algorithms. SIGMETRICS 2008: 407-418 | |
| i18 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard: ARQ for Network Coding. CoRR abs/0802.1754 (2008) | |
| i17 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Source Coding with Mismatched Distortion Measures. CoRR abs/0804.0635 (2008) | |
| i16 | 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) | |
| i15 | Sujay Sanghavi, Devavrat Shah, Alan S. Willsky: Message-passing for Maximum Weight Independent Set. CoRR abs/0807.5091 (2008) | |
| i14 | Srikanth Jagabathula, Devavrat Shah: Fair Scheduling in Networks Through Packet Election. CoRR abs/0808.2530 (2008) | |
| i13 | Urs Niesen, Piyush Gupta, Devavrat Shah: The Capacity Region of Large Wireless Networks. CoRR abs/0809.1344 (2008) | |
| i12 | Jay Kumar Sundararajan, Devavrat Shah, Muriel Médard, Michael Mitzenmacher, João Barros: Network coding meets TCP. CoRR abs/0809.5022 (2008) | |
| 2007 | ||
| j12 | 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) | |
| j11 | Paolo Giaccone, Emilio Leonardi, Devavrat Shah: Throughput Region of Finite-Buffered Networks. IEEE Trans. Parallel Distrib. Syst. 18(2): 251-263 (2007) | |
| c26 | Vishal Doshi, Devavrat Shah, Muriel Médard, Sidharth Jaggi: Distributed Functional Compression through Graph Coloring. DCC 2007: 93-102 | |
| c25 | Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma: Iterative Scheduling Algorithms. INFOCOM 2007: 445-453 | |
| c24 | Jay Kumar Sundararajan, Muriel Médard, MinJi Kim, Atilla Eryilmaz, Devavrat Shah, Ralf Koetter: Network Coding in a Multicast Switch. INFOCOM 2007: 1145-1153 | |
| c23 | Devavrat Shah, Sanjay Shakkottai: Oblivious Routing with Mobile Fusion Centers over a Sensor Network. INFOCOM 2007: 1541-1549 | |
| c22 | Kyomin Jung, Devavrat Shah: Local Algorithms for Approximate Inference in Minor-Excluded Graphs. NIPS 2007 | |
| c21 | Sujay Sanghavi, Devavrat Shah, Alan S. Willsky: Message Passing for Max-weight Independent Set. NIPS 2007 | |
| c20 | Andrea Montanari, Devavrat Shah: Counting good truth assignments of random k-SAT formulae. SODA 2007: 1255-1264 | |
| c19 | Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah: Fully Distributed Algorithms for Convex Optimization Problems. DISC 2007: 492-493 | |
| i11 | Urs Niesen, Piyush Gupta, Devavrat Shah: On Capacity Scaling in Arbitrary Wireless Networks. CoRR abs/0711.2745 (2007) | |
| i10 | Urs Niesen, Devavrat Shah, Gregory W. Wornell: Adaptive Alternating Minimization Algorithms. CoRR abs/cs/0701043 (2007) | |
| 2006 | ||
| j10 | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6): 2508-2530 (2006) | |
| j9 | 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) | |
| j8 | 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) | |
| c18 | Urs Niesen, Uri Erez, Devavrat Shah, Gregory W. Wornell: Rateless Codes for the Gaussian Multiple Access Channel. GLOBECOM 2006 | |
| c17 | ||
| c16 | ||
| c15 | Eytan Modiano, Devavrat Shah, Gil Zussman: Maximizing throughput in wireless networks via gossiping. SIGMETRICS/Performance 2006: 27-38 | |
| i9 | Ritesh Madan, Devavrat Shah, Olivier Lévêque: Product Multicommodity Flow in Wireless Networks. CoRR abs/cs/0601012 (2006) | |
| i8 | Andrea Montanari, Devavrat Shah: Counting good truth assignments of random k-SAT formulae. CoRR abs/cs/0607073 (2006) | |
| i7 | Chandra Nair, Balaji Prabhakar, Devavrat Shah: On entropy for mixtures of discrete and continuous variables. CoRR abs/cs/0607075 (2006) | |
| i6 | 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) | |
| i5 | ||
| 2005 | ||
| j7 | Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah: Cell switching versus packet switching in input-queued switches. IEEE/ACM Trans. Netw. 13(4): 782-789 (2005) | |
| c14 | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Mixing Times for Random Walks on Geometric Random Graphs. ALENEX/ANALCO 2005: 240-249 | |
| c13 | 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 | |
| c12 | Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah: Gossip algorithms: design, analysis and applications. INFOCOM 2005: 1653-1664 | |
| i4 | Damon Mosk-Aoyama, Devavrat Shah: Fast Distributed Algorithms for Computing Separable Functions. CoRR abs/cs/0504029 (2005) | |
| i3 | James P. Mammen, Devavrat Shah: Throughput and Delay in Random Wireless Networks with Restricted Mobility. CoRR abs/cs/0508074 (2005) | |
| i2 | ||
| i1 | Mohsen Bayati, Devavrat Shah, Mayank Sharma: Maximum Weight Matching via Max-Product Belief Propagation. CoRR abs/cs/0508101 (2005) | |
| 2004 | ||
| j6 | 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) | |
| c11 | Neha Kumar, Rong Pan, Devavrat Shah: Fair scheduling in input-queued switches under inadmissible traffic. GLOBECOM 2004: 1713-1717 | |
| c10 | Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah: Throughput-Delay Trade-off in Wireless Networks. INFOCOM 2004 | |
| 2003 | ||
| j5 | Paolo Giaccone, Balaji Prabhakar, Devavrat Shah: Randomized scheduling algorithms for high-aggregate bandwidth switches. IEEE Journal on Selected Areas in Communications 21(4): 546-559 (2003) | |
| c9 | Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An Zhu: Switch Scheduling via Randomized Edge Coloring. FOCS 2003: 502-512 | |
| c8 | ||
| c7 | Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah: Input Queued Switches: Cell Switching vs. Packet Switching. INFOCOM 2003 | |
| 2002 | ||
| j4 | Devavrat Shah, Paolo Giaccone, Balaji Prabhakar: Efficient Randomized Algorithms for Input-Queued Switch Scheduling. IEEE Micro 22(1): 10-18 (2002) | |
| j3 | Paolo Giaccone, Devavrat Shah, Balaji Prabhakar: An Implementable Parallel Scheduler for Input-Queued Switches. IEEE Micro 22(1): 19-25 (2002) | |
| j2 | Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown: Maintaining Statistics Counters in Router Line Cards. IEEE Micro 22(1): 76-81 (2002) | |
| c6 | Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah: Load Balancing with Memory. FOCS 2002: 799-808 | |
| c5 | Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah: Delay performance of high-speed packet switches with low speedup. GLOBECOM 2002: 2629-2633 | |
| c4 | Paolo Giaccone, Balaji Prabhakar, Devavrat Shah: Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. INFOCOM 2002 | |
| c3 | Devavrat Shah, Milind Kopikare: Delay bounds for the approximate Maximum weight matching algorithm for input queued switches. INFOCOM 2002 | |
| 2001 | ||
| j1 | ||
| 2000 | ||
| c2 | 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 | ||
| c1 | 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 | |
Colors in the list of coauthors
Last update Sat May 25 04:21:28 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page