2008 |
41 | EE | Gerard Cohen,
Emanuela Fachini,
János Körner:
On the permutation capacity of digraphs
CoRR abs/0809.1522: (2008) |
40 | EE | János Körner,
Claudia Malvenuto,
Gábor Simonyi:
Graph-Different Permutations.
SIAM J. Discrete Math. 22(2): 489-499 (2008) |
2007 |
39 | EE | János Körner,
Gábor Simonyi,
Blerina Sinaimeri:
On types of growth for graph-different permutations
CoRR abs/0712.1442: (2007) |
38 | EE | János Körner,
Blerina Sinaimeri:
On Cancellative Set Families.
Combinatorics, Probability & Computing 16(5): 767-773 (2007) |
37 | EE | Emanuela Fachini,
János Körner:
Cross-intersecting couples of graphs.
Journal of Graph Theory 56(2): 105-112 (2007) |
2006 |
36 | EE | Rudolf Ahlswede,
János Körner:
Appendix: On Common Information and Related Characteristics of Correlated Information Sources.
GTIT-C 2006: 664-677 |
35 | EE | János Körner,
Claudia Malvenuto:
Pairwise colliding permutations and the capacity of infinite graphs.
SIAM J. Discrete Math. 20(1): 203-212 (2006) |
2005 |
34 | EE | János Körner,
Concetta Pilotto,
Gábor Simonyi:
Local chromatic number and Sperner capacity.
J. Comb. Theory, Ser. B 95(1): 101-117 (2005) |
2003 |
33 | | Emanuela Fachini,
János Körner:
Codes for a long silence.
IEEE Transactions on Information Theory 49(8): 2020-2023 (2003) |
2002 |
32 | EE | János Körner,
Angelo Monti:
Delta-Systems and Qualitative (In)Dependence.
J. Comb. Theory, Ser. A 99(1): 75-84 (2002) |
2001 |
31 | | Emanuela Fachini,
János Körner:
A Note On Counting Very Different Sequences.
Combinatorics, Probability & Computing 10(6): (2001) |
30 | EE | János Körner,
Katalin Marton:
Relative capacity and dimension of graphs.
Discrete Mathematics 235(1-3): 307-315 (2001) |
29 | EE | János Körner,
Angelo Monti:
Delta-systems and qualitative (in)dependence.
Electronic Notes in Discrete Mathematics 10: 160-163 (2001) |
28 | EE | Emanuela Fachini,
János Körner,
Angelo Monti:
A Better Bound for Locally Thin Set Families.
J. Comb. Theory, Ser. A 95(2): 209-218 (2001) |
27 | EE | János Körner,
Angelo Monti:
Compact Representations of the Intersection Structure of Families of Finite Sets.
SIAM J. Discrete Math. 14(2): 181-192 (2001) |
2000 |
26 | EE | János Körner,
Gábor Simonyi:
Graph Pairs and their Entropies: Modularity Problems.
Combinatorica 20(2): 227-240 (2000) |
25 | | Noga Alon,
János Körner,
Angelo Monti:
String Quartets In Binary.
Combinatorics, Probability & Computing 9(5): (2000) |
24 | | Noga Alon,
Emanuela Fachini,
János Körner:
Locally Thin Set Families.
Combinatorics, Probability & Computing 9(6): (2000) |
1999 |
23 | EE | Caterina De Simone,
János Körner:
On the Odd Cycles of Normal Graphs.
Discrete Applied Mathematics 94(1-3): 161-169 (1999) |
1998 |
22 | | János Körner,
Alon Orlitsky:
Zero-Error Information Theory.
IEEE Transactions on Information Theory 44(6): 2207-2229 (1998) |
1997 |
21 | EE | Henk D. L. Hollmann,
János Körner,
Simon Litsyn:
Tiling Hamming Space with Few Spheres.
J. Comb. Theory, Ser. A 80(2): 388-393 (1997) |
1996 |
20 | EE | Emanuela Fachini,
János Körner:
Tight Packings of Hamming Spheres.
J. Comb. Theory, Ser. A 76(2): 292-294 (1996) |
1995 |
19 | | János Körner:
On the Extremal Combinatorics of the Hamming Space.
J. Comb. Theory, Ser. A 71(1): 112-126 (1995) |
1994 |
18 | | János Körner,
M. Lucertini:
Compressing inconsistent data.
IEEE Transactions on Information Theory 40(3): 706-715 (1994) |
17 | | Luisa Gargano,
János Körner,
Ugo Vaccaro:
Capacities: From Information Theory to Extremal Set Theory.
J. Comb. Theory, Ser. A 68(2): 296-316 (1994) |
1992 |
16 | | János Körner,
Gábor Simonyi,
Zsolt Tuza:
Perfect couples of graphs.
Combinatorica 12(2): 179-192 (1992) |
15 | EE | Luisa Gargano,
János Körner,
Ugo Vaccaro:
Search problems for two irregular coins with incomplete feedback: the underweight model.
Discrete Applied Mathematics 36(2): 191-197 (1992) |
14 | | János Körner,
Gábor Simonyi:
A Sperner-Type Theorem and Qualitative Independence.
J. Comb. Theory, Ser. A 59(1): 90-103 (1992) |
13 | | Luisa Gargano,
János Körner,
Ugo Vaccaro:
Qualitative Independence and Sperner Problems for Directed Graphs.
J. Comb. Theory, Ser. A 61(2): 173-192 (1992) |
1990 |
12 | | 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) |
11 | | János Körner,
Katalin Marton:
On the capacity of uniform hypergraphs.
IEEE Transactions on Information Theory 36(1): 153- (1990) |
1988 |
10 | | János Körner,
Katalin Marton:
Random access communication and graph entropy.
IEEE Transactions on Information Theory 34(2): 312- (1988) |
9 | | János Körner,
Katalin Marton:
Graphs that Split Entropies.
SIAM J. Discrete Math. 1(1): 71-79 (1988) |
8 | | János Körner,
Gábor Simonyi:
Separating Partition System and Locally Different Sequences.
SIAM J. Discrete Math. 1(3): 355-359 (1988) |
1986 |
7 | EE | János Körner,
Victor K. Wei:
Addendum to "odd and even hamming spheres also have minimum boundary".
Discrete Mathematics 62(1): 105-106 (1986) |
1984 |
6 | EE | János Körner,
Victor K. Wei:
Odd and even hamming spheres also have minimum boundary.
Discrete Mathematics 51(2): 147-165 (1984) |
5 | | János Körner:
OPEC or a basic problem in source networks.
IEEE Transactions on Information Theory 30(1): 68-77 (1984) |
4 | | Frank K. Hwang,
János Körner,
Victor K.-W. Wei:
Selecting Non-consecutive Balls Arranged in Many Lines.
J. Comb. Theory, Ser. A 37(3): 327-336 (1984) |
1983 |
3 | | Thomas H. E. Ericson,
János Körner:
Successive encoding of correlated sources.
IEEE Transactions on Information Theory 29(3): 390-395 (1983) |
1982 |
2 | | Imre Csiszár,
János Körner:
Feedback does not affect the reliability function of a DMC at rates above capacity.
IEEE Transactions on Information Theory 28(1): 92- (1982) |
1981 |
1 | | Imre Csiszár,
János Körner:
Graph decomposition: A new key to coding theorems.
IEEE Transactions on Information Theory 27(1): 5-11 (1981) |