| |
| 2001 | ||
|---|---|---|
| 8 | EE | János Körner, Katalin Marton: Relative capacity and dimension of graphs. Discrete Mathematics 235(1-3): 307-315 (2001) |
| 1993 | ||
| 7 | EE | Katalin Marton: On the Shannon Capacity of Probabilistic Graphs. J. Comb. Theory, Ser. B 57(2): 183-195 (1993) |
| 1990 | ||
| 6 | Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi: Entropy splitting for antiblocking corners and perfect graphs. Combinatorica 10(1): 27-40 (1990) | |
| 5 | János Körner, Katalin Marton: On the capacity of uniform hypergraphs. IEEE Transactions on Information Theory 36(1): 153- (1990) | |
| 1988 | ||
| 4 | János Körner, Katalin Marton: Random access communication and graph entropy. IEEE Transactions on Information Theory 34(2): 312- (1988) | |
| 3 | János Körner, Katalin Marton: Graphs that Split Entropies. SIAM J. Discrete Math. 1(1): 71-79 (1988) | |
| 1987 | ||
| 2 | Katalin Marton: Sequences achieving the boundary of the entropy region for a two-source are virtually memoryless. IEEE Transactions on Information Theory 33(3): 443- (1987) | |
| 1986 | ||
| 1 | Katalin Marton: A simple proof of the blowing-up lemma. IEEE Transactions on Information Theory 32(3): 445- (1986) | |
| 1 | Imre Csiszár | [6] |
| 2 | János Körner | [3] [4] [5] [6] [8] |
| 3 | László Lovász | [6] |
| 4 | Gábor Simonyi | [6] |