default search action
Sudeep Kamath
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j5]Ibrahim Issa
, Aaron B. Wagner
An Operational Approach to Information Leakage. IEEE Trans. Inf. Theory 66(3): 1625-1657 (2020) - [c21]Sudeep Kamath, Alon Orlitsky, Venkatadheeraj Pichapati, Ehsan Zobeidi:
On Learning Parametric Non-Smooth Continuous Distributions. ISIT 2020: 2574-2579
2010 – 2019
- 2018
- [j4]Sudeep Kamath
The Two-Unicast Problem. IEEE Trans. Inf. Theory 64(5): 3865-3882 (2018) - [i6]Ibrahim Issa, Aaron B. Wagner, Sudeep Kamath:
An Operational Approach to Information Leakage. CoRR abs/1807.07878 (2018) - 2016
- [j3]Sudeep Kamath, Venkat Anantharam:
On Non-Interactive Simulation of Joint Distributions. IEEE Trans. Inf. Theory 62(6): 3419-3435 (2016) - [c20]Ibrahim Issa, Sudeep Kamath, Aaron B. Wagner:
An operational measure of information leakage. CISS 2016: 234-239 - [c19]Eun Jee Lee, Sudeep Kamath, Emmanuel Abbe, Sanjeev R. Kulkarni:
Spectral bounds for independent cascade model with sensitive edges. CISS 2016: 649-653 - [c18]Ibrahim Issa, Sudeep Kamath, Aaron B. Wagner:
Maximal leakage minimization for the Shannon cipher system. ISIT 2016: 520-524 - [c17]Sudeep Kamath, Sergio Verdú:
Estimation of entropy rate and Rényi entropy rate for Markov chains. ISIT 2016: 685-689 - 2015
- [c16]Sudeep Kamath:
Reverse hypercontractivity using information measures. Allerton 2015: 627-633 - [c15]Sudeep Kamath, Alon Orlitsky, Dheeraj Pichapati, Ananda Theertha Suresh:
On Learning Distributions from their Samples. COLT 2015: 1066-1100 - [c14]Chandra Chekuri, Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Delay-constrained unicast and the triangle-cast problem. ISIT 2015: 804-808 - [c13]Sudeep Kamath, Chandra Nair:
The strong data processing constant for sums of i.i.d. random variables. ISIT 2015: 2550-2552 - [i5]Sudeep Kamath, Venkat Anantharam:
On Non-Interactive Simulation of Joint Distributions. CoRR abs/1505.00769 (2015) - [i4]Sudeep Kamath, Venkat Anantharam, David N. C. Tse, Chih-Chun Wang:
The two-unicast problem. CoRR abs/1506.01105 (2015) - 2014
- [j2]Sudeep Kamath, D. Manjunath, Ravi Mazumdar
On Distributed Function Computation in Structure-Free Random Wireless Networks. IEEE Trans. Inf. Theory 60(1): 432-442 (2014) - [j1]Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Network Capacity Under Traffic Symmetry: Wireline and Wireless Networks. IEEE Trans. Inf. Theory 60(9): 5457-5469 (2014) - [c12]Sudeep Kamath, Young-Han Kim:
Chop and roll: Improving the cutset bound. Allerton 2014: 921-927 - [c11]Sudeep U. Kamath, David N. C. Tse, Chih-Chun Wang:
Two-unicast is hard. ISIT 2014: 2147-2151 - [c10]Venkat Anantharam, Amin Aminzadeh Gohari
On hypercontractivity and a data processing inequality. ISIT 2014: 3022-3026 - 2013
- [b1]Sudeep Kamath:
A study of some problems in network information theory. University of California, Berkeley, USA, 2013 - [c9]Venkat Anantharam, Amin Aminzadeh Gohari
On hypercontractivity and the mutual information between Boolean functions. Allerton 2013: 13-19 - [c8]Sudeep U. Kamath, David N. C. Tse:
On the Generalized Network Sharing bound and edge-cut bounds for network coding. ISIT 2013: 2735-2739 - [i3]Venkat Anantharam, Amin Aminzadeh Gohari, Sudeep Kamath, Chandra Nair:
On Maximal Correlation, Hypercontractivity, and the Data Processing Inequality studied by Erkip and Cover. CoRR abs/1304.6133 (2013) - 2012
- [c7]Sudeep Kamath, Venkat Anantharam:
Non-interactive simulation of joint distributions: The Hirschfeld-Gebelein-Rényi maximal correlation and the hypercontractivity ribbon. Allerton Conference 2012: 1057-1064 - [c6]Sudeep Kamath, Pramod Viswanath:
An information-theoretic meta-theorem on edge-cut bounds. ISIT 2012: 1657-1661 - [c5]Sudeep Kamath, Sreeram Kannan, Pramod Viswanath:
Wireless networks with symmetric demands. ISIT 2012: 2621-2625 - 2011
- [c4]Sudeep Kamath, Urs Niesen, Piyush Gupta:
The capacity per unit energy of large wireless networks. ISIT 2011: 1618-1622 - [c3]I-Hsiang Wang, Sudeep U. Kamath, David N. C. Tse:
Two unicast information flows over linear deterministic networks. ISIT 2011: 2462-2466 - [i2]I-Hsiang Wang, Sudeep U. Kamath, David N. C. Tse:
Two Unicast Information Flows over Linear Deterministic Networks. CoRR abs/1105.6326 (2011) - 2010
- [c2]Sudeep Kamath, Venkat Anantharam:
A new dual to the Gács-Körner common information defined via the Gray-Wyner system. Allerton 2010: 1340-1346
2000 – 2009
- 2008
- [c1]Sudeep Kamath, D. Manjunath:
On distributed function computation in structure-free random networks. ISIT 2008: 647-651 - [i1]Sudeep Kamath, D. Manjunath:
On Distributed Function Computation in Structure-Free Random Networks. CoRR abs/0805.0337 (2008)
Coauthor Index
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-04-24 23:06 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: