Imre Csiszár

Q: What Schools Are Affiliated With Imre Csiszár

Imre Csiszár is affiliated with the following schools: Eötvös Loránd University, Bielefeld University

Imre Csiszár's AcademicInfluence.com Rankings

Imre Csiszár

Mathematics

#880

World Rank

#1551

Historical Rank

Measure Theory

#749

World Rank

#1006

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Imre Csiszár's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Imre Csiszár Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Imre Csiszár is a Hungarian mathematician with contributions to information theory and probability theory. In 1996 he won the Claude E. Shannon Award, the highest annual award given in the field of information theory.

(See a Problem?)

Imre Csiszár'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

Broadcast channels with confidential messages (1978) (3222)
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition (2011) (2489)
$I$-Divergence Geometry of Probability Distributions and Minimization Problems (1975) (1551)
Common randomness in information theory and cryptography - I: Secret sharing (1993) (1204)
Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems (1991) (823)
Information Theory and Statistics: A Tutorial (2004) (751)
Secrecy capacities for multiple terminals (2004) (395)
Sanov Property, Generalized $I$-Projection and a Conditional Limit Theorem (1984) (365)
Generalized Cutoff Rates and Renyi's Information Measures (1993) (358)
The Method of Types (1998) (330)
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity (1998) (297)
The capacity of the arbitrarily varying channel revisited: Positivity, constraints (1988) (295)
Axiomatic Characterizations of Information Measures (2008) (279)
Common randomness and secret key generation with a helper (1997) (276)
Linear codes for sources and source networks: Error exponents, universal coding (1982) (271)
Hypothesis testing with communication constraints (1986) (225)
The Information in Contingency Tables (1980) (210)
The consistency of the BIC Markov order estimator (2000) (204)
Context tree estimation for not necessarily finite memory processes, via BIC and MDL (2005) (202)
A class of measures of informativity of observation channels (1972) (182)
Information projections revisited (2000) (180)
Graph decomposition: A new key to coding theorems (1981) (180)
Secrecy Capacities for Multiterminal Channel Models (2005) (156)
Towards a general theory of source networks (1980) (147)
Channel capacity for a given decoding metric (1994) (144)
Information Theory (1981) (120)
Entropy splitting for antiblocking corners and perfect graphs (1990) (109)
Capacity of the Gaussian arbitrarily varying channel (1991) (105)
Conditional limit theorems under Markov conditioning (1987) (103)
Arbitrarily varying channels with constrained inputs and states (1988) (98)
A geometric interpretation of Darroch and Ratcliff's generalized iterative scaling (1989) (94)
Generalized projections for non-negative functions (1995) (93)
On the computation of rate-distortion functions (Corresp.) (1974) (88)
Large-scale typicality of Markov sample paths and consistency of MDL Order estimators (2002) (88)
Maxent, Mathematics, and Information Theory (1996) (83)
Systematic stress tests with entropic plausibility constraints (2013) (78)
MEASURING DISTRIBUTION MODEL RISK (2016) (76)
Consistent estimation of the basic neighborhood of Markov random fields (2004) (72)
Arbitrarily varying channels with general alphabets and states (1992) (70)
On the error exponent of source-channel transmission with a distortion threshold (1982) (63)
On infinite products of random elements and infinite convolutions of probability distributions on locally compact groups (1966) (63)
On the capacity of the arbitrarily varying channel for maximum probability of error (1981) (56)
On Oblivious Transfer Capacity (2007) (56)
Redundancy rates for renewal and other processes (1994) (49)
Why least squares and maximum entropy? An axiomatic approach to inverse problems (1990) (47)
Closures of exponential families (2005) (43)
Simple Proofs of Some Theorems on Noiseless Channels (1969) (41)
MEM pixel correlated solutions for generalized moment and interpolation problems (1998) (41)
Information Theory: Name index (2011) (40)
Generalized maximum likelihood estimates for exponential families (2006) (36)
Information theoretic methods in probability and statistics (1997) (36)
Capacity and decoding rules for classes of arbitrarily varying channels (1989) (36)
To get a bit of information may be as hard as to get full information (1981) (30)
Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities (2012) (30)
2006 IEEE International Symposium on Information Theory (2006) (29)
Information Theory: Basic notation and conventions (2011) (28)
Convex cores of measures on R d (2001) (23)
Secrecy generation for multiple input multiple output channel models (2009) (23)
Topics in Information Theory (1976) (22)
Entropy, search, complexity (2007) (22)
Secrecy Generation for Multiaccess Channel Models (2013) (21)
A simple proof of Sanov’s theorem* (2006) (20)
Feedback does not affect the reliability function of a DMC at rates above capacity (1982) (19)
Information theory and statistics (2013) (19)
On Rate of Convergence of Statistical Estimation of Stationary Ergodic Processes (2010) (18)
Topological property of f-divergence (1967) (18)
Measuring Model Risk (2013) (18)
Stochastic Differential and Difference Equations (1997) (16)
On minimization of entropy functionals under moment constraints (2008) (15)
Common randomness and secret key generation with a helper (1997) (14)
Some remarks on the dimension and entropy of random variables (1964) (13)
ON THE CAPACITY OF NOISY CHANNELS WITH ARBITRARY SIGNAL COSTS. (1973) (13)
A convergence of types theorem for probability measures on topological vector spaces with applications to stable laws (1976) (12)
Two Remarks to Noiseless Coding (1967) (11)
The secret key capacity for multiple terminals (2002) (11)
On the dimension and entropy of order α of the mixture of probability distributions (1962) (10)
Capacity of a shared secret key (2010) (9)
Maximum entropy and related methods (1994) (9)
On information closures of exponential families:a counterexample (2004) (8)
On minimization of multivariate entropy functionals (2009) (8)
Information sources with different cost scales and the principle of conservation of entropy (1969) (7)
The secret key capacity for multiple terminals (2002) (7)
Channel Coding Theory (1970) (6)
Consistency of the BIC order estimator (1999) (6)
Expected Value Minimization in Information Theoretic Multiple Priors Models (2018) (6)
Information closure of exponential families and generalized maximum likelihood estimates (2002) (6)
Information geometry in mathematical finance: Model risk, worst and almost worst scenarios (2013) (5)
Entropy, Search, Complexity (Bolyai Society Mathematical Studies) (2007) (4)
An Information Geometry Problem in Mathematical Finance (2015) (4)
Festschrift in Honor of Jorma Rissanen on the Occasion of his 75th Birthday edited by Peter Grünwald, Petri Myllymäki, Ioan Tabus, Marcelo Weinberger, Bin Yu (2008) (4)
A limit relation for entropy and channel capacity per unit cost (2007) (4)
Divergence minimization under prior inequality constraints (2001) (4)
Error exponents for sparse communication (2017) (3)
Maximum Entropy and Bayesian Methods - J. Skilling; S. Sibisi. (1998) (3)
Information Theory: Introduction (2011) (3)
Stochastics: Information Theory (2006) (3)
Generalized maximum likelihood estimates for infinite dimensional exponential families (2006) (3)
Minimization of entropy functionals revisited (2012) (2)
Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism (2019) (2)
Information closures of exponential families (2004) (2)
Information Theory: A packing lemma and the error exponent in channel coding (2011) (2)
Information Theory: Multiple-access channels (2007) (2)
On closures of exponential families and their subfamilies (2003) (2)
Stress Tests: From Arts to Science (2010) (2)
On a problem about I-projections (1997) (1)
Generalized Minimizers of Convex Integral Functionals and Pythagorean Identities (2013) (1)
Information Theory: Information-theoretic security (2011) (1)
Review of "Information theory and network coding" by Raymond W. Yeung, Springer, 2008 (2009) (1)
Is the Maximum Entropy Principle Operationally Justifiable (1987) (1)
The Role Of Common Randomness In Information Theory And Cryptography, Part 1: Secrecy Constraints (1991) (1)
Some Basic Mathematical Problems of Multiuser Shannon Theory (1987) (1)
Neurogram analysis tested on synthetized multiunit firing patterns. (1992) (0)
Minimum Relative Entropy State Transitions in Linear Stochastic Systems : the Continuous Time Case (2010) (0)
On Information Theoretic Security: Mathematical Models and Techniques - (Invited Talk) (2011) (0)
Multiterminal secrecy generation (2009) (0)
Arbitrarily varying channels (2011) (0)
Information Theory: The compound channel revisited: zero-error information theory and extremal combinatorics (2011) (0)
Information Theory: Computation of channel capacity and Δ-distortion rates (2011) (0)
Information Theory: Entropy and image size characterization (2011) (0)
Information Theory: A covering lemma and the error exponent in source coding (2011) (0)
Almost Worst Case Distributions in Multiple Priors Models (2015) (0)
Information Theory: Formal properties of Shannon's information measures (2011) (0)
Information Theory: Source coding and hypothesis testing; information measures (2011) (0)
Information Theory: Types and typical sequences (2011) (0)
CLOSURES OF EXPONENTIAL FAMILIES 1 (2005) (0)
In memoriam Rudolf Ahlswede 1938 - 2010 (2013) (0)
Channel Coding Theory: Course Held at the Department for Automation and Information, July 1970 (1974) (0)
Robust Risk Measurement with Imprecise Probabilities (2011) (0)
Risk Measurement Robust under Model Uncertainty∗ (2011) (0)
Information Measures in Simple Coding Problems (1981) (0)
Session Divergence Geometry (chaired by Michel Broniatowski, Imre Csiszár) (2015) (0)
Coding Theorems for Noisy Channels (1970) (0)
Information Theory: Rate-distortion trade-off in source coding and the source–channel transmission problem (2011) (0)
Orientation-reflex-based evaluation of postrotatory nystagmograms. (1991) (0)
Historical Notes and References (1970) (0)
Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975) (1976) (0)
On Multiterminal Secrecy Capacities (2007) (0)
On convergence rates of finite memory estimators of infinite memory processes (2010) (0)
The method of types (invited paper) (2000) (0)
Mathematical Definition of Discrete Communication Channels with Noise (1970) (0)
A first course in information theory [Book Review] (2003) (0)
An abstract source-channel transmission theorem (1983) (0)
Two-Terminal Systems (1981) (0)
Convergence of generalized entropy minimizers in sequences of convex problems (2016) (0)
The Simplest Coding Problem (1972) (0)
Information Theory: The noisy channel coding problem (2011) (0)
Information transmission with simbols of different cost (1972) (0)
Information Theory: Non-block source coding (2011) (0)
Information Theory: Multi-terminal systems (2011) (0)
The Reliability Function of a Communication Channel (1970) (0)
Entropy splitting for antiblocking pairs and perfect graphs by (2007) (0)
Information Theory: References (2011) (0)
BASIC NOTATIONS AND CONVENTIONS (1981) (0)
Separate coding of correlated sources (2011) (0)
Book reviews (1998) (0)
On Iterative Algorithms with an Information Geometry Background (2008) (0)
Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994) (1995) (0)
Information Theory: Source and channel networks (2011) (0)
Information Theory: Blowing up lemma: a combinatorial digression (2011) (0)
RATCLIFF'S GENERALIZED ITERATIVE SCALING' (2016) (0)
Multi-Terminal Systems (1981) (0)

This paper list is powered by the following services:

Other Resources About Imre Csiszár

en.wikipedia.org

What Schools Are Affiliated With Imre Csiszár?

Imre Csiszár is affiliated with the following schools:

Imre Csiszár's Academic­Influence.com Rankings