Year |
Citation |
Score |
2020 |
Li Y, Shah D, Song D, Yu CL. Nearest Neighbors for Matrix Estimation Interpreted as Blind Regression for Latent Variable Model Ieee Transactions On Information Theory. 66: 1760-1784. DOI: 10.1109/Tit.2019.2950299 |
0.341 |
|
2019 |
Jung K, Lu Y, Shah D, Sharma M, Squillante MS. Revisiting Stochastic Loss Networks: Structures and Approximations Mathematics of Operations Research. 44: 890-918. DOI: 10.1287/Moor.2018.0949 |
0.401 |
|
2018 |
Bresler G, Gamarnik D, Shah D. Learning Graphical Models From the Glauber Dynamics Ieee Transactions On Information Theory. 64: 4072-4080. DOI: 10.1109/Tit.2017.2713828 |
0.317 |
|
2017 |
Negahban S, Oh S, Shah D. Rank Centrality: Ranking from Pairwise Comparisons Operations Research. 65: 266-287. DOI: 10.1287/Opre.2016.1534 |
0.393 |
|
2017 |
Sundararajan JK, Shah D, Medard M, Sadeghi P. Feedback-Based Online Network Coding Ieee Transactions On Information Theory. 63: 6628-6649. DOI: 10.1109/Tit.2017.2710192 |
0.427 |
|
2016 |
Shah D, Zaman TR. Finding Rumor Sources on Random Trees Operations Research. 64: 736-755. DOI: 10.1287/Opre.2015.1455 |
0.324 |
|
2014 |
Karger DR, Oh S, Shah D. Budget-Optimal Task Allocation for Reliable Crowdsourcing Systems Operations Research. 62: 1-24. DOI: 10.1287/Opre.2013.1235 |
0.389 |
|
2014 |
Shah D, Walton NS, Zhong YJ. Optimal queue-size scaling in switched networks Annals of Applied Probability. 24: 2207-2245. DOI: 10.1214/13-Aap970 |
0.502 |
|
2014 |
Shah D, Tsitsiklis JN, Hong YZ. Qualitative properties of α-fair policies in bandwidth-sharing networks Annals of Applied Probability. 24: 76-113. DOI: 10.1214/12-Aap915 |
0.347 |
|
2012 |
Gamarnik D, Shah D, Wei Y. Belief Propagation for Min-Cost Network Flow: Convergence and Correctness Operations Research. 60: 410-428. DOI: 10.1287/Opre.1110.1025 |
0.447 |
|
2012 |
Shah D, Shin J. Randomized Scheduling Algorithm for Queueing Networks Annals of Applied Probability. 22: 128-171. DOI: 10.1214/11-Aap763 |
0.535 |
|
2012 |
Shah D, Wischik D. Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse Annals of Applied Probability. 22: 70-127. DOI: 10.1214/11-Aap759 |
0.443 |
|
2012 |
Niesen U, Shah D, Wornell GW. Caching in Wireless Networks Ieee Transactions On Information Theory. 58: 6524-6540. DOI: 10.1109/Tit.2012.2205733 |
0.46 |
|
2012 |
Borst S, Proutiere A, Shah D. Editorial introduction (Special issue on Recent trends in the mathematics of wireless communication networks: Algorithms, models and methods) Queueing Systems. 72: 1-3. DOI: 10.1007/S11134-012-9327-5 |
0.451 |
|
2012 |
Shah D, Wischik D. Log-weight scheduling in switched networks Queueing Systems. 71: 97-136. DOI: 10.1007/S11134-012-9306-X |
0.424 |
|
2011 |
Chandrasekaran V, Chertkov M, Gamarnik D, Shah D, Shin J. Counting independent sets using the Bethe approximation Siam Journal On Discrete Mathematics. 25: 1012-1034. DOI: 10.1137/090767145 |
0.37 |
|
2011 |
Shah D, Tse DNC, Tsitsiklis JN. Hardness of low delay network scheduling Ieee Transactions On Information Theory. 57: 7810-7817. DOI: 10.1109/Tit.2011.2168897 |
0.495 |
|
2011 |
Jagabathula S, Shah D. Inferring Rankings Using Constrained Sensing Ieee Transactions On Information Theory. 57: 7288-7306. DOI: 10.1109/Tit.2011.2165827 |
0.322 |
|
2011 |
Shah D, Zaman T. Rumors in a Network: Who's the Culprit? Ieee Transactions On Information Theory. 57: 5163-5181. DOI: 10.1109/Tit.2011.2158885 |
0.414 |
|
2011 |
Jagabathula S, Shah D. Fair Scheduling in Networks Through Packet Election Ieee Transactions On Information Theory. 57: 1368-1381. DOI: 10.1109/Tit.2010.2103851 |
0.573 |
|
2011 |
Drego N, Chandrakasan A, Boning D, Shah D. Reduction of Variation-Induced Energy Overhead in Multi-Core Processors Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 30: 891-904. DOI: 10.1109/Tcad.2010.2102431 |
0.34 |
|
2011 |
Rajagopalan S, Shah D. Distributed Averaging in Dynamic Networks Ieee Journal of Selected Topics in Signal Processing. 5: 845-854. DOI: 10.1109/Jstsp.2011.2114635 |
0.496 |
|
2011 |
Shah D. Message-passing in stochastic processing networks Surveys in Operations Research and Management Science. 16: 83-104. DOI: 10.1016/J.Sorms.2011.03.002 |
0.483 |
|
2011 |
Shah D, Wischik D. Fluid models of congestion collapse in overloaded switched networks Queueing Systems. 69: 121-143. DOI: 10.1007/S11134-011-9250-1 |
0.538 |
|
2011 |
Shah D, Tsitsiklis JN, Zhong Y. Optimal scaling of average queue sizes in an input-queued switch: An open problem Queueing Systems. 68: 375-384. DOI: 10.1007/S11134-011-9234-1 |
0.382 |
|
2010 |
Mosk-Aoyama D, Roughgarden T, Shah D. Fully distributed algorithms for convex optimization problems Siam Journal On Optimization. 20: 3260-3279. DOI: 10.1137/080743706 |
0.482 |
|
2010 |
Eryilmaz A, Ozdaglar A, Shah D, Modiano E. Distributed cross-layer algorithms for the optimal control of multihop wireless networks Ieee/Acm Transactions On Networking. 18: 638-651. DOI: 10.1109/Tnet.2009.2030681 |
0.537 |
|
2010 |
Jiang L, Shah D, Shin J, Walrand J. Distributed Random Access Algorithm: Scheduling and Congestion Control Ieee Transactions On Information Theory. 56: 6182-6207. DOI: 10.1109/Tit.2010.2081490 |
0.518 |
|
2010 |
Ayaso O, Shah D, Dahleh MA. Information Theoretic Bounds for Distributed Computation Over Networks of Point-to-Point Channels Ieee Transactions On Information Theory. 56: 6020-6039. DOI: 10.1109/Tit.2010.2080850 |
0.468 |
|
2010 |
Doshi V, Shah D, Medard M, Effros M. Functional Compression Through Graph Coloring Ieee Transactions On Information Theory. 56: 3901-3917. DOI: 10.1109/Tit.2010.2050835 |
0.331 |
|
2010 |
Niesen U, Gupta P, Shah D. The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks Ieee Transactions On Information Theory. 56: 2249-2271. DOI: 10.1109/Tit.2010.2043979 |
0.384 |
|
2010 |
Jung K, Shah D, Shin J. Distributed Averaging Via Lifted Markov Chains Ieee Transactions On Information Theory. 56: 634-647. DOI: 10.1109/Tit.2009.2034777 |
0.482 |
|
2009 |
Salez J, Shah D. Belief Propagation: An Asymptotically Optimal Algorithm for the Random Assignment Problem Mathematics of Operations Research. 34: 468-480. DOI: 10.1287/Moor.1090.0380 |
0.456 |
|
2009 |
Sanghavi S, Shah D, Willsky AS. Message passing for maximum weight independent set Ieee Transactions On Information Theory. 55: 4822-4834. DOI: 10.1109/Tit.2009.2030448 |
0.414 |
|
2009 |
Niesen U, Gupta P, Shah D. On Capacity Scaling in Arbitrary Wireless Networks Ieee Transactions On Information Theory. 55: 3959-3982. DOI: 10.1109/Tit.2009.2025537 |
0.372 |
|
2009 |
Niesen U, Shah D, Wornell GW. Adaptive Alternating Minimization Algorithms Ieee Transactions On Information Theory. 55: 1423-1429. DOI: 10.1109/Tit.2008.2011442 |
0.438 |
|
2008 |
Shah D, Tsitsiklis JN. Bin packing with queues Journal of Applied Probability. 45: 922-939. DOI: 10.1239/Jap/1231340224 |
0.321 |
|
2008 |
Mosk-Aoyama D, Shah D. Fast Distributed Algorithms for Computing Separable Functions Ieee Transactions On Information Theory. 54: 2997-3007. DOI: 10.1109/Tit.2008.924648 |
0.463 |
|
2008 |
Madan R, Shah D, Leveque O. Product Multicommodity Flow in Wireless Networks Ieee Transactions On Information Theory. 54: 1460-1476. DOI: 10.1109/Tit.2008.917663 |
0.438 |
|
2008 |
Bayati M, Shah D, Sharma M. Max-product for maximum weight matching: Convergence, correctness, and LP duality Ieee Transactions On Information Theory. 54: 1241-1251. DOI: 10.1109/Tit.2007.915695 |
0.63 |
|
2008 |
Waisanen HA, Shah D, Dahleh MA. A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints Ieee Transactions On Automatic Control. 53: 1419-1433. DOI: 10.1109/Tac.2008.925849 |
0.4 |
|
2007 |
Giaccone P, Leonardi E, Shah D. Throughput Region of Finite-Buffered Networks Ieee Transactions On Parallel and Distributed Systems. 18: 251-263. DOI: 10.1109/Tpds.2007.30 |
0.487 |
|
2007 |
Mammen J, Shah D. Throughput and Delay in Random Wireless Networks With Restricted Mobility Ieee Transactions On Information Theory. 53: 1108-1116. DOI: 10.1109/Tit.2006.890720 |
0.425 |
|
2006 |
Gamal AE, Mammen J, Prabhakar B, Shah D. Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets Ieee Transactions On Information Theory. 52: 5111-5116. DOI: 10.1109/Tit.2006.883548 |
0.707 |
|
2006 |
Boyd S, Ghosh A, Prabhakar B, Shah D. Randomized gossip algorithms Ieee Transactions On Information Theory. 14: 2508-2530. DOI: 10.1109/Tit.2006.874516 |
0.733 |
|
2006 |
Gamal AE, Mammen J, Prabhakar B, Shah D. Optimal throughput-delay scaling in wireless networks: part I: the fluid model Ieee Transactions On Information Theory. 14: 2568-2592. DOI: 10.1109/Tit.2006.874379 |
0.706 |
|
2005 |
Ganjali Y, Keshavarzian A, Shah D. Cell switching versus packet switching in Input-Queued switches Ieee/Acm Transactions On Networking. 13: 782-789. DOI: 10.1109/Tnet.2005.852884 |
0.658 |
|
2004 |
Giaccone P, Leonardi E, Prabhakar B, Shah D. Delay bounds for combined input-output switches with low speedup Performance Evaluation. 55: 113-128. DOI: 10.1016/S0166-5316(03)00103-2 |
0.698 |
|
2003 |
Giaccone P, Prabhakar B, Shah D. Randomized scheduling algorithms for high-aggregate bandwidth switches Ieee Journal On Selected Areas in Communications. 21: 546-559. DOI: 10.1109/Jsac.2003.810496 |
0.721 |
|
2002 |
Shah D, Iyer S, Prahhakar B, McKeown N. Maintaining statistics counters in router line cards Ieee Micro. 22: 76-81. DOI: 10.1109/40.988692 |
0.405 |
|
2002 |
Giaccone P, Shah D, Prabhakar B. An implementable parallel scheduler for input-queued switches Ieee Micro. 22: 19-25. DOI: 10.1109/40.988686 |
0.719 |
|
2002 |
Shah D, Giaccone P, Prabhakar B. Efficient randomized algorithms for input-queued switch scheduling Ieee Micro. 22: 10-18. DOI: 10.1109/40.988685 |
0.723 |
|
2001 |
Shah D, Gupta P. Fast updating algorithms for TCAM Ieee Micro. 21: 36-47. DOI: 10.1109/40.903060 |
0.445 |
|
Show low-probability matches. |