Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ramesh K. Sitaraman
2010 – today
- 2013
[c29]Ramesh K. Sitaraman: Network performance: Does it really matter to users and by how much? COMSNETS 2013: 1-10- [c28]Jinlong Tu, Lian Lu, Minghua Chen, Ramesh K. Sitaraman: Dynamic provisioning in next-generation data centers with on-site power production. e-Energy 2013: 137-148
- [c27]Abhigyan Sharma, Arun Venkataramani, Ramesh K. Sitaraman: Distributing content simplifies ISP traffic engineering. SIGMETRICS 2013: 229-242
- [i5]Jinlong Tu, Lian Lu, Minghua Chen, Ramesh K. Sitaraman: Dynamic Provisioning in Next-Generation Data Centers with On-site Power Production. CoRR abs/1303.6775 (2013)
- 2012
- [c26]Darshan S. Palasamudram, Ramesh K. Sitaraman, Bhuvan Urgaonkar, Rahul Urgaonkar: Using batteries to reduce the power costs of internet-scale distributed networks. SoCC 2012: 11
- [c25]S. Shunmuga Krishnan, Ramesh K. Sitaraman: Video stream quality impacts viewer behavior: inferring causality using quasi-experimental designs. Internet Measurement Conference 2012: 211-224
- [c24]Vimal Mathew, Ramesh K. Sitaraman, Prashant J. Shenoy: Energy-aware load balancing in content delivery networks. INFOCOM 2012: 954-962
- [i4]Benjamin Heintz, Abhishek Chandra, Ramesh K. Sitaraman: Optimizing MapReduce for Highly Distributed Environments. CoRR abs/1207.7055 (2012)
- [i3]Abhigyan Sharma, Arun Venkataramani, Ramesh K. Sitaraman: Distributing Content Simplifies ISP Traffic Engineering. CoRR abs/1209.5715 (2012)
- 2011
- [j20]Micah Adler, Ramesh K. Sitaraman, Harish Venkataramani: Algorithms for optimizing the bandwidth cost of content delivery. Computer Networks 55(18): 4007-4020 (2011)
- [c23]Michael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy: Sharing-aware algorithms for virtual machine colocation. SPAA 2011: 367-378
- [i2]Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman: Algorithms for Constructing Overlay Networks For Live Streaming. CoRR abs/1109.4114 (2011)
- [i1]Vimal Mathew, Ramesh K. Sitaraman, Prashant J. Shenoy: Energy-Aware Load Balancing in Content Delivery Networks. CoRR abs/1109.5641 (2011)
- 2010
- [j19]Erik Nygren, Ramesh K. Sitaraman, Joel Wein: Networked systems research at Akamai. Operating Systems Review 44(3): 1 (2010)
- [j18]Erik Nygren, Ramesh K. Sitaraman, Jennifer Sun: The Akamai network: a platform for high-performance internet applications. Operating Systems Review 44(3): 2-19 (2010)
- [c22]George Dean Bissias, Brian Neil Levine, Ramesh K. Sitaraman: Assessing the vulnerability of replicated network services. CoNEXT 2010: 24
2000 – 2009
- 2009
- [j17]Devesh Agrawal, Deepak Ganesan, Ramesh K. Sitaraman, Yanlei Diao, Shashi Singh: Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices. PVLDB 2(1): 361-372 (2009)
- [c21]Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ramesh K. Sitaraman: Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks. IAT 2009: 363-370
- 2008
- [j16]Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman: Corrections to "on the performance benefits of multihoming route control". IEEE/ACM Trans. Netw. 16(2): 496 (2008)
- 2006
- [c20]Ben Carterette, James Allan, Ramesh K. Sitaraman: Minimal test collections for retrieval evaluation. SIGIR 2006: 268-275
- 2003
- [c19]Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman: A measurement-based analysis of multihoming. SIGCOMM 2003: 353-364
- [c18]Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman: Designing overlay multicast networks for streaming. SPAA 2003: 149-158
- 2002
- [j15]John Dilley, Bruce M. Maggs, Jay Parikh, Harald Prokop, Ramesh K. Sitaraman, William E. Weihl: Globally Distributed Content Delivery. IEEE Internet Computing 6(5): 50-58 (2002)
- [j14]Vijaya Ramachandran, Ramesh K. Sitaraman: SPAA 1999 - Guest Editors' Foreword. Theory Comput. Syst. 35(2): 97 (2002)
- [j13]Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. Theory Comput. Syst. 35(6): 599-623 (2002)
- 2001
- [j12]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: On the Benefit of Supporting Virtual Channels in Wormhole Routers. J. Comput. Syst. Sci. 62(1): 152-177 (2001)
- [j11]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. IEEE Trans. Parallel Distrib. Syst. 12(6): 598-609 (2001)
- [c17]Micah Adler, Tian Bu, Ramesh K. Sitaraman, Donald F. Towsley: Tree Layout for Internal Network Characterizations in Multicast Networks. Networked Group Communication 2001: 189-204
1990 – 1999
- 1999
- [j10]Bruce M. Maggs, Ramesh K. Sitaraman: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues. SIAM J. Comput. 28(3): 984-1003 (1999)
- [j9]Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. IEEE Trans. Parallel Distrib. Syst. 10(8): 813-824 (1999)
- [c16]William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman: Augmented Ring Networks. SIROCCO 1999: 1-16
- [c15]Suprakash Datta, Ramesh K. Sitaraman: Convergence and Concentration Results for packets Routing Networks. SIROCCO 1999: 78-92
- 1998
- [j8]Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman: On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM J. Comput. 27(5): 1303-1333 (1998)
- [c14]Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar: On the Bisection Width and Expansion of Butterfly Networks. IPPS/SPDP 1998: 144-150
- [c13]Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal: On Balls and Bins with Deletions. RANDOM 1998: 145-158
- [c12]Micah Adler, Ramesh K. Sitaraman, Arnold L. Rosenberg, Walter Unger: Scheduling Time-Constrained Communication in Linear Networks. SPAA 1998: 269-278
- [c11]Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf der Heide, Michael Mitzenmacher, Andréa W. Richa, Klaus Schröder, Ramesh K. Sitaraman, Berthold Vöcking: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. STOC 1998: 378-388
- 1997
- [j7]Richard J. Cole, Bruce M. Maggs, Ramesh K. Sitaraman: Reconfiguring Arrays with Faults Part I: Worst-Case Faults. SIAM J. Comput. 26(6): 1581-1611 (1997)
- [j6]Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman: The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. IEEE Trans. Computers 46(10): 1119-1131 (1997)
- [c10]Suprakash Datta, Ramesh K. Sitaraman: The Performance of Simple Routing Algorithms That Drop Packets. SPAA 1997: 159-169
- 1996
- [j5]
- [c9]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: On the Benefit of Supporting Virtual Channels in Wormhole Routers. SPAA 1996: 131-141
- [c8]Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman: On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. SPAA 1996: 309-317
- 1995
- [j4]Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman: The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. Parallel Processing Letters 5: 37-48 (1995)
- [c7]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: Routing on Butterfly Networks with Random Faults. FOCS 1995: 558-570
- 1993
- [j3]Ramesh K. Sitaraman, Niraj K. Jha: Optimal Design of Checks for Error Detection and Location in Fault-Tolerant Multiprocessor Systems. IEEE Trans. Computers 42(7): 780-793 (1993)
- [c6]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman: Multi-scale self-simulation: a technique for reconfiguring arrays with faults. STOC 1993: 561-572
- 1992
- [j2]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning programs with an easy to calculate set of errors. Fundam. Inform. 16(3-4): 355-370 (1992)
- [c5]Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman: On the Fault Tolerance of Some Popular Bounded-Degree Networks. FOCS 1992: 542-552
- [c4]Bruce M. Maggs, Ramesh K. Sitaraman: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract). STOC 1992: 150-161
- 1991
- [c3]Ramesh K. Sitaraman, Niraj K. Jha: Optimal Design of Checks for Error Detection and Location in Fault Tolerant Multiprocessors Systems. Fault-Tolerant Computing Systems 1991: 396-406
1980 – 1989
- 1989
- [j1]Ramesh K. Sitaraman, Azriel Rosenfeld: Probabilistic analysis of two stage matching. Pattern Recognition 22(3): 331-343 (1989)
- [c2]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning Programs With an Easy to Calculate Set of Errors. AII 1989: 124-137
- 1988
- [c1]William I. Gasarch, Ramesh K. Sitaraman, Carl H. Smith, Mahendran Velauthapillai: Learning Programs with an Easy to Calculate Set of Errors. COLT 1988: 242-250
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18 22:41 CEST by the dblp team