Thomas M. Cover | Academic Influence

Thomas M. Cover's AcademicInfluence.com Rankings

Thomas M. Cover

Computer Science

#349

World Rank

#362

Historical Rank

#200

USA Rank

Information Theory

#3

World Rank

#4

Historical Rank

#2

USA Rank

computer-science Degrees

Thomas M. Cover

Mathematics

#1002

World Rank

#1726

Historical Rank

#435

USA Rank

Probability Theory

#14

World Rank

#28

Historical Rank

#6

USA Rank

Measure Theory

#100

World Rank

#159

Historical Rank

#50

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Thomas M. Cover's Degrees

PhD Electrical Engineering Stanford University
Masters Electrical Engineering Stanford University
Bachelors Electrical Engineering Stanford University

Why Is Thomas M. Cover Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Thomas M. Cover [ˈkoʊvər] was an American information theorist and professor jointly in the Departments of Electrical Engineering and Statistics at Stanford University. He devoted almost his entire career to developing the relationship between information theory and statistics.

(See a Problem?)

Thomas M. Cover's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Elements of Information Theory (1991) (45155)
Nearest neighbor pattern classification (1967) (11724)
Capacity theorems for the relay channel (1979) (4311)
Elements of information theory (2. ed.) (2006) (2338)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing) (2006) (1965)
Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition (1965) (1926)
Network Information Theory (2001) (1512)
Elements of Information Theory: Cover/Elements of Information Theory, Second Edition (2005) (1158)
Broadcast channels (1972) (859)
Information theoretic inequalities (1991) (676)
Achievable rates for multiple descriptions (1982) (664)
Universal Portfolios (1996) (575)
Successive refinement of information (1991) (559)
Minimum complexity density estimation (1991) (537)
Enumerative source encoding (1973) (453)
Rate Distortion Theory (2001) (419)
Multiple access channels with arbitrarily correlated sources (1980) (419)
A proof of the data compression theorem of Slepian and Wolf for ergodic sources (Corresp.) (1975) (400)
The worst additive noise under a covariance constraint (2001) (370)
Universal portfolios with side information (1996) (355)
Comments on Broadcast Channels (1998) (353)
Asymptotic optimality and asymptotic equipartition properties of log-optimum investment (1988) (327)
Estimation by the nearest neighbor rule (1968) (321)
On the Possible Orderings in the Measurement Selection Problem (1977) (290)
An achievable rate region for the multiple-access channel with feedback (1981) (278)
The Best Two Independent Measurements Are Not the Two Best (1974) (265)
On the exponential value of labeled samples (1995) (241)
The relative value of labeled and unlabeled samples in pattern recognition with an unknown mixing parameter (1996) (236)
Maximum entropy and conditional probability (1981) (224)
Duality between channel capacity and rate distortion with two-sided state information (2002) (216)
A convergent gambling estimate of the entropy of English (1978) (213)
Coordination Capacity (2009) (209)
Gaussian feedback capacity (1989) (205)
Cooperative broadcasting (1974) (200)
A sandwich proof of the Shannon-McMillan-Breiman theorem (1988) (195)
An achievable rate region for the broadcast channel (1975) (186)
Multiple user information theory (1980) (185)
Capacity theorems for relay channels (1979) (168)
Competitive Optimality of Logarithmic Investment (1980) (168)
Digital pattern recognition (1980) (168)
An algorithm for maximizing expected log investment return (1984) (142)
Probability and Information. (1984) (134)
Open Problems in Communication and Computation (2011) (130)
Hypothesis Testing with Finite Statistics (1969) (128)
Some equivalences between Shannon entropy and Kolmogorov complexity (1978) (119)
Behavior of sequential predictors of binary sequences (1965) (118)
Some Advances in Broadcast Channels (1975) (114)
Channel capacity and state estimation for state-dependent Gaussian channels (2005) (105)
Learning with Finite Memory (1970) (104)
Conditional limit theorems under Markov conditioning (1987) (103)
KOLMOGOROV'S CONTRIBUTIONS TO INFORMATION THEORY AND ALGORITHMIC COMPLEXITY (1989) (97)
Game-theoretic optimal portfolios (1988) (96)
The Cost of Achieving the Best Portfolio in Hindsight (1998) (95)
State Amplification (2007) (93)
The two-armed-bandit problem with time-invariant finite memory (1970) (92)
On the similarity of the entropy power inequality and the Brunn-Minkowski inequality (1984) (86)
Asynchronous multiple-access channel capacity (1981) (85)
Determinant inequalities via information theory (1988) (82)
Writing on colored paper (2001) (78)
Entropy, Relative Entropy and Mutual Information (2001) (78)
The Efficiency of Investment Information (1998) (77)
Empirical Bayes stock market portfolios (1986) (67)
The Entropy Of Markov Trajectories (1991) (63)
A bound on the financial value of information (1988) (62)
Optimal Sequence Detection and Optimal Symbol-by-Symbol Detection: Similar Algorithms (1982) (60)
Learning and generalization (1991) (59)
On-line portfolio selection (1996) (57)
Communication in networks for coordinating behavior (2009) (53)
LEARNING IN PATTERN RECOGNITION (1969) (52)
The relative value of labeled and unlabeled samples in pattern recognition (1993) (50)
An information-theoretic proof of Burg's maximum entropy spectrum (1984) (49)
Geometrical Probability and Random Points on a Hypersphere (1967) (48)
On Determining the Irrationality of the Mean of a Random Variable (1973) (46)
On the maximum entropy of the sum of two dependent random variables (1994) (44)
On the St. Petersburg paradox (2011) (44)
Maximum Entropy and the Lottery (1989) (44)
Elements of Information Theory 2006 (2009) (41)
An Offensive Earned-Run Average for Baseball (1977) (39)
On Memory Saved by Randomization (1971) (38)
A Note on the Two-Armed Bandit Problem with Finite Memory (1968) (37)
Universal data compression and portfolio selection (1996) (34)
Compound Bayes Predictors for Sequences with Apparent Markov Structure (1977) (33)
Growth optimal investment in horse race markets with costs (2000) (30)
Kolmogorov Complexity, Data Compression, and Inference (1985) (30)
Non white Gaussian multiple access channels with feedback (1994) (27)
Unified duality between channel capacity and rate distortion with state information (2001) (26)
Admissibility properties or Gilbert's encoding for unknown source probabilities (Corresp.) (1972) (26)
Pick the Largest Number (1987) (26)
An information - theoretic proof of Hadamard's inequality (1983) (25)
The Capacity of the Relay Channel (1987) (23)
Rate vs. distortion trade-off for channels with state information (2002) (21)
Optimal Finite Memory Learning Algorithms for the Finite Sample Problem (1976) (20)
A HIERARCHY OF PROBABILITY DENSITY FUNCTION ESTIMATES (1972) (20)
Capacity of Coordinated Actions (2007) (19)
The entropy of a randomly stopped sequence (1991) (19)
THE NUMBER OF LINEARLY INDUCIBLE ORDERINGS OF POINTS IN d-SPACE* (1967) (19)
On the competitive optimality of Huffman codes (1991) (19)
Universal portfolios with short sales and margin (1998) (18)
Admissibility Properties of Gilbert ’ s Encoding for Unknown Source Probabilities (1998) (17)
Topics in Statistical Pattern Recognition (1980) (16)
Introduction and Preview (2001) (16)
Tradeoff between message and state information rates (2001) (14)
Differential Entropy (2014) (14)
Asymmetries in relativistic information flow (1981) (14)
Simultaneous Communication of Data and State (2007) (13)
Geometrical andStatistical Properties ofSystems of Linear Inequalities withApplications inPattern Recognition (1965) (12)
Finite-memory hypothesis testing-Comments on a critique (Corresp.) (1970) (12)
Addendum to 'Successive refinement of information' (Mar 91 269-275) (1993) (11)
Discussion: Consistent Nonparametric Regression (1977) (10)
Information theory and statistics (1994) (10)
Matrix completion fundamental limits and efficient algorithms (2010) (9)
Conjecture: Feedback doesn’t Help Much (1987) (9)
Universal Portfolios with Side Infor . (1996) (9)
Channel Capacity and State Estimation for (2005) (8)
Universal investment and universal data compression (1996) (8)
The Role of Feedback in Communication (1988) (7)
Chapter 2 Entropy , Relative Entropy and Mutual (7)
Is maximum entropy noise the worst? (1997) (6)
Review of five specific books on pattern recognition (1973) (6)
The Probability that a Random Game is Unfair (1966) (6)
A lattice of gambles (2011) (6)
Correction to 'Minimum Complexity Density Estimation' (1991) (6)
Classification rules in the unknown mixture parameter case: relative value of labeled and unlabeled samples (1994) (6)
A FINITE MEMORY TEST OF THE IRRATIONALITY OF THE PARAMETER OF A COIN (1975) (5)
Minimax regret portfolios for restricted stock sequences (2004) (5)
Performance of universal portfolios in the stock market (2000) (5)
Comments on broadcast channels (invited paper) (2000) (5)
Asymptotic Equipartition Property (2005) (5)
Universal portfolios with memory (1994) (4)
A Proof of Burg’s Theorem (1987) (4)
Universal Source Coding (2005) (3)
Entropy Rates of a Stochastic Process (2001) (3)
Gambling and Data Compression (2001) (3)
Gambler’s Ruin: A Random Walk on the Simplex (1987) (3)
Information Theory and the Stock Market (1987) (3)
Do Longer Games Favor the Stronger Player (1989) (3)
The Gaussian Channel (2001) (3)
Concavity in time of conditional entropy for stationary Markov sources (2002) (2)
Claude Elwood Shannon (1916–2001), Volume 49, Number 1 (2)
Growth optimal policies with transaction costs (1998) (2)
Monotonicity of Linear Separability Under Translation (1985) (2)
The relation of description rate and investment growth rate (1995) (2)
Conflict between state information and intended information (1999) (2)
Maximum Entropy and Spectral Estimation (2001) (2)
Information Theory and Portfolio Theory (2005) (1)
Inequalities in Information Theory (2001) (1)
THE DIVISION OF SPACE BY HYPERPLANES WITH APPLICATIONS TO GEOMETRICAL PROBABILITY. (1965) (1)
Some problems in estimation with finite statistics (1970) (1)
‫טכנים‬ ‫וענינים‬ ‫הקדמה‬ :‫הבא‬ ‫הספר‬ ‫לפי‬ ‫בד"כ‬ ‫יהיו‬ ‫אחרים‬ ‫אלגוריתמים‬ ‫חלקים‬ M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Prob- Abilistic Analysis. :‫אותנו‬ ‫שישמש‬ ‫האנטרופיה‬ ‫לתורת‬ ‫בסיסי‬ ‫מבוא‬ ‫מכיל‬ ‫הבא‬ ‫הספר‬ (1)
Information efficiency in investment (1995) (1)
A statistic for measuring the influence of side information in investment (2005) (1)
Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990) (1994) (1)
Concavity of the second law of thermodynamics (2003) (1)
Ergodic Process Selection (1987) (1)
On the Successive Refinement of Information (1989) (1)
The equivalence of optimal market gain and minimax regret universal portfolios (1997) (0)
System Modeling and Statistical Data Processing. (1972) (0)
Max-min optimal investing (1996) (0)
Broken pipes (2013) (0)
The Entropy of Markov lkqjectories (2007) (0)
NOTES ON CLASSIFICATION CAPACITIES (1965) (0)
SRM-3502-PR JANUARY 19683 ANTENNA PATTERN DISTRIBUTIONS c " ' FROM RANDOM ARRAYS (0)
The Entropy Power Inequality and the Brunn-Minkowski Inequality (1987) (0)
Enumerative Source (0)
The Entropy of Markov llajectories (1998) (0)
Figure-Ground Problem for Sound (1987) (0)
Errata (1979) (0)
Chapter 16 Inequalities in Information Theorv (0)
1 A primer on information theory andMMSE estimation (2018) (0)
ANTENNA PATTERN DISTRIBUTIONS FROM RANDOM ARRAYS (1963) (0)
Optimal Shaping Properties of the Truncated Polydisc Absfmct-multidimensional Constellation Shaping with a Family of Regions Called Truncated Polydiscs Is Studied. This Family Achieves Maxi- Mum Shaping Gain for a given Two-dimensional Peak-to-average Energy Ratio or a given Two-dimensional Constell (0)
Kolmogorov Complexity (0)
Learning and Generalization.(Abstract) (1991) (0)
The Asymptotic Equipartition Property (2001) (0)
Finite Memory Clocks (1987) (0)
The initial efficiency of investment for the general market (1997) (0)
Multiple access investment (1995) (0)
HAWAII INTERNATIONAL CONFERENCE ON SYSTEM SCIENCES, 6TH, PROCEEDINGS, 1973. (2017) (0)
Communication Complexity of Shifts (1987) (0)
An Interpretation Of The Theil Entropy Index And The Gini Index Of The Lorenz Curve (1991) (0)
ChaDter 13 Rate Distortion Theory (2001) (0)
Chapter 11 A Maximum Entropy and Spectral Estimation (2001) (0)
The Asymptotic Equivalence of Investing with and without Replacement (1993) (0)

This paper list is powered by the following services:

Other Resources About Thomas M. Cover

en.wikipedia.org

What Schools Are Affiliated With Thomas M. Cover?

Thomas M. Cover is affiliated with the following schools:

Stanford University

Image Attributions

Image Source for Thomas M. Cover