The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas M. Cover: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  39. Duality between channel capacity and rate distortion with two-sided state information [Citation Graph (, )][DBLP]


  40. Coordination Capacity [Citation Graph (, )][DBLP]


Search in 0.032secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002