Katalin Marton

15 papers Journal 15

Year	Rank	Type	Title / Venue / Authors
2019	J	`jnl`	Logarithmic Sobolev inequalities in discrete product spaces. Comb. Probab. Comput. Katalin Marton
2001	J	`jnl`	Relative capacity and dimension of graphs. Discret. Math. János Körner, Katalin Marton
1993	J	`jnl`	On the Shannon Capacity of Probabilistic Graphs. J. Comb. Theory B Katalin Marton
1990	J	`jnl`	Entropy splitting for antiblocking corners and perfect graphs. Comb. Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
1990	J	`jnl`	On the capacity of uniform hypergraphs. IEEE Trans. Inf. Theory János Körner, Katalin Marton
1988	J	`jnl`	Graphs that Split Entropies. SIAM J. Discret. Math. János Körner, Katalin Marton
1988	J	`jnl`	New Bounds for Perfect Hashing via Information Theory. Eur. J. Comb. János Körner, Katalin Marton
1988	J	`jnl`	Random access communication and graph entropy. IEEE Trans. Inf. Theory János Körner, Katalin Marton
1987	J	`jnl`	Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. IEEE Trans. Inf. Theory Katalin Marton
1986	J	`jnl`	A simple proof of the blowing-up lemma. IEEE Trans. Inf. Theory Katalin Marton
1979	J	`jnl`	A coding theorem for the discrete memoryless broadcast channel. IEEE Trans. Inf. Theory Katalin Marton
1979	J	`jnl`	How to encode the modulo-two sum of binary sources (Corresp.). IEEE Trans. Inf. Theory János Körner, Katalin Marton
1977	J	`jnl`	General broadcast channels with degraded message sets. IEEE Trans. Inf. Theory János Körner, Katalin Marton
1977	J	`jnl`	Images of a set via two channels and their role in multi-user communication. IEEE Trans. Inf. Theory János Körner, Katalin Marton
1974	J	`jnl`	Error exponent for source coding with a fidelity criterion. IEEE Trans. Inf. Theory Katalin Marton

Chang Liu, Noah Fleischmann, Nicolò Altamura, Edward Raff, James Holt, Kristopher Micinski