default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas M. Cover
- > Home > Persons > Thomas M. Cover
Publications
- 2012
[i5]Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao:
A Lattice of Gambles. CoRR abs/1208.4414 (2012)- 2011
- [c10]Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao:
A lattice of gambles. ISIT 2011: 1762-1766 - 2010
- [j60]Paul Cuff, Haim H. Permuter
, Thomas M. Cover:
Coordination capacity. IEEE Trans. Inf. Theory 56(9): 4181-4206 (2010) - 2009
- [i4]Paul Cuff, Haim H. Permuter, Thomas M. Cover:
Coordination Capacity. CoRR abs/0909.2408 (2009) - 2008
- [j59]Young-Han Kim, Arak Sutivong, Thomas M. Cover:
State Amplification. IEEE Trans. Inf. Theory 54(5): 1850-1859 (2008) - 2007
- [c9]Thomas M. Cover, Young-Han Kim:
Capacity of a Class of Deterministic Relay Channels. ISIT 2007: 591-595 - [c8]Thomas M. Cover, Young-Han Kim, Arak Sutivong:
Simultaneous Communication of Data and State. ISIT 2007: 916-920 - [c7]Thomas M. Cover, Haim H. Permuter:
Capacity of Coordinated Actions. ISIT 2007: 2701-2705 - [i3]Thomas M. Cover, Young-Han Kim, Arak Sutivong:
Simultaneous Communication of Data and State. CoRR abs/cs/0703005 (2007) - 2006
- [i2]Thomas M. Cover, Young-Han Kim:
Capacity of a Class of Deterministic Relay Channels. CoRR abs/cs/0611053 (2006) - 2005
- [j58]Arak Sutivong, Mung Chiang, Thomas M. Cover, Young-Han Kim:
Channel capacity and state estimation for state-dependent Gaussian channels. IEEE Trans. Inf. Theory 51(4): 1486-1495 (2005) - [i1]Thomas M. Cover, Mung Chiang:
Duality between channel capacity and rate distortion with two-sided state information. CoRR abs/cs/0508050 (2005) - 2002
- [j57]Thomas M. Cover, Mung Chiang:
Duality between channel capacity and rate distortion with two-sided state information. IEEE Trans. Inf. Theory 48(6): 1629-1638 (2002) - 2001
- [j56]Suhas N. Diggavi, Thomas M. Cover:
The worst additive noise under a covariance constraint. IEEE Trans. Inf. Theory 47(7): 3072-3081 (2001) - 1984
- [j32]Max H. M. Costa, Thomas M. Cover:
On the similarity of the entropy power inequality and the Brunn-Minkowski inequality. IEEE Trans. Inf. Theory 30(6): 837-839 (1984) - 1983
- [j31]Thomas M. Cover, Abbas A. El Gamal:
An information - theoretic proof of Hadamard's inequality. IEEE Trans. Inf. Theory 29(6): 930-931 (1983) - 1982
- [j29]Abbas A. El Gamal, Thomas M. Cover:
Achievable rates for multiple descriptions. IEEE Trans. Inf. Theory 28(6): 851-857 (1982) - 1980
- [j23]Thomas M. Cover, Abbas El Gamal, Masoud Salehi:
Multiple access channels with arbitrarily correlated sources. IEEE Trans. Inf. Theory 26(6): 648-657 (1980) - 1979
- [j21]Thomas M. Cover, Abbas El Gamal:
Capacity theorems for the relay channel. IEEE Trans. Inf. Theory 25(5): 572-584 (1979)
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-05-02 21:48 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:
