| 2012 | ||
|---|---|---|
| j52 | János Körner, Silvia Messuti, Gábor Simonyi: Families of Graph-different Hamilton Paths. SIAM J. Discrete Math. 26(1): 321-329 (2012) | |
| i4 | ||
| 2011 | ||
| j51 | Graham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth: Permutation Capacities and Oriented Infinite Paths. Electronic Notes in Discrete Mathematics 38: 195-199 (2011) | |
| j50 | János Körner, Silvia Messuti, Gábor Simonyi: Families of Very Different Paths. Electronic Notes in Discrete Mathematics 38: 529-533 (2011) | |
| j49 | Emanuela Fachini, János Körner: Forbiddance and Capacity. Graphs and Combinatorics 27(4): 495-503 (2011) | |
| j48 | Gérard D. Cohen, Emanuela Fachini, János Körner: Skewincidence. IEEE Transactions on Information Theory 57(11): 7313-7316 (2011) | |
| i3 | János Körner, Silvia Messuti, Gábor Simonyi: Families of graph-different Hamilton paths. CoRR abs/1106.3754 (2011) | |
| 2010 | ||
| j47 | Graham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth: Permutation Capacities of Families of Oriented Infinite Paths. SIAM J. Discrete Math. 24(2): 441-456 (2010) | |
| 2009 | ||
| j46 | János Körner, Gábor Simonyi, Blerina Sinaimeri: On types of growth for graph-different permutations. J. Comb. Theory, Ser. A 116(3): 713-723 (2009) | |
| 2008 | ||
| j45 | János Körner, Claudia Malvenuto, Gábor Simonyi: Graph-Different Permutations. SIAM J. Discrete Math. 22(2): 489-499 (2008) | |
| i2 | Gérard D. Cohen, Emanuela Fachini, János Körner: On the permutation capacity of digraphs. CoRR abs/0809.1522 (2008) | |
| 2007 | ||
| j44 | János Körner, Blerina Sinaimeri: On Cancellative Set Families. Combinatorics, Probability & Computing 16(5): 767-773 (2007) | |
| j43 | Emanuela Fachini, János Körner: Cross-intersecting couples of graphs. Journal of Graph Theory 56(2): 105-112 (2007) | |
| i1 | János Körner, Gábor Simonyi, Blerina Sinaimeri: On types of growth for graph-different permutations. CoRR abs/0712.1442 (2007) | |
| 2006 | ||
| j42 | János Körner, Claudia Malvenuto: Pairwise colliding permutations and the capacity of infinite graphs. SIAM J. Discrete Math. 20(1): 203-212 (2006) | |
| c1 | Rudolf Ahlswede, János Körner: Appendix: On Common Information and Related Characteristics of Correlated Information Sources. GTIT-C 2006: 664-677 | |
| 2005 | ||
| j41 | 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 | ||
| j40 | Emanuela Fachini, János Körner: Codes for a long silence. IEEE Transactions on Information Theory 49(8): 2020-2023 (2003) | |
| 2002 | ||
| j39 | János Körner, Angelo Monti: Delta-Systems and Qualitative (In)Dependence. J. Comb. Theory, Ser. A 99(1): 75-84 (2002) | |
| 2001 | ||
| j38 | Emanuela Fachini, János Körner: A Note On Counting Very Different Sequences. Combinatorics, Probability & Computing 10(6): 501-504 (2001) | |
| j37 | János Körner, Katalin Marton: Relative capacity and dimension of graphs. Discrete Mathematics 235(1-3): 307-315 (2001) | |
| j36 | János Körner, Angelo Monti: Delta-systems and qualitative (in)dependence. Electronic Notes in Discrete Mathematics 10: 160-163 (2001) | |
| j35 | 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) | |
| j34 | 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 | ||
| j33 | János Körner, Gábor Simonyi: Graph Pairs and their Entropies: Modularity Problems. Combinatorica 20(2): 227-240 (2000) | |
| j32 | Noga Alon, János Körner, Angelo Monti: String Quartets In Binary. Combinatorics, Probability & Computing 9(5): 381-390 (2000) | |
| j31 | Noga Alon, Emanuela Fachini, János Körner: Locally Thin Set Families. Combinatorics, Probability & Computing 9(6): 481-488 (2000) | |
| j30 | Emanuela Fachini, János Körner: Colour Number, Capacity, and Perfectness of Directed Graphs. Graphs and Combinatorics 16(4): 389-398 (2000) | |
| 1999 | ||
| j29 | Caterina De Simone, János Körner: On the Odd Cycles of Normal Graphs. Discrete Applied Mathematics 94(1-3): 161-169 (1999) | |
| 1998 | ||
| j28 | János Körner: On Clique Growth in Products of Directed Graphs. Graphs and Combinatorics 14(1): 25-36 (1998) | |
| j27 | János Körner, Alon Orlitsky: Zero-Error Information Theory. IEEE Transactions on Information Theory 44(6): 2207-2229 (1998) | |
| 1997 | ||
| j26 | 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 | ||
| j25 | Emanuela Fachini, János Körner: Tight Packings of Hamming Spheres. J. Comb. Theory, Ser. A 76(2): 292-294 (1996) | |
| 1995 | ||
| j24 | Luisa Gargano, János Körner, Ugo Vaccaro: On the capacity of boolean graph formulæ. Graphs and Combinatorics 11(1): 29-48 (1995) | |
| j23 | János Körner: On the Extremal Combinatorics of the Hamming Space. J. Comb. Theory, Ser. A 71(1): 112-126 (1995) | |
| 1994 | ||
| j22 | Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi: Different capacities of a digraph. Graphs and Combinatorics 10(2-4): 105-121 (1994) | |
| j21 | 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) | |
| j20 | János Körner, M. Lucertini: Compressing inconsistent data. IEEE Transactions on Information Theory 40(3): 706-715 (1994) | |
| 1993 | ||
| j19 | Luisa Gargano, János Körner, Ugo Vaccaro: Sperner capacities. Graphs and Combinatorics 9(1): 31-46 (1993) | |
| 1992 | ||
| j18 | János Körner, Gábor Simonyi, Zsolt Tuza: Perfect couples of graphs. Combinatorica 12(2): 179-192 (1992) | |
| j17 | 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) | |
| j16 | János Körner, Gábor Simonyi: A Sperner-Type Theorem and Qualitative Independence. J. Comb. Theory, Ser. A 59(1): 90-103 (1992) | |
| j15 | 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 | ||
| j14 | 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) | |
| j13 | János Körner, Katalin Marton: On the capacity of uniform hypergraphs. IEEE Transactions on Information Theory 36(1): 153-156 (1990) | |
| 1988 | ||
| j12 | János Körner, Katalin Marton: Graphs that Split Entropies. SIAM J. Discrete Math. 1(1): 71-79 (1988) | |
| j11 | János Körner, Gábor Simonyi: Separating Partition Systems and Locally Different Sequences. SIAM J. Discrete Math. 1(3): 355-359 (1988) | |
| j10 | János Körner, Katalin Marton: Random access communication and graph entropy. IEEE Transactions on Information Theory 34(2): 312-314 (1988) | |
| 1986 | ||
| j9 | 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 | ||
| j8 | János Körner, Victor K. Wei: Odd and even hamming spheres also have minimum boundary. Discrete Mathematics 51(2): 147-165 (1984) | |
| j7 | 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) | |
| j6 | János Körner: OPEC or a basic problem in source networks. IEEE Transactions on Information Theory 30(1): 68-77 (1984) | |
| 1983 | ||
| j5 | Thomas H. E. Ericson, János Körner: Successive encoding of correlated sources. IEEE Transactions on Information Theory 29(3): 390-395 (1983) | |
| 1982 | ||
| j4 | 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-93 (1982) | |
| 1981 | ||
| j3 | 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) | |
| 1980 | ||
| j2 | Imre Csiszár, János Körner: Towards a general theory of source networks. IEEE Transactions on Information Theory 26(2): 155-165 (1980) | |
| j1 | János Körner, Andrea Sgarro: Universally attainable error exponents for broadcast channels with degraded message sets. IEEE Transactions on Information Theory 26(6): 670-679 (1980) | |
Colors in the list of coauthors
Last update Sat May 18 18:11:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page