Thomas M. Cover

Publication Activity (10 Years)

Years Active: 1965-2012
Publications (10 Years): 0

Top Topics

Lattice Structure

Artificial Neural Networks

Top Venues

Publications

Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao
A Lattice of Gambles CoRR (2012)
Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao
A lattice of gambles. ISIT (2011)
Thomas M. Cover
On the St. Petersburg paradox. ISIT (2011)
Paul Cuff, Haim H. Permuter, Thomas M. Cover
Coordination capacity. IEEE Trans. Inf. Theory 56 (9) (2010)
Paul Cuff, Haim H. Permuter, Thomas M. Cover
Coordination Capacity CoRR (2009)
Young-Han Kim, Arak Sutivong, Thomas M. Cover
State Amplification. IEEE Trans. Inf. Theory 54 (5) (2008)
Thomas M. Cover, Haim H. Permuter
Capacity of Coordinated Actions. ISIT (2007)
Thomas M. Cover, Young-Han Kim
Capacity of a Class of Deterministic Relay Channels. ISIT (2007)
Thomas M. Cover, Young-Han Kim, Arak Sutivong
Simultaneous Communication of Data and State. ISIT (2007)
Thomas M. Cover, Young-Han Kim, Arak Sutivong
Simultaneous Communication of Data and State CoRR (2007)
Thomas M. Cover, Young-Han Kim
Capacity of a Class of Deterministic Relay Channels CoRR (2006)
Charles Mathis, Thomas M. Cover
A statistic for measuring the influence of side information in investment. ISIT (2005)
Thomas M. Cover, Mung Chiang
Duality between channel capacity and rate distortion with two-sided state information CoRR (2005)
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) (2005)
Thomas M. Cover
Minimax regret portfolios for restricted stock sequences. ISIT (2004)
Thomas M. Cover, Mung Chiang
Duality between channel capacity and rate distortion with two-sided state information. IEEE Trans. Inf. Theory 48 (6) (2002)
Suhas N. Diggavi, Thomas M. Cover
The worst additive noise under a covariance constraint. IEEE Trans. Inf. Theory 47 (7) (2001)
Garud Iyengar, Thomas M. Cover
Growth optimal investment in horse race markets with costs. IEEE Trans. Inf. Theory 46 (7) (2000)
Thomas M. Cover
Comments on Broadcast Channels. IEEE Trans. Inf. Theory 44 (6) (1998)
Erik Ordentlich, Thomas M. Cover
The Cost of Achieving the Best Portfolio in Hindsight. Math. Oper. Res. 23 (4) (1998)
Elza Erkip, Thomas M. Cover
The Efficiency of Investment Information. IEEE Trans. Inf. Theory 44 (3) (1998)
Erik Ordentlich, Thomas M. Cover
On-Line Portfolio Selection. COLT (1996)
Thomas M. Cover
Universal Data Compression and Portfolio Selection. FOCS (1996)
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) (1996)
Thomas M. Cover, Erik Ordentlich
Universal portfolios with side information. IEEE Trans. Inf. Theory 42 (2) (1996)
Erik Ordentlich, Thomas M. Cover
Max-min optimal investing. CIFEr (1996)
Vittorio Castelli, Thomas M. Cover
On the exponential value of labeled samples. Pattern Recognit. Lett. 16 (1) (1995)
Sandeep Pombra, Thomas M. Cover
Non white Gaussian multiple access channels with feedback. IEEE Trans. Inf. Theory 40 (3) (1994)
Thomas M. Cover, Zhen Zhang
On the maximum entropy of the sum of two dependent random variables. IEEE Trans. Inf. Theory 40 (4) (1994)
Thomas M. Cover
Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990). IEEE Trans. Inf. Theory 40 (1) (1994)
Laura Ekroot, Thomas M. Cover
The entropy of Markov trajectories. IEEE Trans. Inf. Theory 39 (4) (1993)
William H. R. Equitz, Thomas M. Cover
Addendum to 'Successive refinement of information' (Mar 91 269-275). IEEE Trans. Inf. Theory 39 (4) (1993)
Thomas M. Cover
Learning and Generalization.(Abstract). COLT (1991)
Amir Dembo, Thomas M. Cover, Joy A. Thomas
Information theoretic inequalities. IEEE Trans. Inf. Theory 37 (6) (1991)
Andrew R. Barron, Thomas M. Cover
Minimum complexity density estimation. IEEE Trans. Inf. Theory 37 (4) (1991)
William H. R. Equitz, Thomas M. Cover
Successive refinement of information. IEEE Trans. Inf. Theory 37 (2) (1991)
Andrew R. Barron, Thomas M. Cover
Correction to 'Minimum Complexity Density Estimation'. IEEE Trans. Inf. Theory 37 (6) (1991)
Laura Ekroot, Thomas M. Cover
The entropy of a randomly stopped sequence. IEEE Trans. Inf. Theory 37 (6) (1991)
Thomas M. Cover
On the competitive optimality of Huffman codes. IEEE Trans. Inf. Theory 37 (1) (1991)
Thomas M. Cover, Sandeep Pombra
Gaussian feedback capacity. IEEE Trans. Inf. Theory 35 (1) (1989)
Andrew R. Barron, Thomas M. Cover
A bound on the financial value of information. IEEE Trans. Inf. Theory 34 (5) (1988)
Imre Csiszár, Thomas M. Cover, Byoung-Seon Choi
Conditional limit theorems under Markov conditioning. IEEE Trans. Inf. Theory 33 (6) (1987)
Alfred M. Bruckstein, Thomas M. Cover
Monotonicity of Linear Separability Under Translation. IEEE Trans. Pattern Anal. Mach. Intell. 7 (3) (1985)
Thomas M. Cover
An algorithm for maximizing expected log investment return. IEEE Trans. Inf. Theory 30 (2) (1984)
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) (1984)
Thomas M. Cover, Abbas A. El Gamal
An information - theoretic proof of Hadamard's inequality. IEEE Trans. Inf. Theory 29 (6) (1983)
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) (1982)
Abbas A. El Gamal, Thomas M. Cover
Achievable rates for multiple descriptions. IEEE Trans. Inf. Theory 28 (6) (1982)
Keith Jarett, Thomas M. Cover
Asymmetries in relativistic information flow. IEEE Trans. Inf. Theory 27 (2) (1981)
Thomas M. Cover, Robert J. McEliece, Edward C. Posner
Asynchronous multiple-access channel capacity. IEEE Trans. Inf. Theory 27 (4) (1981)
Jan M. Van Campenhout, Thomas M. Cover
Maximum entropy and conditional probability. IEEE Trans. Inf. Theory 27 (4) (1981)
Thomas M. Cover, Cyril S. K. Leung
An achievable rate region for the multiple-access channel with feedback. IEEE Trans. Inf. Theory 27 (3) (1981)
Robert M. Bell, Thomas M. Cover
Competitive Optimality of Logarithmic Investment. Math. Oper. Res. 5 (2) (1980)
Thomas M. Cover, Abbas El Gamal, Masoud Salehi
Multiple access channels with arbitrarily correlated sources. IEEE Trans. Inf. Theory 26 (6) (1980)
Thomas M. Cover, Abbas El Gamal
Capacity theorems for the relay channel. IEEE Trans. Inf. Theory 25 (5) (1979)
Thomas M. Cover
Errata. Oper. Res. 27 (1) (1979)
Sik K. Leung-Yan-Cheong, Thomas M. Cover
Some equivalences between Shannon entropy and Kolmogorov complexity. IEEE Trans. Inf. Theory 24 (3) (1978)
Thomas M. Cover, Roger C. King
A convergent gambling estimate of the entropy of English. IEEE Trans. Inf. Theory 24 (4) (1978)
Thomas M. Cover, Carroll W. Keilers
An Offensive Earned-Run Average for Baseball. Oper. Res. 25 (5) (1977)
Thomas M. Cover, Jan M. Van Campenhout
On the Possible Orderings in the Measurement Selection Problem. IEEE Trans. Syst. Man Cybern. 7 (9) (1977)
Thomas M. Cover, Aaron Shenhar
Compound Bayes Predictors for Sequences with Apparent Markov Structure. IEEE Trans. Syst. Man Cybern. 7 (6) (1977)
Thomas M. Cover, Michael A. Freedman, Martin E. Hellman
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem Inf. Control. 30 (1) (1976)
Thomas M. Cover
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.). IEEE Trans. Inf. Theory 21 (2) (1975)
Thomas M. Cover
An achievable rate region for the broadcast channel. IEEE Trans. Inf. Theory 21 (4) (1975)
Thomas M. Cover
The Best Two Independent Measurements Are Not the Two Best. IEEE Trans. Syst. Man Cybern. 4 (1) (1974)
Patrick P. Bergmans, Thomas M. Cover
Cooperative broadcasting. IEEE Trans. Inf. Theory 20 (3) (1974)
Thomas M. Cover
Enumerative source encoding. IEEE Trans. Inf. Theory 19 (1) (1973)
Thomas M. Cover
Review of five specific books on pattern recognition. IEEE Trans. Inf. Theory 19 (6) (1973)
Thomas M. Cover
Broadcast channels. IEEE Trans. Inf. Theory 18 (1) (1972)
Thomas M. Cover
Admissibility properties or Gilbert's encoding for unknown source probabilities (Corresp.). IEEE Trans. Inf. Theory 18 (1) (1972)
Thomas M. Cover, Martin E. Hellman
Finite-memory hypothesis testing-Comments on a critique (Corresp.). IEEE Trans. Inf. Theory 16 (4) (1970)
Thomas M. Cover, Martin E. Hellman
The two-armed-bandit problem with time-invariant finite memory. IEEE Trans. Inf. Theory 16 (2) (1970)
Thomas M. Cover
A Note on the Two-Armed Bandit Problem with Finite Memory Inf. Control. 12 (5/6) (1968)
Thomas M. Cover
Estimation by the nearest neighbor rule. IEEE Trans. Inf. Theory 14 (1) (1968)
Thomas M. Cover, Peter E. Hart
Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13 (1) (1967)
Thomas M. Cover
Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition. IEEE Trans. Electron. Comput. 14 (3) (1965)