The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Devavrat Shah: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
    Mixing Times for Random Walks on Geometric Random Graphs. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:240-249 [Conf]
  2. Vishal Doshi, Devavrat Shah, Muriel Médard, Sidharth Jaggi
    Distributed Functional Compression through Graph Coloring. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:93-102 [Conf]
  3. Devavrat Shah, Laks V. S. Lakshmanan, Krithi Ramamritham, S. Sudarshan
    Interestingness and Pruning of Mined Patterns. [Citation Graph (0, 0)][DBLP]
    1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, 1999, pp:- [Conf]
  4. Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An Zhu
    Switch Scheduling via Randomized Edge Coloring. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:502-0 [Conf]
  5. Michael Mitzenmacher, Balaji Prabhakar, Devavrat Shah
    Load Balancing with Memory. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:799-808 [Conf]
  6. Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
    Gossip algorithms: design, analysis and applications. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:1653-1664 [Conf]
  7. Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah
    Throughput-Delay Trade-off in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2004, pp:- [Conf]
  8. Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah
    Input Queued Switches: Cell Switching vs. Packet Switching. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2003, pp:- [Conf]
  9. Paolo Giaccone, Emilio Leonardi, Devavrat Shah
    On the maximal throughput of networks with finite buffers and its application to buffered crossbars. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2005, pp:971-980 [Conf]
  10. Paolo Giaccone, Balaji Prabhakar, Devavrat Shah
    Towards Simple, High-performance Schedulers for High-aggregate Bandwidth Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  11. Devavrat Shah, Milind Kopikare
    Delay bounds for the approximate Maximum weight matching algorithm for input queued switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2002, pp:- [Conf]
  12. Damon Mosk-Aoyama, Devavrat Shah
    Computing separable functions via gossip. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:113-122 [Conf]
  13. Eytan Modiano, Devavrat Shah, Gil Zussman
    Maximizing throughput in wireless networks via gossiping. [Citation Graph (0, 0)][DBLP]
    SIGMETRICS/Performance, 2006, pp:27-38 [Conf]
  14. Pradeep Shenoy, Jayant R. Haritsa, S. Sudarshan, Gaurav Bhalotia, Mayank Bawa, Devavrat Shah
    Turbo-charging Vertical Mining of Large Databases. [Citation Graph (0, 7)][DBLP]
    SIGMOD Conference, 2000, pp:22-33 [Conf]
  15. Paolo Giaccone, Devavrat Shah, Balaji Prabhakar
    An Implementable Parallel Scheduler for Input-Queued Switches. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2002, v:22, n:1, pp:19-25 [Journal]
  16. Devavrat Shah, Pankaj Gupta
    Fast Updating Algorithms for TCAMs. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2001, v:21, n:1, pp:36-47 [Journal]
  17. Devavrat Shah, Paolo Giaccone, Balaji Prabhakar
    Efficient Randomized Algorithms for Input-Queued Switch Scheduling. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2002, v:22, n:1, pp:10-18 [Journal]
  18. Devavrat Shah, Sundar Iyer, Balaji Prabhakar, Nick McKeown
    Maintaining Statistics Counters in Router Line Cards. [Citation Graph (0, 0)][DBLP]
    IEEE Micro, 2002, v:22, n:1, pp:76-81 [Journal]
  19. Paolo Giaccone, Emilio Leonardi, Balaji Prabhakar, Devavrat Shah
    Delay bounds for combined input-output switches with low speedup. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 2004, v:55, n:1-2, pp:113-128 [Journal]
  20. Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, Devavrat Shah
    Randomized gossip algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2508-2530 [Journal]
  21. Abbas El Gamal, James P. Mammen, Balaji Prabhakar, Devavrat Shah
    Optimal throughput-delay scaling in wireless networks: part I: the fluid model. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:6, pp:2568-2592 [Journal]
  22. James P. Mammen, Devavrat Shah
    Throughput and Delay in Random Wireless Networks With Restricted Mobility. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:3, pp:1108-1116 [Journal]
  23. Abbas El Gamal, Mammen P. Mammen, Balaji Prabhakar, Devavrat Shah
    Optimal Throughput-Delay Scaling in Wireless Networks - Part II: Constant-Size Packets. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:11, pp:5111-5116 [Journal]
  24. Yashar Ganjali, Abtin Keshavarzian, Devavrat Shah
    Cell switching versus packet switching in input-queued switches. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Netw., 2005, v:13, n:4, pp:782-789 [Journal]
  25. Paolo Giaccone, Emilio Leonardi, Devavrat Shah
    Throughput Region of Finite-Buffered Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2007, v:18, n:2, pp:251-263 [Journal]
  26. Jay Kumar Sundararajan, Muriel Médard, Minji Kim, Atilla Eryilmaz, Devavrat Shah, Ralf Koetter
    Network Coding in a Multicast Switch. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1145-1153 [Conf]
  27. Devavrat Shah, Sanjay Shakkottai
    Oblivious Routing with Mobile Fusion Centers over a Sensor Network. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1541-1549 [Conf]
  28. Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma
    Iterative Scheduling Algorithms. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:445-453 [Conf]
  29. Devavrat Shah, Damon Wischik
    Optimal Scheduling Algorithms for Input-Queued Switches. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2006, pp:- [Conf]
  30. Andrea Montanari, Devavrat Shah
    Counting good truth assignments of random k-SAT formulae. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:1255-1264 [Conf]
  31. Damon Mosk-Aoyama, Tim Roughgarden, Devavrat Shah
    Fully Distributed Algorithms for Convex Optimization Problems. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:492-493 [Conf]
  32. Urs Niesen, Uri Erez, Devavrat Shah, Gregory W. Wornell
    Rateless Codes for the Gaussian Multiple Access Channel. [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  33. Urs Niesen, Devavrat Shah, Gregory W. Wornell
    Adaptive Alternating Minimization Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  34. Kyomin Jung, Devavrat Shah
    Local approximate inference algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  35. Ritesh Madan, Devavrat Shah, Olivier Leveque
    Product Multicommodity Flow in Wireless Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  36. Damon Mosk-Aoyama, Devavrat Shah
    Fast Distributed Algorithms for Computing Separable Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  37. Andrea Montanari, Devavrat Shah
    Counting good truth assignments of random k-SAT formulae [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  38. Chandra Nair, Balaji Prabhakar, Devavrat Shah
    On entropy for mixtures of discrete and continuous variables [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  39. Jay Kumar Sundararajan, Muriel Médard, Minji Kim, Atilla Eryilmaz, Devavrat Shah, Ralf Koetter
    Network Coding in a Multicast Switch [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  40. Loop flattening & spherical sampling: Highly efficient model reduction techniques for SRAM yield analysis. [Citation Graph (, )][DBLP]


  41. Breaking the simulation barrier: SRAM evaluation through norm minimization. [Citation Graph (, )][DBLP]


  42. Fair Scheduling through Packet Election. [Citation Graph (, )][DBLP]


  43. Feasible Rate Allocation in Wireless Networks. [Citation Graph (, )][DBLP]


  44. Network Coding Meets TCP. [Citation Graph (, )][DBLP]


  45. The Multicast Capacity Region of Large Wireless Networks. [Citation Graph (, )][DBLP]


  46. Computing the Capacity Region of a Wireless Network. [Citation Graph (, )][DBLP]


  47. Message Passing for Max-weight Independent Set. [Citation Graph (, )][DBLP]


  48. Local Algorithms for Approximate Inference in Minor-Excluded Graphs. [Citation Graph (, )][DBLP]


  49. Inferring rankings under constrained sensing. [Citation Graph (, )][DBLP]


  50. Revisiting stochastic loss networks: structures and algorithms. [Citation Graph (, )][DBLP]


  51. Optimal delay scheduling in networks with arbitrary constraints. [Citation Graph (, )][DBLP]


  52. Network adiabatic theorem: an efficient randomized protocol for contention resolution. [Citation Graph (, )][DBLP]


  53. Distributed averaging in dynamic networks. [Citation Graph (, )][DBLP]


  54. Dynamics in congestion games. [Citation Graph (, )][DBLP]


  55. Qualitative properties of alpha-weighted scheduling policies. [Citation Graph (, )][DBLP]


  56. On the flow-level dynamics of a packet-switched network. [Citation Graph (, )][DBLP]


  57. Delay optimal queue-based CSMA. [Citation Graph (, )][DBLP]


  58. Detecting sources of computer viruses in networks: theory and experiment. [Citation Graph (, )][DBLP]


  59. Belief Propagation for Min-cost Network Flow: Convergence & Correctness. [Citation Graph (, )][DBLP]


  60. Imperfect randomized algorithms for the optimal control of wireless networks. [Citation Graph (, )][DBLP]


  61. Distributed algorithm and reversible network. [Citation Graph (, )][DBLP]


  62. Distributed computation under bit constraints. [Citation Graph (, )][DBLP]


  63. Network gossip algorithms. [Citation Graph (, )][DBLP]


  64. Throughput and Delay in Random Wireless Networks with Restricted Mobility [Citation Graph (, )][DBLP]


  65. Max Product for Max-Weight Independent Set and Matching [Citation Graph (, )][DBLP]


  66. Maximum Weight Matching via Max-Product Belief Propagation [Citation Graph (, )][DBLP]


  67. On Capacity Scaling in Arbitrary Wireless Networks [Citation Graph (, )][DBLP]


  68. ARQ for Network Coding [Citation Graph (, )][DBLP]


  69. Source Coding with Mismatched Distortion Measures [Citation Graph (, )][DBLP]


  70. Online network coding for optimal throughput and delay -- the two-receiver case [Citation Graph (, )][DBLP]


  71. Message-passing for Maximum Weight Independent Set [Citation Graph (, )][DBLP]


  72. Fair Scheduling in Networks Through Packet Election [Citation Graph (, )][DBLP]


  73. The Capacity Region of Large Wireless Networks [Citation Graph (, )][DBLP]


  74. Network coding meets TCP [Citation Graph (, )][DBLP]


  75. Feedback-based online network coding [Citation Graph (, )][DBLP]


  76. Distributed Random Access Algorithm: Scheduling and Congesion Control [Citation Graph (, )][DBLP]


  77. Caching in Wireless Networks [Citation Graph (, )][DBLP]


  78. Randomized Scheduling Algorithm for Queueing Networks [Citation Graph (, )][DBLP]


  79. Distributed Averaging via Lifted Markov Chains [Citation Graph (, )][DBLP]


  80. A Simple Message-Passing Algorithm for Compressed Sensing [Citation Graph (, )][DBLP]


  81. On the Flow-level Dynamics of a Packet-switched Network [Citation Graph (, )][DBLP]


  82. Efficient Queue-based CSMA with Collisions [Citation Graph (, )][DBLP]


  83. Qualitative Properties of alpha-Weighted Scheduling Policies [Citation Graph (, )][DBLP]


  84. Belief Propagation for Min-cost Network Flow: Convergence and Correctness [Citation Graph (, )][DBLP]


  85. Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse [Citation Graph (, )][DBLP]


Search in 0.237secs, Finished in 0.239secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002