The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Imre Csiszár: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
    Entropy splitting for antiblocking corners and perfect graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:27-40 [Journal]
  2. Imre Csiszár
    Two Remarks to Noiseless Coding [Citation Graph (0, 0)][DBLP]
    Information and Control, 1967, v:11, n:3, pp:317-322 [Journal]
  3. Imre Csiszár
    Simple Proofs of Some Theorems on Noiseless Channels [Citation Graph (0, 0)][DBLP]
    Information and Control, 1969, v:14, n:3, pp:285-298 [Journal]
  4. Rudolf Ahlswede, Imre Csiszár
    To get a bit of information may be as hard as to get full information. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:4, pp:398-408 [Journal]
  5. Rudolf Ahlswede, Imre Csiszár
    Hypothesis testing with communication constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:533-542 [Journal]
  6. Rudolf Ahlswede, Imre Csiszár
    Common randomness in information theory and cryptography - I: Secret sharing. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1121-1132 [Journal]
  7. Rudolf Ahlswede, Imre Csiszár
    Common Randomness in Information Theory and Cryptography - Part II: CR Capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:1, pp:225-240 [Journal]
  8. Imre Csiszár
    Large-scale typicality of Markov sample paths and consistency of MDL Order estimators. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1616-1628 [Journal]
  9. Imre Csiszár
    A first course in information theory [Book Review]. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:7, pp:1869-1869 [Journal]
  10. Imre Csiszár
    Linear codes for sources and source networks: Error exponents, universal coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:4, pp:585-592 [Journal]
  11. Imre Csiszár
    On the error exponent of source-channel transmission with a distortion threshold. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:6, pp:823-827 [Journal]
  12. Imre Csiszár
    Arbitrarily varying channels with general alphabets and states. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1725-1742 [Journal]
  13. Imre Csiszár
    Generalized cutoff rates and Renyi's information measures. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:26-34 [Journal]
  14. Imre Csiszár
    Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:862-0 [Journal]
  15. Imre Csiszár
    The Method of Types. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2505-2523 [Journal]
  16. 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]
  17. Imre Csiszár, Fabrice Gamboa, Elisabeth Gassiat
    MEM pixel correlated solutions for generalized moment and interpolation problems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2253-2270 [Journal]
  18. Imre Csiszár, János Körner
    Graph decomposition: A new key to coding theorems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:1, pp:5-11 [Journal]
  19. Imre Csiszár, János Körner
    Feedback does not affect the reliability function of a DMC at rates above capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:1, pp:92-0 [Journal]
  20. Imre Csiszár, Frantisek Matús
    Information projections revisited. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:6, pp:1474-1490 [Journal]
  21. Imre Csiszár, Frantisek Matús
    On information closures of exponential families: a counterexample. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:5, pp:922-924 [Journal]
  22. Imre Csiszár, Prakash Narayan
    Common randomness and secret key generation with a helper. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:344-366 [Journal]
  23. Imre Csiszár, Prakash Narayan
    Secrecy capacities for multiple terminals. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:12, pp:3047-3061 [Journal]
  24. Imre Csiszár, Prakash Narayan
    Arbitrarily varying channels with constrained inputs and states. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:27-34 [Journal]
  25. Imre Csiszár, Prakash Narayan
    The capacity of the arbitrarily varying channel revisited: Positivity, constraints. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:181-193 [Journal]
  26. Imre Csiszár, Prakash Narayan
    Capacity and decoding rules for classes of arbitrarily varying channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1989, v:35, n:4, pp:752-769 [Journal]
  27. Imre Csiszár, Prakash Narayan
    Channel capacity for a given decoding metric. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:35-43 [Journal]
  28. Imre Csiszár, Paul C. Shields
    Redundancy rates for renewal and other processes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2065-2072 [Journal]
  29. Imre Csiszár, Z. Talata
    Context tree estimation for not necessarily finite memory processes, via BIC and MDL. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:3, pp:1007-1016 [Journal]

  30. On Iterative Algorithms with an Information Geometry Background. [Citation Graph (, )][DBLP]


  31. On Iterative Algorithms with an Information Geometry Background. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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