default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDImre Csiszár
Person information
- affiliation: Hungarian Academy of Sciences, Alfréd Rényi Institute of Mathematics, Budapest, Hungary
- award (2015): IEEE Richard W. Hamming Medal
- award (2007): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j43]Imre Csiszár
, Lóránt Farkas, Tamás Kói:
Error Exponents for Asynchronous Multiple Access Channels, Controlled Asynchronism May Outperform Synchronism. IEEE Trans. Inf. Theory 67(12): 7684-7707 (2021)
2010 – 2019
- 2018
- [j42]Imre Csiszár, Thomas Breuer:
Expected Value Minimization in Information Theoretic Multiple Priors Models. IEEE Trans. Inf. Theory 64(6): 3957-3974 (2018) - 2017
- [c24]Lóránt Farkas, Tamás Kói, Imre Csiszár:
Error exponents for sparse communication. ISIT 2017: 3145-3149 - 2016
- [c23]Imre Csiszár, Frantisek Matús:
Convergence of generalized entropy minimizers in sequences of convex problems. ISIT 2016: 2609-2613 - 2015
- [c22]Imre Csiszár, Thomas Breuer:
An Information Geometry Problem in Mathematical Finance. GSI 2015: 435-443 - 2013
- [j41]Imre Csiszár, Prakash Narayan:
Secrecy Generation for Multiaccess Channel Models. IEEE Trans. Inf. Theory 59(1): 17-31 (2013) - [c21]Rudolf Ahlswede, Imre Csiszár:
On Oblivious Transfer Capacity. Information Theory, Combinatorics, and Search Theory 2013: 145-166 - [c20]Imre Csiszár, Frantisek Matús:
Generalized Minimizers of Convex Integral Functionals and Pythagorean Identities. GSI 2013: 302-307 - [c19]Thomas Breuer, Imre Csiszár:
Information geometry in mathematical finance: Model risk, worst and almost worst scenarios. ISIT 2013: 404-408 - [i3]Thomas Breuer, Imre Csiszár:
Measuring Model Risk. CoRR abs/1301.4832 (2013) - 2012
- [j40]Imre Csiszár, Frantisek Matús:
Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities. Kybernetika 48(4): 637-689 (2012) - [c18]Imre Csiszár, Frantisek Matús:
Minimization of entropy functionals revisited. ISIT 2012: 150-154 - [i2]Imre Csiszár, Frantisek Matús:
Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities. CoRR abs/1202.0666 (2012) - 2011
- [b1]Imre Csiszár, János Körner:
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition. Cambridge University Press 2011, ISBN 978-0-51192188-9, pp. 1-499 - [c17]Imre Csiszár:
On Information Theoretic Security: Mathematical Models and Techniques - (Invited Talk). ICITS 2011: 73-75 - 2010
- [j39]Imre Csiszár, Zsolt Talata:
On rate of convergence of statistical estimation of stationary ergodic processes. IEEE Trans. Inf. Theory 56(8): 3637-3641 (2010) - [c16]Imre Csiszár, Prakash Narayan:
Capacity of a shared secret key. ISIT 2010: 2593-2596
2000 – 2009
- 2009
- [j38]Imre Csiszár:
Review of "Information theory and network coding" by Raymond W. Yeung, Springer, 2008. IEEE Trans. Inf. Theory 55(7): 3409 (2009) - [c15]Imre Csiszár, Prakash Narayan:
Secrecy generation for multiple input multiple output channel models. ISIT 2009: 2447-2451 - [c14]Rudolf Ahlswede, Imre Csiszár:
On oblivious transfer capacity. ITW 2009: 1-3 - [c13]Imre Csiszár, Prakash Narayan:
Multiterminal secrecy generation. ITW 2009: 4 - [c12]Imre Csiszár, Frantisek Matús:
On minimization of multivariate entropy functionals. ITW 2009: 96-100 - 2008
- [j37]Imre Csiszár:
Axiomatic Characterizations of Information Measures. Entropy 10(3): 261-273 (2008) - [j36]Imre Csiszár, Prakash Narayan:
Secrecy Capacities for Multiterminal Channel Models. IEEE Trans. Inf. Theory 54(6): 2437-2452 (2008) - [c11]Imre Csiszár:
On Iterative Algorithms with an Information Geometry Background. ALT 2008: 1 - [c10]Imre Csiszár:
On Iterative Algorithms with an Information Geometry Background. Discovery Science 2008: 1 - [c9]Imre Csiszár, Frantisek Matús:
On minimization of entropy functionals under moment constraints. ISIT 2008: 2101-2105 - 2007
- [c8]Imre Csiszár, Prakash Narayan:
On Multiterminal Secrecy Capacities. ISIT 2007: 2051-2055 - [c7]Rudolf Ahlswede, Imre Csiszár:
On Oblivious Transfer Capacity. ISIT 2007: 2061-2064 - [i1]Imre Csiszár, Fumio Hiai, Dénes Petz:
A limit relation for entropy and channel capacity per unit cost. CoRR abs/0704.0046 (2007) - 2006
- [j35]Imre Csiszár, Zsolt Talata:
Context tree estimation for not necessarily finite memory processes, via BIC and MDL. IEEE Trans. Inf. Theory 52(3): 1007-1016 (2006) - [c6]Imre Csiszár, Frantisek Matús:
Generalized maximum likelihood estimates for exponential families. ISIT 2006: 1939-1943 - 2005
- [c5]Imre Csiszár, Zsolt Talata:
Context tree estimation for not necessarily finite memory processes, via BIC and MDL. ISIT 2005: 755-759 - [c4]Imre Csiszár, Prakash Narayan:
Secrecy capacities for multiterminal channel models. ISIT 2005: 2138-2141 - 2004
- [j34]Imre Csiszár, Paul C. Shields:
Information Theory and Statistics: A Tutorial. Found. Trends Commun. Inf. Theory 1(4) (2004) - [j33]Imre Csiszár, Frantisek Matús:
On information closures of exponential families: a counterexample. IEEE Trans. Inf. Theory 50(5): 922-924 (2004) - [j32]Imre Csiszár, Prakash Narayan:
Secrecy capacities for multiple terminals. IEEE Trans. Inf. Theory 50(12): 3047-3061 (2004) - [c3]Imre Csiszár, Frantisek Matús:
Information closures of exponential families. ISIT 2004: 30 - [c2]Imre Csiszár, Zsolt Talata:
Consistent estimation of the basic neighborhood of Markov random fields. ISIT 2004: 170 - 2003
- [j31]Imre Csiszár, Frantisek Matús:
Information projections revisited. IEEE Trans. Inf. Theory 49(6): 1474-1490 (2003) - [j30]Imre Csiszár:
A first course in information theory [Book Review]. IEEE Trans. Inf. Theory 49(7): 1869 (2003) - 2002
- [j29]Imre Csiszár:
Large-scale typicality of Markov sample paths and consistency of MDL Order estimators. IEEE Trans. Inf. Theory 48(6): 1616-1628 (2002) - [c1]Imre Csiszár, Prakash Narayan:
The secret key capacity for multiple terminals. ITW 2002: 8-10 - 2000
- [j28]Imre Csiszár, Prakash Narayan:
Common randomness and secret key generation with a helper. IEEE Trans. Inf. Theory 46(2): 344-366 (2000)
1990 – 1999
- 1999
- [j27]Imre Csiszár, Fabrice Gamboa, Elisabeth Gassiat:
MEM pixel correlated solutions for generalized moment and interpolation problems. IEEE Trans. Inf. Theory 45(7): 2253-2270 (1999) - 1998
- [j26]Rudolf Ahlswede, Imre Csiszár:
Common Randomness in Information Theory and Cryptography - Part II: CR Capacity. IEEE Trans. Inf. Theory 44(1): 225-240 (1998) - [j25]Imre Csiszár:
The Method of Types. IEEE Trans. Inf. Theory 44(6): 2505-2523 (1998) - 1996
- [j24]Imre Csiszár, Paul C. Shields:
Redundancy rates for renewal and other processes. IEEE Trans. Inf. Theory 42(6): 2065-2072 (1996) - 1995
- [j23]Imre Csiszár:
Generalized cutoff rates and Renyi's information measures. IEEE Trans. Inf. Theory 41(1): 26-34 (1995) - [j22]Imre Csiszár, Prakash Narayan:
Channel capacity for a given decoding metric. IEEE Trans. Inf. Theory 41(1): 35-43 (1995) - [j21]Imre Csiszár:
Review of 'Universal Compression and Retrieval' (Krichevsky, R.; 1994). IEEE Trans. Inf. Theory 41(3): 862- (1995) - 1993
- [j20]Rudolf Ahlswede, Imre Csiszár:
Common randomness in information theory and cryptography - I: Secret sharing. IEEE Trans. Inf. Theory 39(4): 1121-1132 (1993) - 1992
- [j19]Imre Csiszár:
Arbitrarily varying channels with general alphabets and states. IEEE Trans. Inf. Theory 38(6): 1725-1742 (1992) - 1991
- [j18]Imre Csiszár, Prakash Narayan:
Capacity of the Gaussian arbitrarily varying channel. IEEE Trans. Inf. Theory 37(1): 18-26 (1991) - 1990
- [j17]Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi:
Entropy splitting for antiblocking corners and perfect graphs. Comb. 10(1): 27-40 (1990)
1980 – 1989
- 1989
- [j16]Imre Csiszár, Prakash Narayan:
Capacity and decoding rules for classes of arbitrarily varying channels. IEEE Trans. Inf. Theory 35(4): 752-769 (1989) - 1988
- [j15]Imre Csiszár, Prakash Narayan:
Arbitrarily varying channels with constrained inputs and states. IEEE Trans. Inf. Theory 34(1): 27-34 (1988) - [j14]Imre Csiszár, Prakash Narayan:
The capacity of the arbitrarily varying channel revisited: Positivity, constraints. IEEE Trans. Inf. Theory 34(2): 181-193 (1988) - 1987
- [j13]Imre Csiszár, Thomas M. Cover, Byoung-Seon Choi:
Conditional limit theorems under Markov conditioning. IEEE Trans. Inf. Theory 33(6): 788-801 (1987) - 1986
- [j12]Rudolf Ahlswede, Imre Csiszár:
Hypothesis testing with communication constraints. IEEE Trans. Inf. Theory 32(4): 533-542 (1986) - 1982
- [j11]Imre Csiszár, János Körner:
Feedback does not affect the reliability function of a DMC at rates above capacity. IEEE Trans. Inf. Theory 28(1): 92-93 (1982) - [j10]Imre Csiszár:
Linear codes for sources and source networks: Error exponents, universal coding. IEEE Trans. Inf. Theory 28(4): 585-592 (1982) - [j9]Imre Csiszár:
On the error exponent of source-channel transmission with a distortion threshold. IEEE Trans. Inf. Theory 28(6): 823-827 (1982) - 1981
- [j8]Imre Csiszár, János Körner:
Graph decomposition: A new key to coding theorems. IEEE Trans. Inf. Theory 27(1): 5-11 (1981) - [j7]Rudolf Ahlswede, Imre Csiszár:
To get a bit of information may be as hard as to get full information. IEEE Trans. Inf. Theory 27(4): 398-408 (1981) - 1980
- [j6]Imre Csiszár, János Körner:
Towards a general theory of source networks. IEEE Trans. Inf. Theory 26(2): 155-165 (1980)
1970 – 1979
- 1978
- [j5]Imre Csiszár, János Körner:
Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24(3): 339-348 (1978) - 1976
- [j4]Imre Csiszár:
Review of ́On Measures of Information and Their Characterizationś (Aczél, J., and Daróczy, Z.; 1975). IEEE Trans. Inf. Theory 22(6): 765-766 (1976) - 1974
- [j3]Imre Csiszár:
On the computation of rate-distortion functions (Corresp.). IEEE Trans. Inf. Theory 20(1): 122-124 (1974)
1960 – 1969
- 1969
- [j2]Imre Csiszár:
Simple Proofs of Some Theorems on Noiseless Channels. Inf. Control. 14(3): 285-298 (1969) - 1967
- [j1]Imre Csiszár:
Two Remarks to Noiseless Coding. Inf. Control. 11(3): 317-322 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
