default search action
János Körner
Person information
- affiliation: Sapienza University of Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j75]Noga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi:
Structured Codes of Graphs. SIAM J. Discret. Math. 37(1): 379-403 (2023) - 2022
- [i8]Anna Gujgiczer, János Körner, Gábor Simonyi:
Codes with structured Hamming distance in graph families. CoRR abs/2202.06810 (2022) - 2021
- [j74]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): 3187-3189 (2021) - 2020
- [j73]Emanuela Fachini, János Körner
Divergent permutations. J. Comb. Theory A 173: 105231 (2020)
2010 – 2019
- 2019
- [j72]Gérard D. Cohen, Emanuela Fachini, János Körner:
Interlocked Permutations. SIAM J. Discret. Math. 33(3): 1662-1668 (2019) - [c2]János Körner, Chandra Nair, David Ng
On the size of pairwise-colliding permutations. ISIT 2019: 2354-2358 - [i7]Emanuela Fachini, János Körner:
Divergent permutations. CoRR abs/1904.05113 (2019) - 2018
- [j71]János Körner
Families of locally separated Hamilton paths. J. Graph Theory 88(3): 402-410 (2018) - 2017
- [j70]Gérard D. Cohen, Emanuela Fachini, János Körner:
Path Separation by Short Cycles. J. Graph Theory 85(1): 107-114 (2017) - [j69]Emanuela Fachini, János Körner
Hamilton Paths With Lasting Separation. IEEE Trans. Inf. Theory 63(10): 6344-6346 (2017) - 2016
- [j68]Gérard D. Cohen, Emanuela Fachini, János Körner
Zero-Error Capacity of Binary Channels With Memory. IEEE Trans. Inf. Theory 62(1): 3-7 (2016) - 2014
- [j67]Gérard D. Cohen, Emanuela Fachini, János Körner:
Connector Families of Graphs. Graphs Comb. 30(6): 1417-1425 (2014) - [i6]Gérard D. Cohen, Emanuela Fachini, János Körner:
Zero-error capacity of binary channels with memory. CoRR abs/1402.0349 (2014) - [i5]János Körner, Angelo Monti:
Families of locally separated Hamilton paths. CoRR abs/1411.3902 (2014) - 2013
- [j66]Gérard D. Cohen, Emanuela Fachini, János Körner:
More on Connector Families. Electron. Notes Discret. Math. 44: 23-29 (2013) - [j65]János Körner, Irene Muzi:
Degree-Doubling Graph Families. SIAM J. Discret. Math. 27(3): 1575-1583 (2013) - 2012
- [j64]János Körner, Silvia Messuti, Gábor Simonyi:
Families of Graph-different Hamilton Paths. SIAM J. Discret. Math. 26(1): 321-329 (2012) - [i4]János Körner, Irene Muzi:
Degree-doubling graph families. CoRR abs/1208.1963 (2012) - 2011
- [b1]Imre Csiszár, János Körner:
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition. Cambridge University Press 2011, ISBN 978-0-51192188-9, pp. 1-499 - [j63]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: 195-199 (2011) - [j62]János Körner, Silvia Messuti, Gábor Simonyi:
Families of Very Different Paths. Electron. Notes Discret. Math. 38: 529-533 (2011) - [j61]Emanuela Fachini, János Körner:
Forbiddance and Capacity. Graphs Comb. 27(4): 495-503 (2011) - [j60]Gérard D. Cohen, Emanuela Fachini, János Körner:
Skewincidence. IEEE Trans. Inf. 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
- [j59]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): 441-456 (2010)
2000 – 2009
- 2009
- [j58]János Körner, Gábor Simonyi, Blerina Sinaimeri
On types of growth for graph-different permutations. J. Comb. Theory A 116(3): 713-723 (2009) - 2008
- [j57]János Körner, Claudia Malvenuto, Gábor Simonyi:
Graph-Different Permutations. SIAM J. Discret. 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
- [j56]János Körner, Blerina Sinaimeri
On Cancellative Set Families. Comb. Probab. Comput. 16(5): 767-773 (2007) - [j55]Emanuela Fachini, János Körner:
Cross-intersecting couples of graphs. J. 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
- [j54]János Körner, Claudia Malvenuto:
Pairwise colliding permutations and the capacity of infinite graphs. SIAM J. Discret. 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
- [j53]János Körner, Concetta Pilotto, Gábor Simonyi:
Local chromatic number and Sperner capacity. J. Comb. Theory B 95(1): 101-117 (2005) - 2003
- [j52]Emanuela Fachini, János Körner:
Codes for a long silence. IEEE Trans. Inf. Theory 49(8): 2020-2023 (2003) - 2002
- [j51]János Körner, Angelo Monti:
Delta-Systems and Qualitative (In)Dependence. J. Comb. Theory A 99(1): 75-84 (2002) - 2001
- [j50]Emanuela Fachini, János Körner, Angelo Monti:
Self-Similarity Bounds for Locally Thin Set Families. Comb. Probab. Comput. 10(4): 309-315 (2001) - [j49]Emanuela Fachini, János Körner:
A Note On Counting Very Different Sequences. Comb. Probab. Comput. 10(6): 501-504 (2001) - [j48]János Körner, Katalin Marton:
Relative capacity and dimension of graphs. Discret. Math. 235(1-3): 307-315 (2001) - [j47]János Körner, Angelo Monti:
Delta-systems and qualitative (in)dependence. Electron. Notes Discret. Math. 10: 160-163 (2001) - [j46]Emanuela Fachini, János Körner, Angelo Monti:
A Better Bound for Locally Thin Set Families. J. Comb. Theory A 95(2): 209-218 (2001) - [j45]János Körner, Angelo Monti:
Compact Representations of the Intersection Structure of Families of Finite Sets. SIAM J. Discret. Math. 14(2): 181-192 (2001) - 2000
- [j44]János Körner, Gábor Simonyi:
Graph Pairs and their Entropies: Modularity Problems. Comb. 20(2): 227-240 (2000) - [j43]Noga Alon, János Körner, Angelo Monti:
String Quartets In Binary. Comb. Probab. Comput. 9(5): 381-390 (2000) - [j42]Noga Alon, Emanuela Fachini, János Körner:
Locally Thin Set Families. Comb. Probab. Comput. 9(6): 481-488 (2000) - [j41]Emanuela Fachini, János Körner:
Colour Number, Capacity, and Perfectness of Directed Graphs. Graphs Comb. 16(4): 389-398 (2000)
1990 – 1999
- 1999
- [j40]Caterina De Simone, János Körner:
On the Odd Cycles of Normal Graphs. Discret. Appl. Math. 94(1-3): 161-169 (1999) - 1998
- [j39]János Körner:
On Clique Growth in Products of Directed Graphs. Graphs Comb. 14(1): 25-36 (1998) - [j38]János Körner, Alon Orlitsky:
Zero-Error Information Theory. IEEE Trans. Inf. Theory 44(6): 2207-2229 (1998) - 1997
- [j37]Henk D. L. Hollmann
Tiling Hamming Space with Few Spheres. J. Comb. Theory A 80(2): 388-393 (1997) - 1996
- [j36]Emanuela Fachini, János Körner:
Tight Packings of Hamming Spheres. J. Comb. Theory A 76(2): 292-294 (1996) - 1995
- [j35]János Körner:
Intersection number and capacities of graphs. Discret. Math. 142(1-3): 169-184 (1995) - [j34]Ron Holzman, János Körner:
Cancellative pairs of families of sets. Eur. J. Comb. 16(3): 263-266 (1995) - [j33]Luisa Gargano
On the capacity of boolean graph formulæ. Graphs Comb. 11(1): 29-48 (1995) - [j32]János Körner:
On the Extremal Combinatorics of the Hamming Space. J. Comb. Theory A 71(1): 112-126 (1995) - 1994
- [j31]Anna Galluccio, Luisa Gargano
Different capacities of a digraph. Graphs Comb. 10(2-4): 105-121 (1994) - [j30]Luisa Gargano, János Körner, Ugo Vaccaro:
Capacities: From Information Theory to Extremal Set Theory. J. Comb. Theory A 68(2): 296-316 (1994) - [j29]János Körner, Mario Lucertini:
Compressing inconsistent data. IEEE Trans. Inf. Theory 40(3): 706-715 (1994) - 1993
- [j28]Luisa Gargano
Sperner capacities. Graphs Comb. 9(1): 31-46 (1993) - 1992
- [j27]János Körner, Gábor Simonyi, Zsolt Tuza:
Perfect couples of graphs. Comb. 12(2): 179-192 (1992) - [j26]Luisa Gargano
Search problems for two irregular coins with incomplete feedback: the underweight model. Discret. Appl. Math. 36(2): 191-197 (1992) - [j25]János Körner, Gábor Simonyi:
A Sperner-Type Theorem and Qualitative Independence. J. Comb. Theory A 59(1): 90-103 (1992) - [j24]Luisa Gargano, János Körner, Ugo Vaccaro:
Qualitative Independence and Sperner Problems for Directed Graphs. J. Comb. Theory A 61(2): 173-192 (1992) - 1990
- [j23]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): 27-40 (1990) - [j22]János Körner, Katalin Marton:
On the capacity of uniform hypergraphs. IEEE Trans. Inf. Theory 36(1): 153-156 (1990)
1980 – 1989
- 1988
- [j21]János Körner, Katalin Marton:
New Bounds for Perfect Hashing via Information Theory. Eur. J. Comb. 9(6): 523-530 (1988) - [j20]János Körner, Katalin Marton:
Graphs that Split Entropies. SIAM J. Discret. Math. 1(1): 71-79 (1988) - [j19]János Körner, Gábor Simonyi:
Separating Partition Systems and Locally Different Sequences. SIAM J. Discret. Math. 1(3): 355-359 (1988) - [j18]János Körner, Katalin Marton:
Random access communication and graph entropy. IEEE Trans. Inf. Theory 34(2): 312-314 (1988) - 1986
- [j17]János Körner, Victor K. Wei:
Addendum to "odd and even hamming spheres also have minimum boundary". Discret. Math. 62(1): 105-106 (1986) - 1984
- [j16]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): 1089-1112 (1984) - [j15]János Körner, Victor K. Wei:
Odd and even hamming spheres also have minimum boundary. Discret. Math. 51(2): 147-165 (1984) - [j14]Frank K. Hwang, János Körner, Victor K.-W. Wei:
Selecting Non-consecutive Balls Arranged in Many Lines. J. Comb. Theory A 37(3): 327-336 (1984) - [j13]János Körner:
OPEC or a basic problem in source networks. IEEE Trans. Inf. Theory 30(1): 68-77 (1984) - 1983
- [j12]Thomas H. E. Ericson, János Körner:
Successive encoding of correlated sources. IEEE Trans. Inf. Theory 29(3): 390-395 (1983) - 1982
- [j11]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): 92-93 (1982) - 1981
- [j10]Imre Csiszár, János Körner:
Graph decomposition: A new key to coding theorems. IEEE Trans. Inf. Theory 27(1): 5-11 (1981) - 1980
- [j9]Imre Csiszár, János Körner:
Towards a general theory of source networks. IEEE Trans. Inf. Theory 26(2): 155-165 (1980) - [j8]János Körner, Andrea Sgarro:
Universally attainable error exponents for broadcast channels with degraded message sets. IEEE Trans. Inf. Theory 26(6): 670-679 (1980)
1970 – 1979
- 1979
- [j7]Gunter Dueck, János Körner:
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.). IEEE Trans. Inf. Theory 25(1): 82-85 (1979) - [j6]János Körner, Katalin Marton:
How to encode the modulo-two sum of binary sources (Corresp.). IEEE Trans. Inf. Theory 25(2): 219-221 (1979) - 1978
- [j5]Imre Csiszár, János Körner:
Broadcast channels with confidential messages. IEEE Trans. Inf. Theory 24(3): 339-348 (1978) - 1977
- [j4]János Körner, Katalin Marton:
General broadcast channels with degraded message sets. IEEE Trans. Inf. Theory 23(1): 60-64 (1977) - [j3]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): 751-761 (1977) - 1975
- [j2]Rudolf Ahlswede, János Körner:
Source coding with side information and a converse for degraded broadcast channels. IEEE Trans. Inf. Theory 21(6): 629-637 (1975) - 1973
- [j1]János Körner, Giuseppe Longo:
Two-step encoding for finite sources. IEEE Trans. Inf. Theory 19(6): 778-782 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: