Thomas M. Cover

According to our database, Thomas M. Cover authored at least 74 papers between 1965 and 2011.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2011

A lattice of gambles.

Paul Cuff, Thomas M. Cover, Gowtham Kumar, Lei Zhao

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

On the St. Petersburg paradox.

Thomas M. Cover

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Coordination capacity.

Paul Cuff, Haim H. Permuter, Thomas M. Cover

IEEE Trans. Inf. Theory, 2010

2008

State Amplification.

Young-Han Kim, Arak Sutivong, Thomas M. Cover

IEEE Trans. Inf. Theory, 2008

2007

Capacity of Coordinated Actions.

Thomas M. Cover, Haim H. Permuter

Proceedings of the IEEE International Symposium on Information Theory, 2007

Simultaneous Communication of Data and State.

Thomas M. Cover, Young-Han Kim, Arak Sutivong

Proceedings of the IEEE International Symposium on Information Theory, 2007

Capacity of a Class of Deterministic Relay Channels.

Thomas M. Cover, Young-Han Kim

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Elements of information theory (2. ed.).

Thomas M. Cover, Joy A. Thomas

Wiley, ISBN: 978-0-471-24195-9, 2006

2005

Channel capacity and state estimation for state-dependent Gaussian channels.

Arak Sutivong, Mung Chiang, Thomas M. Cover, Young-Han Kim

IEEE Trans. Inf. Theory, 2005

A statistic for measuring the influence of side information in investment.

Charles Mathis, Thomas M. Cover

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Minimax regret portfolios for restricted stock sequences.

Thomas M. Cover

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002

Duality between channel capacity and rate distortion with two-sided state information.

Thomas M. Cover, Mung Chiang

IEEE Trans. Inf. Theory, 2002

2001

The worst additive noise under a covariance constraint.

Suhas N. Diggavi, Thomas M. Cover

IEEE Trans. Inf. Theory, 2001

Elements of Information Theory.

Thomas M. Cover, Joy A. Thomas

Wiley, ISBN: 9780471200611, 2001

2000

Growth optimal investment in horse race markets with costs.

Garud Iyengar, Thomas M. Cover

IEEE Trans. Inf. Theory, 2000

1998

The Efficiency of Investment Information.

Elza Erkip, Thomas M. Cover

IEEE Trans. Inf. Theory, 1998

Comments on Broadcast Channels.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1998

The Cost of Achieving the Best Portfolio in Hindsight.

Erik Ordentlich, Thomas M. Cover

Math. Oper. Res., 1998

1996

Universal portfolios with side information.

Thomas M. Cover, Erik Ordentlich

IEEE Trans. Inf. Theory, 1996

The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter.

Vittorio Castelli, Thomas M. Cover

IEEE Trans. Inf. Theory, 1996

Universal Data Compression and Portfolio Selection.

Thomas M. Cover

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

On-Line Portfolio Selection.

Erik Ordentlich, Thomas M. Cover

Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996

Max-min optimal investing.

Erik Ordentlich, Thomas M. Cover

Proceedings of the IEEE/IAFE 1996 Conference on Computational Intelligence for Financial Engineering, 1996

1995

On the exponential value of labeled samples.

Vittorio Castelli, Thomas M. Cover

Pattern Recognit. Lett., 1995

1994

Non white Gaussian multiple access channels with feedback.

Sandeep Pombra, Thomas M. Cover

IEEE Trans. Inf. Theory, 1994

On the maximum entropy of the sum of two dependent random variables.

Thomas M. Cover, Zhen Zhang

IEEE Trans. Inf. Theory, 1994

Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990).

Thomas M. Cover

IEEE Trans. Inf. Theory, 1994

1993

Addendum to 'Successive refinement of information' (Mar 91 269-275).

William H. R. Equitz, Thomas M. Cover

IEEE Trans. Inf. Theory, 1993

The entropy of Markov trajectories.

Laura Ekroot, Thomas M. Cover

IEEE Trans. Inf. Theory, 1993

1991

Successive refinement of information.

William H. R. Equitz, Thomas M. Cover

IEEE Trans. Inf. Theory, 1991

The entropy of a randomly stopped sequence.

Laura Ekroot, Thomas M. Cover

IEEE Trans. Inf. Theory, 1991

Information theoretic inequalities.

Amir Dembo, Thomas M. Cover, Joy A. Thomas

IEEE Trans. Inf. Theory, 1991

On the competitive optimality of Huffman codes.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1991

Correction to 'Minimum Complexity Density Estimation'.

Andrew R. Barron, Thomas M. Cover

IEEE Trans. Inf. Theory, 1991

Minimum complexity density estimation.

Andrew R. Barron, Thomas M. Cover

IEEE Trans. Inf. Theory, 1991

Learning and Generalization.(Abstract).

Thomas M. Cover

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1989

Gaussian feedback capacity.

Thomas M. Cover, Sandeep Pombra

IEEE Trans. Inf. Theory, 1989

1988

A bound on the financial value of information.

