default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamesh K. Sitaraman
- > Home > Persons > Ramesh K. Sitaraman
Publications
- 2021
[c75]Xiao Zhang
, Tanmoy Sen, Zheyuan Zhang, Tim April, Balakrishnan Chandrasekaran, David R. Choffnes, Bruce M. Maggs, Haiying Shen, Ramesh K. Sitaraman, Xiaowei Yang:
AnyOpt: predicting and optimizing IP Anycast performance. SIGCOMM 2021: 447-462- 2015
- [j26]Bruce M. Maggs, Ramesh K. Sitaraman:
Algorithmic Nuggets in Content Delivery. Comput. Commun. Rev. 45(3): 52-66 (2015) - [j25]David Gillman, Yin Lin, Bruce M. Maggs, Ramesh K. Sitaraman:
Protecting Websites from Attack with Secure Delivery Networks. Computer 48(4): 26-34 (2015) - 2011
- [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) - 2008
- [j18]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) - 2003
- [c23]Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, Anees Shaikh, Ramesh K. Sitaraman:
A measurement-based analysis of multihoming. SIGCOMM 2003: 353-364 - [c22]Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Ramesh K. Sitaraman:
Designing overlay multicast networks for streaming. SPAA 2003: 149-158 - 2002
- [j16]John Dilley, Bruce M. Maggs, Jay Parikh, Harald Prokop, Ramesh K. Sitaraman, William E. Weihl:
Globally Distributed Content Delivery. IEEE Internet Comput. 6(5): 50-58 (2002) - 2001
- [j13]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) - 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) - 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) - [c18]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 - [c17]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 - [c15]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) - 1996
- [c13]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
On the Benefit of Supporting Virtual Channels in Wormhole Routers. SPAA 1996: 131-141 - 1995
- [c10]Richard Cole, Bruce M. Maggs, Ramesh K. Sitaraman:
Routing on Butterfly Networks with Random Faults. FOCS 1995: 558-570 - 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
- [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
