| A coding theorem for the discrete memoryless broadcast channel K Marton IEEE Transactions on Information Theory 25 (3), 306-311, 1979 | 694 | 1979 |
| How to encode the modulo-two sum of binary sources (corresp.) J Korner, K Marton IEEE Transactions on Information Theory 25 (2), 219-221, 1979 | 377 | 1979 |
| General broadcast channels with degraded message sets J Korner, K Marton IEEE Transactions on Information Theory 23 (1), 60-64, 1977 | 333 | 1977 |
| Bounding -distance by informational divergence: a method to prove measure concentration K Marton The Annals of Probability 24 (2), 857-866, 1996 | 305 | 1996 |
| A measure concentration inequality for contracting Markov chains K Marton Geometric & Functional Analysis GAFA 6 (3), 556-571, 1996 | 241 | 1996 |
| Comparison of two noisy channels J Korner, K Marton Topics in information theory, 411-413, 1975 | 216 | 1975 |
| A simple proof of the blowing-up lemma (corresp.) K Marton IEEE Transactions on Information Theory 32 (3), 445-446, 1986 | 211 | 1986 |
| Error exponent for source coding with a fidelity criterion K Marton IEEE Transactions on Information Theory 20 (2), 197-199, 1974 | 191 | 1974 |
| Entropy splitting for antiblocking corners and perfect graphs I Csiszár, J Körner, L Lovász, K Marton, G Simonyi Combinatorica 10, 27-40, 1990 | 128 | 1990 |
| New bounds for perfect hashing via information theory J Korner, K Marton European Journal of Combinatorics 9 (6), 523-530, 1988 | 128 | 1988 |
| Images of a set via two channels and their role in multi-user communication J Korner, K Marton IEEE Transactions on Information Theory 23 (6), 751-761, 1977 | 94 | 1977 |
| Measure concentration for a class of random processes K Marton Probability Theory and Related Fields 110, 427-439, 1998 | 82 | 1998 |
| The capacity region of deterministic broadcast channels K Marton Trans. Int. Symp. Inform. Theory, 243-248, 1977 | 62 | 1977 |
| Entropy and the consistent estimation of joint distributions K Marton, PC Shields The Annals of Probability, 960-977, 1994 | 61 | 1994 |
| Measure concentration for Euclidean distance in the case of dependent random variables K Marton | 60 | 2004 |
| The positive-divergence and blowing-up properties K Marton, PC Shields Israel Journal of Mathematics 86 (1), 331-348, 1994 | 58 | 1994 |
| Measure concentration and strong mixing K Marton Studia scientiarum mathematicarum hungarica 40 (1-2), 95-113, 2003 | 50 | 2003 |
| On the Shannon capacity of probabilistic graphs K Marton Journal of Combinatorial Theory, Series B 57 (2), 183-195, 1993 | 48 | 1993 |
| Graphs that split entropies J Körner, K Marton SIAM journal on discrete mathematics 1 (1), 71-79, 1988 | 45 | 1988 |
| A source network problem involving the comparison of two channels II J Korner, K Marton IEEE Transactions on Information Theory, 1975 | 33 | 1975 |
