default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas M. Cover
Person information
- affiliation: Stanford University, USA
- award (1997): IEEE Richard W. Hamming Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[i5]Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao:
A Lattice of Gambles. CoRR abs/1208.4414 (2012)- 2011
- [c11]Thomas M. Cover:
On the St. Petersburg paradox. ISIT 2011: 1758-1761 - [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)
2000 – 2009
- 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
- [b3]Thomas M. Cover, Joy A. Thomas:
Elements of information theory (2. ed.). Wiley 2006, ISBN 978-0-471-24195-9, pp. I-XXIII, 1-748 - [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) - [c6]Charles Mathis, Thomas M. Cover:
A statistic for measuring the influence of side information in investment. ISIT 2005: 1156-1157 - [i1]Thomas M. Cover, Mung Chiang:
Duality between channel capacity and rate distortion with two-sided state information. CoRR abs/cs/0508050 (2005) - 2004
- [c5]Thomas M. Cover:
Minimax regret portfolios for restricted stock sequences. ISIT 2004: 140 - 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
- [b2]Thomas M. Cover, Joy A. Thomas:
Elements of Information Theory. Wiley 2001, ISBN 9780471062592 - [j56]Suhas N. Diggavi, Thomas M. Cover:
The worst additive noise under a covariance constraint. IEEE Trans. Inf. Theory 47(7): 3072-3081 (2001) - 2000
- [j55]Garud Iyengar, Thomas M. Cover:
Growth optimal investment in horse race markets with costs. IEEE Trans. Inf. Theory 46(7): 2675-2683 (2000)
1990 – 1999
- 1998
- [j54]Erik Ordentlich, Thomas M. Cover:
The Cost of Achieving the Best Portfolio in Hindsight. Math. Oper. Res. 23(4): 960-982 (1998) - [j53]Elza Erkip, Thomas M. Cover:
The Efficiency of Investment Information. IEEE Trans. Inf. Theory 44(3): 1026-1040 (1998) - [j52]Thomas M. Cover:
Comments on Broadcast Channels. IEEE Trans. Inf. Theory 44(6): 2524-2530 (1998) - 1996
- [j51]Thomas M. Cover, Erik Ordentlich:
Universal portfolios with side information. IEEE Trans. Inf. Theory 42(2): 348-363 (1996) - [j50]Vittorio Castelli, Thomas M. Cover:
The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter. IEEE Trans. Inf. Theory 42(6): 2102-2117 (1996) - [c4]Erik Ordentlich, Thomas M. Cover:
Max-min optimal investing. CIFEr 1996: 127-133 - [c3]Erik Ordentlich, Thomas M. Cover:
On-Line Portfolio Selection. COLT 1996: 310-313 - [c2]Thomas M. Cover:
Universal Data Compression and Portfolio Selection. FOCS 1996: 534-538 - 1995
- [j49]Vittorio Castelli, Thomas M. Cover:
On the exponential value of labeled samples. Pattern Recognit. Lett. 16(1): 105-111 (1995) - 1994
- [j48]Thomas M. Cover:
Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990). IEEE Trans. Inf. Theory 40(1): 286- (1994) - [j47]Sandeep Pombra, Thomas M. Cover:
Non white Gaussian multiple access channels with feedback. IEEE Trans. Inf. Theory 40(3): 885-892 (1994) - [j46]Thomas M. Cover, Zhen Zhang:
On the maximum entropy of the sum of two dependent random variables. IEEE Trans. Inf. Theory 40(4): 1244-1246 (1994) - 1993
- [j45]Laura Ekroot, Thomas M. Cover:
The entropy of Markov trajectories. IEEE Trans. Inf. Theory 39(4): 1418-1421 (1993) - [j44]William H. R. Equitz, Thomas M. Cover:
Addendum to 'Successive refinement of information' (Mar 91 269-275). IEEE Trans. Inf. Theory 39(4): 1465- (1993) - 1991
- [j43]Thomas M. Cover:
On the competitive optimality of Huffman codes. IEEE Trans. Inf. Theory 37(1): 172-174 (1991) - [j42]William H. R. Equitz, Thomas M. Cover:
Successive refinement of information. IEEE Trans. Inf. Theory 37(2): 269-275 (1991) - [j41]Andrew R. Barron, Thomas M. Cover:
Minimum complexity density estimation. IEEE Trans. Inf. Theory 37(4): 1034-1054 (1991) - [j40]Amir Dembo, Thomas M. Cover, Joy A. Thomas:
Information theoretic inequalities. IEEE Trans. Inf. Theory 37(6): 1501-1518 (1991) - [j39]Laura Ekroot, Thomas M. Cover:
The entropy of a randomly stopped sequence. IEEE Trans. Inf. Theory 37(6): 1641-1644 (1991) - [j38]Andrew R. Barron, Thomas M. Cover:
Correction to 'Minimum Complexity Density Estimation'. IEEE Trans. Inf. Theory 37(6): 1738- (1991) - [c1]Thomas M. Cover:
Learning and Generalization.(Abstract). COLT 1991: 3
1980 – 1989
- 1989
- [j37]Thomas M. Cover, Sandeep Pombra:
Gaussian feedback capacity. IEEE Trans. Inf. Theory 35(1): 37-43 (1989) - 1988
- [j36]Andrew R. Barron, Thomas M. Cover:
A bound on the financial value of information. IEEE Trans. Inf. Theory 34(5): 1097-1100 (1988) - 1987
- [j35]Imre Csiszár, Thomas M. Cover, Byoung-Seon Choi:
Conditional limit theorems under Markov conditioning. IEEE Trans. Inf. Theory 33(6): 788-801 (1987) - 1985
- [j34]Alfred M. Bruckstein, Thomas M. Cover:
Monotonicity of Linear Separability Under Translation. IEEE Trans. Pattern Anal. Mach. Intell. 7(3): 355-358 (1985) - 1984
- [j33]Thomas M. Cover:
An algorithm for maximizing expected log investment return. IEEE Trans. Inf. Theory 30(2): 369-373 (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
- [j30]Jeremiah F. Hayes, Thomas M. Cover, Juan B. Riera:
Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms. IEEE Trans. Commun. 30(1): 152-157 (1982) - [j29]Abbas A. El Gamal, Thomas M. Cover:
Achievable rates for multiple descriptions. IEEE Trans. Inf. Theory 28(6): 851-857 (1982) - 1981
- [j28]Keith Jarett, Thomas M. Cover:
Asymmetries in relativistic information flow. IEEE Trans. Inf. Theory 27(2): 152-159 (1981) - [j27]Thomas M. Cover, Cyril S. K. Leung:
An achievable rate region for the multiple-access channel with feedback. IEEE Trans. Inf. Theory 27(3): 292-298 (1981) - [j26]Thomas M. Cover, Robert J. McEliece, Edward C. Posner:
Asynchronous multiple-access channel capacity. IEEE Trans. Inf. Theory 27(4): 409-413 (1981) - [j25]Jan M. Van Campenhout, Thomas M. Cover:
Maximum entropy and conditional probability. IEEE Trans. Inf. Theory 27(4): 483-488 (1981) - 1980
- [j24]Robert M. Bell, Thomas M. Cover:
Competitive Optimality of Logarithmic Investment. Math. Oper. Res. 5(2): 161-166 (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)
1970 – 1979
- 1979
- [j22]Thomas M. Cover:
Errata. Oper. Res. 27(1): 207 (1979) - [j21]Thomas M. Cover, Abbas El Gamal:
Capacity theorems for the relay channel. IEEE Trans. Inf. Theory 25(5): 572-584 (1979) - 1978
- [j20]Sik K. Leung-Yan-Cheong, Thomas M. Cover:
Some equivalences between Shannon entropy and Kolmogorov complexity. IEEE Trans. Inf. Theory 24(3): 331-338 (1978) - [j19]Thomas M. Cover, Roger C. King:
A convergent gambling estimate of the entropy of English. IEEE Trans. Inf. Theory 24(4): 413-421 (1978) - 1977
- [j18]Thomas M. Cover, Carroll W. Keilers:
An Offensive Earned-Run Average for Baseball. Oper. Res. 25(5): 729-740 (1977) - [j17]Thomas M. Cover, Aaron Shenhar:
Compound Bayes Predictors for Sequences with Apparent Markov Structure. IEEE Trans. Syst. Man Cybern. 7(6): 421-424 (1977) - [j16]Thomas M. Cover, Jan M. Van Campenhout:
On the Possible Orderings in the Measurement Selection Problem. IEEE Trans. Syst. Man Cybern. 7(9): 657-661 (1977) - 1976
- [b1]King-Sun Fu, Thomas M. Cover:
Digital pattern recognition. Communication and cybernetics 10, Springer 1976, ISBN 0387075119, pp. I-X, 1-206 - [j15]Thomas M. Cover, Michael A. Freedman, Martin E. Hellman:
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem. Inf. Control. 30(1): 49-85 (1976) - 1975
- [j14]Thomas M. Cover:
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.). IEEE Trans. Inf. Theory 21(2): 226-228 (1975) - [j13]Thomas M. Cover:
An achievable rate region for the broadcast channel. IEEE Trans. Inf. Theory 21(4): 399-404 (1975) - 1974
- [j12]Patrick P. Bergmans, Thomas M. Cover:
Cooperative broadcasting. IEEE Trans. Inf. Theory 20(3): 317-324 (1974) - [j11]Thomas M. Cover:
The Best Two Independent Measurements Are Not the Two Best. IEEE Trans. Syst. Man Cybern. 4(1): 116-117 (1974) - 1973
- [j10]Thomas M. Cover:
Enumerative source encoding. IEEE Trans. Inf. Theory 19(1): 73-77 (1973) - [j9]Thomas M. Cover:
Review of five specific books on pattern recognition. IEEE Trans. Inf. Theory 19(6): 827-833 (1973) - 1972
- [j8]Thomas M. Cover:
Broadcast channels. IEEE Trans. Inf. Theory 18(1): 2-14 (1972) - [j7]Thomas M. Cover:
Admissibility properties or Gilbert's encoding for unknown source probabilities (Corresp.). IEEE Trans. Inf. Theory 18(1): 216-217 (1972) - 1970
- [j6]Thomas M. Cover, Martin E. Hellman:
The two-armed-bandit problem with time-invariant finite memory. IEEE Trans. Inf. Theory 16(2): 185-195 (1970) - [j5]Thomas M. Cover, Martin E. Hellman:
Finite-memory hypothesis testing-Comments on a critique (Corresp.). IEEE Trans. Inf. Theory 16(4): 496-497 (1970)
1960 – 1969
- 1968
- [j4]Thomas M. Cover:
A Note on the Two-Armed Bandit Problem with Finite Memory. Inf. Control. 12(5/6): 371-377 (1968) - [j3]Thomas M. Cover:
Estimation by the nearest neighbor rule. IEEE Trans. Inf. Theory 14(1): 50-55 (1968) - 1967
- [j2]Thomas M. Cover, Peter E. Hart:
Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1): 21-27 (1967) - 1965
- [j1]Thomas M. Cover:
Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Trans. Electron. Comput. 14(3): 326-334 (1965)
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-05-02 21:02 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:
