2008 |
40 | EE | Young-Han Kim,
Arak Sutivong,
Thomas M. Cover:
State Amplification.
IEEE Transactions on Information Theory 54(5): 1850-1859 (2008) |
2007 |
39 | EE | Thomas M. Cover,
Young-Han Kim,
Arak Sutivong:
Simultaneous Communication of Data and State
CoRR abs/cs/0703005: (2007) |
2006 |
38 | EE | Thomas M. Cover,
Young-Han Kim:
Capacity of a Class of Deterministic Relay Channels
CoRR abs/cs/0611053: (2006) |
2005 |
37 | EE | Thomas M. Cover,
Mung Chiang:
Duality between channel capacity and rate distortion with two-sided state information
CoRR abs/cs/0508050: (2005) |
36 | EE | Arak Sutivong,
Mung Chiang,
Thomas M. Cover,
Young-Han Kim:
Channel capacity and state estimation for state-dependent Gaussian channels.
IEEE Transactions on Information Theory 51(4): 1486-1495 (2005) |
2002 |
35 | | Thomas M. Cover,
Mung Chiang:
Duality between channel capacity and rate distortion with two-sided state information.
IEEE Transactions on Information Theory 48(6): 1629-1638 (2002) |
2001 |
34 | | Suhas N. Diggavi,
Thomas M. Cover:
The worst additive noise under a covariance constraint.
IEEE Transactions on Information Theory 47(7): 3072-3081 (2001) |
2000 |
33 | | Garud Iyengar,
Thomas M. Cover:
Growth optimal investment in horse race markets with costs.
IEEE Transactions on Information Theory 46(7): 2675-2683 (2000) |
1998 |
32 | | Elza Erkip,
Thomas M. Cover:
The Efficiency of Investment Information.
IEEE Transactions on Information Theory 44(3): 1026-1040 (1998) |
31 | | Thomas M. Cover:
Comments on Broadcast Channels.
IEEE Transactions on Information Theory 44(6): 2524-2530 (1998) |
1996 |
30 | EE | Erik Ordentlich,
Thomas M. Cover:
On-Line Portfolio Selection.
COLT 1996: 310-313 |
29 | | Thomas M. Cover:
Universal Data Compression and Portfolio Selection.
FOCS 1996: 534-538 |
28 | | Thomas M. Cover,
Erik Ordentlich:
Universal portfolios with side information.
IEEE Transactions on Information Theory 42(2): 348-363 (1996) |
27 | | Vittorio Castelli,
Thomas M. Cover:
The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter.
IEEE Transactions on Information Theory 42(6): 2102-2117 (1996) |
1995 |
26 | EE | Vittorio Castelli,
Thomas M. Cover:
On the exponential value of labeled samples.
Pattern Recognition Letters 16(1): 105-111 (1995) |
1994 |
25 | | Thomas M. Cover:
Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990).
IEEE Transactions on Information Theory 40(1): 286- (1994) |
24 | | Sandeep Pombra,
Thomas M. Cover:
Non white Gaussian multiple access channels with feedback.
IEEE Transactions on Information Theory 40(3): 885- (1994) |
23 | | Thomas M. Cover,
Zhen Zhang:
On the maximum entropy of the sum of two dependent random variables.
IEEE Transactions on Information Theory 40(4): 1244- (1994) |
1993 |
22 | | Laura Ekroot,
Thomas M. Cover:
The entropy of Markov trajectories.
IEEE Transactions on Information Theory 39(4): 1418- (1993) |
21 | | William H. R. Equitz,
Thomas M. Cover:
Addendum to 'Successive refinement of information' (Mar 91 269-275).
IEEE Transactions on Information Theory 39(4): 1465- (1993) |
1991 |
20 | EE | Thomas M. Cover:
Learning and Generalization.(Abstract).
COLT 1991: 3 |
19 | | Thomas M. Cover:
On the competitive optimality of Huffman codes.
IEEE Transactions on Information Theory 37(1): 172- (1991) |
18 | | William H. R. Equitz,
Thomas M. Cover:
Successive refinement of information.
IEEE Transactions on Information Theory 37(2): 269-275 (1991) |
17 | | Andrew R. Barron,
Thomas M. Cover:
Minimum complexity density estimation.
IEEE Transactions on Information Theory 37(4): 1034-1054 (1991) |
16 | | Amir Dembo,
Thomas M. Cover,
Joy A. Thomas:
Information theoretic inequalities.
IEEE Transactions on Information Theory 37(6): 1501-1518 (1991) |
15 | | Laura Ekroot,
Thomas M. Cover:
The entropy of a randomly stopped sequence.
IEEE Transactions on Information Theory 37(6): 1641- (1991) |
14 | | Andrew R. Barron,
Thomas M. Cover:
Correction to 'Minimum Complexity Density Estimation'.
IEEE Transactions on Information Theory 37(6): 1738- (1991) |
1989 |
13 | | Thomas M. Cover,
Sandeep Pombra:
Gaussian feedback capacity.
IEEE Transactions on Information Theory 35(1): 37-43 (1989) |
1988 |
12 | | Andrew R. Barron,
Thomas M. Cover:
A bound on the financial value of information.
IEEE Transactions on Information Theory 34(5): 1097- (1988) |
1987 |
11 | | Imre Csiszár,
Thomas M. Cover,
Byoung-Seon Choi:
Conditional limit theorems under Markov conditioning.
IEEE Transactions on Information Theory 33(6): 788-801 (1987) |
1984 |
10 | | Thomas M. Cover:
An algorithm for maximizing expected log investment return.
IEEE Transactions on Information Theory 30(2): 369-373 (1984) |
9 | | Max H. M. Costa,
Thomas M. Cover:
On the similarity of the entropy power inequality and the Brunn-Minkowski inequality.
IEEE Transactions on Information Theory 30(6): 837- (1984) |
1983 |
8 | | Thomas M. Cover,
Abbas A. El Gamal:
An information - theoretic proof of Hadamard's inequality.
IEEE Transactions on Information Theory 29(6): 930- (1983) |
1982 |
7 | | Abbas A. El Gamal,
Thomas M. Cover:
Achievable rates for multiple descriptions.
IEEE Transactions on Information Theory 28(6): 851-857 (1982) |
1981 |
6 | | Keith Jarett,
Thomas M. Cover:
Asymmetries in relativistic information flow.
IEEE Transactions on Information Theory 27(2): 152-159 (1981) |
5 | | Thomas M. Cover,
Cyril S. K. Leung:
An achievable rate region for the multiple-access channel with feedback.
IEEE Transactions on Information Theory 27(3): 292-298 (1981) |
4 | | Thomas M. Cover,
Robert J. McEliece,
Edward C. Posner:
Asynchronous multiple-access channel capacity.
IEEE Transactions on Information Theory 27(4): 409-413 (1981) |
3 | | Jan M. Van Campenhout,
Thomas M. Cover:
Maximum entropy and conditional probability.
IEEE Transactions on Information Theory 27(4): 483-488 (1981) |
1976 |
2 | | Thomas M. Cover,
Michael A. Freedman,
Martin E. Hellman:
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem
Information and Control 30(1): 49-85 (1976) |
1968 |
1 | | Thomas M. Cover:
A Note on the Two-Armed Bandit Problem with Finite Memory
Information and Control 12(5/6): 371-377 (1968) |