default search action
Aditya Ramamoorthy
- > Home > Persons > Aditya Ramamoorthy
Publications
- 2018
- [j23]Bin Li, Aditya Ramamoorthy, R. Srikant:
Mean-Field Analysis of Coding Versus Replication in Large Data Storage Systems. ACM Trans. Model. Perform. Evaluation Comput. Syst. 3(1): 3:1-3:28 (2018) - 2016
- [c40]Bin Li, Aditya Ramamoorthy, R. Srikant:
Mean-field-analysis of coding versus replication in cloud storage systems. INFOCOM 2016: 1-9 - 2014
- [j20]Shurui Huang, Aditya Ramamoorthy:
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks. IEEE/ACM Trans. Netw. 22(1): 285-299 (2014) - 2013
- [j19]Aditya Ramamoorthy, Michael Langberg:
Communicating the Sum of Sources Over a Network. IEEE J. Sel. Areas Commun. 31(4): 655-665 (2013) - [j18]Shurui Huang, Aditya Ramamoorthy:
An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis. IEEE Trans. Commun. 61(7): 2890-2899 (2013) - [i23]Shurui Huang, Aditya Ramamoorthy:
On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks. CoRR abs/1302.4474 (2013) - 2012
- [c27]Shurui Huang, Aditya Ramamoorthy:
On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks. ITA 2012: 152-159 - 2011
- [j11]Shurui Huang, Aditya Ramamoorthy, Muriel Médard:
Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes. IEEE Trans. Inf. Theory 57(2): 1080-1091 (2011) - [c26]Shurui Huang, Aditya Ramamoorthy:
A Note on the Multiple Unicast Capacity of Directed Acyclic Networks. ICC 2011: 1-6 - [c23]Shurui Huang, Aditya Ramamoorthy:
An achievable region for the double unicast problem based on a minimum cut analysis. ITW 2011: 120-124 - [i19]Shurui Huang, Aditya Ramamoorthy:
A note on the multiple unicast capacity of directed acyclic networks. CoRR abs/1101.3285 (2011) - [i17]Shurui Huang, Aditya Ramamoorthy:
An achievable region for the double unicast problem based on a minimum cut analysis. CoRR abs/1111.0595 (2011) - 2010
- [c20]Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network; revisited. ISIT 2010: 1853-1857 - [i16]Aditya Ramamoorthy, Michael Langberg:
Communicating the sum of sources over a network. CoRR abs/1001.5319 (2010) - 2009
- [c15]Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network. ISIT 2009: 2121-2125 - [i8]Aditya Ramamoorthy, Richard D. Wesel:
The Single Source Two Terminal Network with Network Coding. CoRR abs/0908.2847 (2009) - [i6]Shurui Huang, Aditya Ramamoorthy, Muriel Médard:
Minimum cost content distribution using network coding: Replication vs. coding at the source nodes. CoRR abs/0910.2263 (2009) - 2007
- [c9]Aditya Ramamoorthy, Nedeljko Varnica:
Error Floors of LDPC Coded BICM. ICC 2007: 839-844 - 2006
- [j3]Aditya Ramamoorthy, Kamal Jain, Philip A. Chou, Michelle Effros:
Separating distributed source coding from network coding. IEEE Trans. Inf. Theory 52(6): 2785-2795 (2006) - 2005
- [j2]Aditya Ramamoorthy, Jun Shi, Richard D. Wesel:
On the capacity of network coding for random networks. IEEE Trans. Inf. Theory 51(8): 2878-2885 (2005) - 2004
- [c4]Aditya Ramamoorthy, Richard D. Wesel:
Construction of short block length irregular low-density parity-check codes. ICC 2004: 410-414 - [c3]Aditya Ramamoorthy, Richard D. Wesel:
Analysis of an algorithm for irregular LDPC code construction. ISIT 2004: 69
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-19 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint