Two Remarks to Noiseless Coding - Imre Csiszár (Inf. Control., 1967)

Simple Proofs of Some Theorems on Noiseless Channels - Imre Csiszár (Inf. Control., 1969)

On the computation of rate-distortion functions (Corresp.). - Imre Csiszár (IEEE Trans. Inf. Theory, 1974)

Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975). - Imre Csiszár (IEEE Trans. Inf. Theory, 1976)

Broadcast channels with confidential messages. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1978)

Towards a general theory of source networks. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1980)

To get a bit of information may be as hard as to get full information. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1981)

Graph decomposition: A new key to coding theorems. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1981)

Linear codes for sources and source networks: Error exponents, universal coding. - Imre Csiszár (IEEE Trans. Inf. Theory, 1982)

On the error exponent of source-channel transmission with a distortion threshold. - Imre Csiszár (IEEE Trans. Inf. Theory, 1982)

Feedback does not affect the reliability function of a DMC at rates above capacity. - Imre Csiszár; János Körner (IEEE Trans. Inf. Theory, 1982)

Hypothesis testing with communication constraints. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1986)

Conditional limit theorems under Markov conditioning. - Imre Csiszár; Thomas M. Cover; Byoung-Seon Choi (IEEE Trans. Inf. Theory, 1987)

Arbitrarily varying channels with constrained inputs and states. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1988)

The capacity of the arbitrarily varying channel revisited: Positivity, constraints. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1988)

Capacity and decoding rules for classes of arbitrarily varying channels. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1989)

Entropy splitting for antiblocking corners and perfect graphs. - Imre Csiszár; János Körner; László Lovász 001; Katalin Marton; Gábor Simonyi (Comb., 1990)

Capacity of the Gaussian arbitrarily varying channel. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1991)

Arbitrarily varying channels with general alphabets and states. - Imre Csiszár (IEEE Trans. Inf. Theory, 1992)

Common randomness in information theory and cryptography - I: Secret sharing. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1993)

Generalized cutoff rates and Renyi's information measures. - Imre Csiszár (IEEE Trans. Inf. Theory, 1995)

Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994). - Imre Csiszár (IEEE Trans. Inf. Theory, 1995)

Channel capacity for a given decoding metric. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 1995)

Redundancy rates for renewal and other processes. - Imre Csiszár; Paul C. Shields (IEEE Trans. Inf. Theory, 1996)

Common Randomness in Information Theory and Cryptography - Part II: CR Capacity. - Rudolf Ahlswede; Imre Csiszár (IEEE Trans. Inf. Theory, 1998)

The Method of Types. - Imre Csiszár (IEEE Trans. Inf. Theory, 1998)

MEM pixel correlated solutions for generalized moment and interpolation problems. - Imre Csiszár; Fabrice Gamboa; Elisabeth Gassiat (IEEE Trans. Inf. Theory, 1999)

Common randomness and secret key generation with a helper. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2000)

The secret key capacity for multiple terminals. - Imre Csiszár; Prakash Narayan (ITW, 2002)

Large-scale typicality of Markov sample paths and consistency of MDL Order estimators. - Imre Csiszár (IEEE Trans. Inf. Theory, 2002)

A first course in information theory [Book Review]. - Imre Csiszár (IEEE Trans. Inf. Theory, 2003)

Information projections revisited. - Imre Csiszár; Frantisek Matús (IEEE Trans. Inf. Theory, 2003)

Information closures of exponential families. - Imre Csiszár; Frantisek Matús (ISIT, 2004)

Consistent estimation of the basic neighborhood of Markov random fields. - Imre Csiszár; Zsolt Talata (ISIT, 2004)

Information Theory and Statistics: A Tutorial. - Imre Csiszár; Paul C. Shields (Found. Trends Commun. Inf. Theory, 2004)

On information closures of exponential families: a counterexample. - Imre Csiszár; Frantisek Matús (IEEE Trans. Inf. Theory, 2004)

Secrecy capacities for multiple terminals. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2004)

Generalized maximum likelihood estimates for exponential families. - Imre Csiszár; Frantisek Matús (ISIT, 2006)

Context tree estimation for not necessarily finite memory processes, via BIC and MDL. - Imre Csiszár; Zsolt Talata (IEEE Trans. Inf. Theory, 2006)

On Multiterminal Secrecy Capacities. - Imre Csiszár; Prakash Narayan (ISIT, 2007)

A limit relation for entropy and channel capacity per unit cost. - Imre Csiszár; Fumio Hiai; Dénes Petz (CoRR, 2007)

On Iterative Algorithms with an Information Geometry Background. - Imre Csiszár (ALT, 2008)

On minimization of entropy functionals under moment constraints. - Imre Csiszár; Frantisek Matús (ISIT, 2008)

Axiomatic Characterizations of Information Measures. - Imre Csiszár (Entropy, 2008)

Secrecy Capacities for Multiterminal Channel Models. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2008)

Secrecy generation for multiple input multiple output channel models. - Imre Csiszár; Prakash Narayan (ISIT, 2009)

On oblivious transfer capacity. - Rudolf Ahlswede; Imre Csiszár (ITW, 2009)

On minimization of multivariate entropy functionals. - Imre Csiszár; Frantisek Matús (ITW, 2009)

Multiterminal secrecy generation. - Imre Csiszár; Prakash Narayan (ITW, 2009)

Review of "Information theory and network coding" by Raymond W. Yeung, Springer, 2008. - Imre Csiszár (IEEE Trans. Inf. Theory, 2009)

Capacity of a shared secret key. - Imre Csiszár; Prakash Narayan (ISIT, 2010)

On rate of convergence of statistical estimation of stationary ergodic processes. - Imre Csiszár; Zsolt Talata (IEEE Trans. Inf. Theory, 2010)

Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition - Imre Csiszár; János Körner (Cambridge University Press, 2011)

On Information Theoretic Security: Mathematical Models and Techniques - (Invited Talk). - Imre Csiszár (ICITS, 2011)

Minimization of entropy functionals revisited. - Imre Csiszár; Frantisek Matús (ISIT, 2012)

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities. - Imre Csiszár; Frantisek Matús (Kybernetika, 2012)

Generalized Minimizers of Convex Integral Functionals and Pythagorean Identities. - Imre Csiszár; Frantisek Matús (GSI, 2013)

Information geometry in mathematical finance: Model risk, worst and almost worst scenarios. - Thomas Breuer; Imre Csiszár (ISIT, 2013)

Measuring Model Risk - Thomas Breuer; Imre Csiszár (CoRR, 2013)

Secrecy Generation for Multiaccess Channel Models. - Imre Csiszár; Prakash Narayan (IEEE Trans. Inf. Theory, 2013)

An Information Geometry Problem in Mathematical Finance. - Imre Csiszár; Thomas Breuer (GSI, 2015)

Convergence of generalized entropy minimizers in sequences of convex problems. - Imre Csiszár; Frantisek Matús (ISIT, 2016)

Error exponents for sparse communication. - Lóránt Farkas; Tamás Kói; Imre Csiszár (ISIT, 2017)

Expected Value Minimization in Information Theoretic Multiple Priors Models. - Imre Csiszár; Thomas Breuer (IEEE Trans. Inf. Theory, 2018)

Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism. - Imre Csiszár; Lóránt Farkas; Tamás Kói (IEEE Trans. Inf. Theory, 2021)