János Körner

Publication Activity (10 Years)

Years Active: 1973-2023
Publications (10 Years): 11

Top Topics

Storage Capacity

Graph Representation

Top Venues

IEEE Trans. Inf. Theory

SIAM J. Discret. Math.

J. Graph Theory

Publications

Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi
Structured Codes of Graphs. SIAM J. Discret. Math. 37 (1) (2023)
Anna Gujgiczer, János Körner, Gábor Simonyi
Codes with structured Hamming distance in graph families. CoRR (2022)
Alexander Barg, Lara Dolecek, Ryan Gabrys, Gyula O. H. Katona, János Körner, Andrew McGregor, Olgica Milenkovic, Sihem Mesnager, Gilles Zémor
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein". IEEE Trans. Inf. Theory 67 (6) (2021)
Emanuela Fachini, János Körner
Divergent permutations. J. Comb. Theory, Ser. A 173 (2020)
János Körner, Chandra Nair, David Ng
On the size of pairwise-colliding permutations. ISIT (2019)
Emanuela Fachini, János Körner
Divergent permutations. CoRR (2019)
Gérard D. Cohen, Emanuela Fachini, János Körner
Interlocked Permutations. SIAM J. Discret. Math. 33 (3) (2019)
János Körner, Angelo Monti
Families of locally separated Hamilton paths. J. Graph Theory 88 (3) (2018)
Gérard D. Cohen, Emanuela Fachini, János Körner
Path Separation by Short Cycles. J. Graph Theory 85 (1) (2017)
Emanuela Fachini, János Körner
Hamilton Paths With Lasting Separation. IEEE Trans. Inf. Theory 63 (10) (2017)
Gérard D. Cohen, Emanuela Fachini, János Körner
Zero-Error Capacity of Binary Channels With Memory. IEEE Trans. Inf. Theory 62 (1) (2016)
Gérard D. Cohen, Emanuela Fachini, János Körner
Zero-error capacity of binary channels with memory. CoRR (2014)
János Körner, Angelo Monti
Families of locally separated Hamilton paths. CoRR (2014)
Gérard D. Cohen, Emanuela Fachini, János Körner
Connector Families of Graphs. Graphs Comb. 30 (6) (2014)
János Körner, Irene Muzi
Degree-Doubling Graph Families. SIAM J. Discret. Math. 27 (3) (2013)
Gérard D. Cohen, Emanuela Fachini, János Körner
More on Connector Families. Electron. Notes Discret. Math. 44 (2013)
János Körner, Irene Muzi
Degree-doubling graph families CoRR (2012)
János Körner, Silvia Messuti, Gábor Simonyi
Families of Graph-different Hamilton Paths. SIAM J. Discret. Math. 26 (1) (2012)
Emanuela Fachini, János Körner
Forbiddance and Capacity. Graphs Comb. 27 (4) (2011)
János Körner, Silvia Messuti, Gábor Simonyi
Families of Very Different Paths. Electron. Notes Discret. Math. 38 (2011)
Graham R. 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. Electron. Notes Discret. Math. 38 (2011)
Gérard D. Cohen, Emanuela Fachini, János Körner
Skewincidence. IEEE Trans. Inf. Theory 57 (11) (2011)
János Körner, Silvia Messuti, Gábor Simonyi
Families of graph-different Hamilton paths CoRR (2011)
Graham R. 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. Discret. Math. 24 (2) (2010)
János Körner, Gábor Simonyi, Blerina Sinaimeri
On types of growth for graph-different permutations. J. Comb. Theory, Ser. A 116 (3) (2009)
Gérard D. Cohen, Emanuela Fachini, János Körner
On the permutation capacity of digraphs CoRR (2008)
János Körner, Claudia Malvenuto, Gábor Simonyi
Graph-Different Permutations. SIAM J. Discret. Math. 22 (2) (2008)
Emanuela Fachini, János Körner
Cross-intersecting couples of graphs. J. Graph Theory 56 (2) (2007)
János Körner, Gábor Simonyi, Blerina Sinaimeri
On types of growth for graph-different permutations CoRR (2007)
János Körner, Blerina Sinaimeri
On Cancellative Set Families. Comb. Probab. Comput. 16 (5) (2007)
Rudolf Ahlswede, János Körner
Appendix: On Common Information and Related Characteristics of Correlated Information Sources. GTIT-C (2006)
János Körner, Claudia Malvenuto
Pairwise colliding permutations and the capacity of infinite graphs. SIAM J. Discret. Math. 20 (1) (2006)
János Körner, Concetta Pilotto, Gábor Simonyi
Local chromatic number and Sperner capacity. J. Comb. Theory, Ser. B 95 (1) (2005)
Emanuela Fachini, János Körner
Codes for a long silence. IEEE Trans. Inf. Theory 49 (8) (2003)
János Körner, Angelo Monti
Delta-Systems and Qualitative (In)Dependence. J. Comb. Theory, Ser. A 99 (1) (2002)
János Körner, Angelo Monti
Delta-systems and qualitative (in)dependence. Electron. Notes Discret. Math. 10 (2001)
Emanuela Fachini, János Körner, Angelo Monti
Self-Similarity Bounds for Locally Thin Set Families. Comb. Probab. Comput. 10 (4) (2001)
Emanuela Fachini, János Körner, Angelo Monti
A Better Bound for Locally Thin Set Families. J. Comb. Theory, Ser. A 95 (2) (2001)
Emanuela Fachini, János Körner
A Note On Counting Very Different Sequences. Comb. Probab. Comput. 10 (6) (2001)
János Körner, Angelo Monti
Compact Representations of the Intersection Structure of Families of Finite Sets. SIAM J. Discret. Math. 14 (2) (2001)
János Körner, Katalin Marton
Relative capacity and dimension of graphs. Discret. Math. 235 (1-3) (2001)
Emanuela Fachini, János Körner
Colour Number, Capacity, and Perfectness of Directed Graphs. Graphs Comb. 16 (4) (2000)
Noga Alon, János Körner, Angelo Monti
String Quartets In Binary. Comb. Probab. Comput. 9 (5) (2000)
Noga Alon, Emanuela Fachini, János Körner
Locally Thin Set Families. Comb. Probab. Comput. 9 (6) (2000)
János Körner, Gábor Simonyi
Graph Pairs and their Entropies: Modularity Problems. Comb. 20 (2) (2000)
Caterina De Simone, János Körner
On the Odd Cycles of Normal Graphs. Discret. Appl. Math. 94 (1-3) (1999)
János Körner
On Clique Growth in Products of Directed Graphs. Graphs Comb. 14 (1) (1998)
János Körner, Alon Orlitsky
Zero-Error Information Theory. IEEE Trans. Inf. Theory 44 (6) (1998)
Henk D. L. Hollmann, János Körner, Simon Litsyn
Tiling Hamming Space with Few Spheres. J. Comb. Theory, Ser. A 80 (2) (1997)
Emanuela Fachini, János Körner
Tight Packings of Hamming Spheres. J. Comb. Theory, Ser. A 76 (2) (1996)
János Körner
Intersection number and capacities of graphs. Discret. Math. 142 (1-3) (1995)
Luisa Gargano, János Körner, Ugo Vaccaro
On the capacity of boolean graph formulæ. Graphs Comb. 11 (1) (1995)
Ron Holzman, János Körner
Cancellative pairs of families of sets. Eur. J. Comb. 16 (3) (1995)
János Körner
On the Extremal Combinatorics of the Hamming Space. J. Comb. Theory, Ser. A 71 (1) (1995)
Luisa Gargano, János Körner, Ugo Vaccaro
Capacities: From Information Theory to Extremal Set Theory. J. Comb. Theory, Ser. A 68 (2) (1994)
Anna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi
Different capacities of a digraph. Graphs Comb. 10 (2-4) (1994)
János Körner, Mario Lucertini
Compressing inconsistent data. IEEE Trans. Inf. Theory 40 (3) (1994)
Luisa Gargano, János Körner, Ugo Vaccaro
Sperner capacities. Graphs Comb. 9 (1) (1993)
Luisa Gargano, János Körner, Ugo Vaccaro
Qualitative Independence and Sperner Problems for Directed Graphs. J. Comb. Theory, Ser. A 61 (2) (1992)
Luisa Gargano, János Körner, Ugo Vaccaro
Search problems for two irregular coins with incomplete feedback: the underweight model. Discret. Appl. Math. 36 (2) (1992)
János Körner, Gábor Simonyi, Zsolt Tuza
Perfect couples of graphs. Comb. 12 (2) (1992)
János Körner, Gábor Simonyi
A Sperner-Type Theorem and Qualitative Independence. J. Comb. Theory, Ser. A 59 (1) (1992)
János Körner, Katalin Marton
On the capacity of uniform hypergraphs. IEEE Trans. Inf. Theory 36 (1) (1990)
Imre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi
Entropy splitting for antiblocking corners and perfect graphs. Comb. 10 (1) (1990)
János Körner, Katalin Marton
Graphs that Split Entropies. SIAM J. Discret. Math. 1 (1) (1988)
János Körner, Katalin Marton
Random access communication and graph entropy. IEEE Trans. Inf. Theory 34 (2) (1988)
János Körner, Katalin Marton
New Bounds for Perfect Hashing via Information Theory. Eur. J. Comb. 9 (6) (1988)
János Körner, Gábor Simonyi
Separating Partition Systems and Locally Different Sequences. SIAM J. Discret. Math. 1 (3) (1988)
János Körner, Victor K. Wei
Addendum to "odd and even hamming spheres also have minimum boundary". Discret. Math. 62 (1) (1986)
Jack K. Wolf, Aaron D. Wyner, Jacob Ziv, János Körner
Coding for a write-once memory. AT&T Bell Lab. Tech. J. 63 (6) (1984)
János Körner, Victor K. Wei
Odd and even hamming spheres also have minimum boundary. Discret. Math. 51 (2) (1984)
János Körner
OPEC or a basic problem in source networks. IEEE Trans. Inf. Theory 30 (1) (1984)
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) (1984)
Thomas H. E. Ericson, János Körner
Successive encoding of correlated sources. IEEE Trans. Inf. Theory 29 (3) (1983)
Imre Csiszár, János Körner
Feedback does not affect the reliability function of a DMC at rates above capacity. IEEE Trans. Inf. Theory 28 (1) (1982)
Imre Csiszár, János Körner
Graph decomposition: A new key to coding theorems. IEEE Trans. Inf. Theory 27 (1) (1981)
Imre Csiszár, János Körner
Towards a general theory of source networks. IEEE Trans. Inf. Theory 26 (2) (1980)
János Körner, Andrea Sgarro
Universally attainable error exponents for broadcast channels with degraded message sets. IEEE Trans. Inf. Theory 26 (6) (1980)
Gunter Dueck, János Körner
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.). IEEE Trans. Inf. Theory 25 (1) (1979)
János Körner, Katalin Marton
How to encode the modulo-two sum of binary sources (Corresp.). IEEE Trans. Inf. Theory 25 (2) (1979)
Imre Csiszár, János Körner
Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24 (3) (1978)
János Körner, Katalin Marton
Images of a set via two channels and their role in multi-user communication. IEEE Trans. Inf. Theory 23 (6) (1977)
János Körner, Katalin Marton
General broadcast channels with degraded message sets. IEEE Trans. Inf. Theory 23 (1) (1977)
Rudolf Ahlswede, János Körner
Source coding with side information and a converse for degraded broadcast channels. IEEE Trans. Inf. Theory 21 (6) (1975)
János Körner, Giuseppe Longo
Two-step encoding for finite sources. IEEE Trans. Inf. Theory 19 (6) (1973)