Ramesh K. Sitaraman

Loading Google Thumbnails...
2011
30Algorithms for Constructing Overlay Networks For Live Streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman. CoRR (abs/1109.4114) (2011). Web SearchBibTeXDownload
29Energy-Aware Load Balancing in Content Delivery Networks. Vimal Mathew, Ramesh K. Sitaraman, Prashant J. Shenoy. CoRR (abs/1109.5641) (2011). Web SearchBibTeXDownload
28Sharing-aware algorithms for virtual machine colocation. Michael Sindelar, Ramesh K. Sitaraman, Prashant J. Shenoy. SPAA 2011, 367-378. Web SearchBibTeXDownload
2010
27Assessing the vulnerability of replicated network services. George Dean Bissias, Brian Neil Levine, Ramesh K. Sitaraman. CoNEXT 2010, 24. Web SearchBibTeXDownload
2009
26Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices. Devesh Agrawal, Deepak Ganesan, Ramesh K. Sitaraman, Yanlei Diao, Shashi Singh. PVLDB (2): 361-372 (2009). Cited by 1Web SearchBibTeXDownload
2008
25Corrections to "on the performance benefits of multihoming route control". Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman. IEEE/ACM Trans. Netw. (16): 496 (2008). Web SearchBibTeXDownload
2003
24A measurement-based analysis of multihoming. Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman. SIGCOMM 2003, 353-364. Web SearchBibTeXDownload
23Designing overlay multicast networks for streaming. Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman. SPAA 2003, 149-158. Web SearchBibTeXDownload
2002
22Globally Distributed Content Delivery. John Dilley, Bruce M. Maggs, Jay Parikh, Harald Prokop, Ramesh K. Sitaraman, William E. Weihl. IEEE Internet Computing (6): 50-58 (2002). Web SearchBibTeXDownload
21Scheduling Time-Constrained Communication in Linear Networks. Micah Adler, Ramesh K. Sitaraman, Ramesh K. Sitaraman, Walter Unger. Theory Comput. Syst. (35): 599-623 (2002). Web SearchBibTeXDownload
2001
20Augmented Ring Networks. William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman. IEEE Trans. Parallel Distrib. Syst. (12): 598-609 (2001). Web SearchBibTeXDownload
19On the Benefit of Supporting Virtual Channels in Wormhole Routers. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. J. Comput. Syst. Sci. (62): 152-177 (2001). Web SearchBibTeXDownload
18Tree Layout for Internal Network Characterizations in Multicast Networks. Micah Adler, Tian Bu, Ramesh K. Sitaraman, Donald F. Towsley. Networked Group Communication 2001, 189-204. Web SearchBibTeXDownload
1999
17Optimal Clustering of Tree-Sweep Computations for High-Latency Parallel Environments. Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman. IEEE Trans. Parallel Distrib. Syst. (10): 813-824 (1999). Web SearchBibTeXDownload
16Simple Algorithms for Routing on Butterfly Networks with Bounded Queues. Bruce M. Maggs, Ramesh K. Sitaraman. SIAM J. Comput. (28): 984-1003 (1999). Web SearchBibTeXDownload
15Augmented Ring Networks. William Aiello, Sandeep N. Bhatt, Fan R. K. Chung, Arnold L. Rosenberg, Ramesh K. Sitaraman. SIROCCO 1999, 1-16. Web SearchBibTeX
1998
14On the Bisection Width and Expansion of Butterfly Networks. Claudson F. Bornstein, Ami Litman, Bruce M. Maggs, Ramesh K. Sitaraman, Tal Yatzkar. IPPS/SPDP 1998, 144-150. Web SearchBibTeXDownload
13On Balls and Bins with Deletions. Richard Cole, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal. RANDOM 1998, 145-158. Web SearchBibTeXDownload
12On the Fault Tolerance of Some Popular Bounded-Degree Networks. Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman. SIAM J. Comput. (27): 1303-1333 (1998). Web SearchBibTeXDownload
11Scheduling Time-Constrained Communication in Linear Networks. Micah Adler, Ramesh K. Sitaraman, Ramesh K. Sitaraman, Walter Unger. SPAA 1998, 269-278. Web SearchBibTeXDownload
10Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. 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. STOC 1998, 378-388. Web SearchBibTeXDownload
1997
9The Reconfigurable Ring of Processors: Fine-Grain Tree-Structured Computations. Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman. IEEE Trans. Computers (46): 1119-1131 (1997). Web SearchBibTeXDownload
8Reconfiguring Arrays with Faults Part I: Worst-Case Faults. Richard J. Cole, Bruce M. Maggs, Ramesh K. Sitaraman. SIAM J. Comput. (26): 1581-1611 (1997). Web SearchBibTeXDownload
1996
7On the Benefit of Supporting Virtual Channels in Wormhole Routers. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. SPAA 1996, 131-141. Web SearchBibTeX
6On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors. Lixin Gao, Arnold L. Rosenberg, Ramesh K. Sitaraman. SPAA 1996, 309-317. Web SearchBibTeX
1995
5Routing on Butterfly Networks with Random Faults. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. FOCS 1995, 558-570. Web SearchBibTeXDownload
4The Reconfigurable Ring of Processors: Efficient Algorithms via Hypercube Simulation. Arnold L. Rosenberg, Vittorio Scarano, Ramesh K. Sitaraman. Parallel Processing Letters (5): 37-48 (1995). Web SearchBibTeX
1993
3Multi-scale self-simulation: a technique for reconfiguring arrays with faults. Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman. STOC 1993, 561-572. Web SearchBibTeXDownload
1992
2On the Fault Tolerance of Some Popular Bounded-Degree Networks. Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. Sitaraman. FOCS 1992, 542-552. Web SearchBibTeXDownload
1Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract). Bruce M. Maggs, Ramesh K. Sitaraman. STOC 1992, 150-161. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research