Andrew R. Barron, Thomas M. Cover

IEEE Trans. Inf. Theory, 1988

1987

Conditional limit theorems under Markov conditioning.

Imre Csiszár, Thomas M. Cover, Byoung-Seon Choi

IEEE Trans. Inf. Theory, 1987

1985

Monotonicity of Linear Separability Under Translation.

Alfred M. Bruckstein, Thomas M. Cover

IEEE Trans. Pattern Anal. Mach. Intell., 1985

1984

An algorithm for maximizing expected log investment return.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1984

On the similarity of the entropy power inequality and the Brunn-Minkowski inequality.

Max H. M. Costa, Thomas M. Cover

IEEE Trans. Inf. Theory, 1984

1983

An information - theoretic proof of Hadamard's inequality.

Thomas M. Cover, Abbas A. El Gamal

IEEE Trans. Inf. Theory, 1983

1982

Achievable rates for multiple descriptions.

Abbas A. El Gamal, Thomas M. Cover

IEEE Trans. Inf. Theory, 1982

Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms.

Jeremiah F. Hayes, Thomas M. Cover, Juan B. Riera

IEEE Trans. Commun., 1982

1981

Asymmetries in relativistic information flow.

Keith Jarett, Thomas M. Cover

IEEE Trans. Inf. Theory, 1981

Asynchronous multiple-access channel capacity.

Thomas M. Cover, Robert J. McEliece, Edward C. Posner

IEEE Trans. Inf. Theory, 1981

An achievable rate region for the multiple-access channel with feedback.

Thomas M. Cover, Cyril S. K. Leung

IEEE Trans. Inf. Theory, 1981

Maximum entropy and conditional probability.

Jan M. Van Campenhout, Thomas M. Cover

IEEE Trans. Inf. Theory, 1981

1980

Multiple access channels with arbitrarily correlated sources.

Thomas M. Cover, Abbas El Gamal, Masoud Salehi

IEEE Trans. Inf. Theory, 1980

Competitive Optimality of Logarithmic Investment.

Robert M. Bell, Thomas M. Cover

Math. Oper. Res., 1980

1979

Capacity theorems for the relay channel.

Thomas M. Cover, Abbas El Gamal

IEEE Trans. Inf. Theory, 1979

Errata.

Thomas M. Cover

Oper. Res., 1979

1978

Some equivalences between Shannon entropy and Kolmogorov complexity.

Sik K. Leung-Yan-Cheong, Thomas M. Cover

IEEE Trans. Inf. Theory, 1978

A convergent gambling estimate of the entropy of English.

Thomas M. Cover, Roger C. King

IEEE Trans. Inf. Theory, 1978

1977

Compound Bayes Predictors for Sequences with Apparent Markov Structure.

Thomas M. Cover, Aaron Shenhar

IEEE Trans. Syst. Man Cybern., 1977

On the Possible Orderings in the Measurement Selection Problem.

Thomas M. Cover, Jan M. Van Campenhout

IEEE Trans. Syst. Man Cybern., 1977

An Offensive Earned-Run Average for Baseball.

Thomas M. Cover, Carroll W. Keilers

Oper. Res., 1977

1976

Optimal Finite Memory Learning Algorithms for the Finite Sample Problem

Thomas M. Cover, Michael A. Freedman, Martin E. Hellman

Inf. Control., January, 1976

Digital pattern recognition.

King-Sun Fu, Thomas M. Cover

Communication and cybernetics 10, Springer, ISBN: 0387075119, 1976

1975

An achievable rate region for the broadcast channel.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1975

A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.).

Thomas M. Cover

IEEE Trans. Inf. Theory, 1975

1974

The Best Two Independent Measurements Are Not the Two Best.

Thomas M. Cover

IEEE Trans. Syst. Man Cybern., 1974

Cooperative broadcasting.

Patrick P. Bergmans, Thomas M. Cover

IEEE Trans. Inf. Theory, 1974

1973

Review of five specific books on pattern recognition.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1973

Enumerative source encoding.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1973

1972

Admissibility properties or Gilbert's encoding for unknown source probabilities (Corresp.).

Thomas M. Cover

IEEE Trans. Inf. Theory, 1972

Broadcast channels.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1972

1970

Finite-memory hypothesis testing-Comments on a critique (Corresp.).

Thomas M. Cover, Martin E. Hellman

IEEE Trans. Inf. Theory, 1970

The two-armed-bandit problem with time-invariant finite memory.

Thomas M. Cover, Martin E. Hellman

IEEE Trans. Inf. Theory, 1970

1968

Estimation by the nearest neighbor rule.

Thomas M. Cover

IEEE Trans. Inf. Theory, 1968

A Note on the Two-Armed Bandit Problem with Finite Memory

Thomas M. Cover

Inf. Control., 1968

1967

Nearest neighbor pattern classification.

Thomas M. Cover, Peter E. Hart

IEEE Trans. Inf. Theory, 1967

1965

Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition.

Thomas M. Cover

IEEE Trans. Electron. Comput., 1965