Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: János Körner
@article{DBLP:journals/siamdm/AlonGKMS23, author = {Noga Alon and Anna Gujgiczer and J{\'{a}}nos K{\"{o}}rner and Aleksa Milojevic and G{\'{a}}bor Simonyi}, title = {Structured Codes of Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {37}, number = {1}, pages = {379--403}, year = {2023}, url = {https://doi.org/10.1137/22m1487989}, doi = {10.1137/22M1487989}, timestamp = {Sun, 13 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/AlonGKMS23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-06810, author = {Anna Gujgiczer and J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi}, title = {Codes with structured Hamming distance in graph families}, journal = {CoRR}, volume = {abs/2202.06810}, year = {2022}, url = {https://arxiv.org/abs/2202.06810}, eprinttype = {arXiv}, eprint = {2202.06810}, timestamp = {Tue, 01 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-06810.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/BargDGKKMMMZ21, author = {Alexander Barg and Lara Dolecek and Ryan Gabrys and Gyula O. H. Katona and J{\'{a}}nos K{\"{o}}rner and Andrew McGregor and Olgica Milenkovic and Sihem Mesnager and Gilles Z{\'{e}}mor}, title = {Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein"}, journal = {{IEEE} Trans. Inf. Theory}, volume = {67}, number = {6}, pages = {3187--3189}, year = {2021}, url = {https://doi.org/10.1109/TIT.2021.3072555}, doi = {10.1109/TIT.2021.3072555}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/BargDGKKMMMZ21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jcta/FachiniK20, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Divergent permutations}, journal = {J. Comb. Theory, Ser. {A}}, volume = {173}, pages = {105231}, year = {2020}, url = {https://doi.org/10.1016/j.jcta.2020.105231}, doi = {10.1016/J.JCTA.2020.105231}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jcta/FachiniK20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/CohenFK19, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Interlocked Permutations}, journal = {{SIAM} J. Discret. Math.}, volume = {33}, number = {3}, pages = {1662--1668}, year = {2019}, url = {https://doi.org/10.1137/18M1200683}, doi = {10.1137/18M1200683}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/CohenFK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isit/KornerNN19, author = {J{\'{a}}nos K{\"{o}}rner and Chandra Nair and David Ng}, title = {On the size of pairwise-colliding permutations}, booktitle = {{IEEE} International Symposium on Information Theory, {ISIT} 2019, Paris, France, July 7-12, 2019}, pages = {2354--2358}, publisher = {{IEEE}}, year = {2019}, url = {https://doi.org/10.1109/ISIT.2019.8849602}, doi = {10.1109/ISIT.2019.8849602}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/isit/KornerNN19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1904-05113, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Divergent permutations}, journal = {CoRR}, volume = {abs/1904.05113}, year = {2019}, url = {http://arxiv.org/abs/1904.05113}, eprinttype = {arXiv}, eprint = {1904.05113}, timestamp = {Fri, 26 Apr 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1904-05113.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/KornerM18, author = {J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {Families of locally separated Hamilton paths}, journal = {J. Graph Theory}, volume = {88}, number = {3}, pages = {402--410}, year = {2018}, url = {https://doi.org/10.1002/jgt.22220}, doi = {10.1002/JGT.22220}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/KornerM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/CohenFK17, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Path Separation by Short Cycles}, journal = {J. Graph Theory}, volume = {85}, number = {1}, pages = {107--114}, year = {2017}, url = {https://doi.org/10.1002/jgt.22050}, doi = {10.1002/JGT.22050}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/CohenFK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/FachiniK17, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Hamilton Paths With Lasting Separation}, journal = {{IEEE} Trans. Inf. Theory}, volume = {63}, number = {10}, pages = {6344--6346}, year = {2017}, url = {https://doi.org/10.1109/TIT.2017.2738631}, doi = {10.1109/TIT.2017.2738631}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/FachiniK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CohenFK16, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Zero-Error Capacity of Binary Channels With Memory}, journal = {{IEEE} Trans. Inf. Theory}, volume = {62}, number = {1}, pages = {3--7}, year = {2016}, url = {https://doi.org/10.1109/TIT.2015.2499751}, doi = {10.1109/TIT.2015.2499751}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/CohenFK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/CohenFK14, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Connector Families of Graphs}, journal = {Graphs Comb.}, volume = {30}, number = {6}, pages = {1417--1425}, year = {2014}, url = {https://doi.org/10.1007/s00373-013-1347-3}, doi = {10.1007/S00373-013-1347-3}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/CohenFK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CohenFK14, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Zero-error capacity of binary channels with memory}, journal = {CoRR}, volume = {abs/1402.0349}, year = {2014}, url = {http://arxiv.org/abs/1402.0349}, eprinttype = {arXiv}, eprint = {1402.0349}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CohenFK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KornerM14, author = {J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {Families of locally separated Hamilton paths}, journal = {CoRR}, volume = {abs/1411.3902}, year = {2014}, url = {http://arxiv.org/abs/1411.3902}, eprinttype = {arXiv}, eprint = {1411.3902}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KornerM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/CohenFK13, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {More on Connector Families}, journal = {Electron. Notes Discret. Math.}, volume = {44}, pages = {23--29}, year = {2013}, url = {https://doi.org/10.1016/j.endm.2013.10.005}, doi = {10.1016/J.ENDM.2013.10.005}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/CohenFK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerM13, author = {J{\'{a}}nos K{\"{o}}rner and Irene Muzi}, title = {Degree-Doubling Graph Families}, journal = {{SIAM} J. Discret. Math.}, volume = {27}, number = {3}, pages = {1575--1583}, year = {2013}, url = {https://doi.org/10.1137/120887242}, doi = {10.1137/120887242}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerMS12, author = {J{\'{a}}nos K{\"{o}}rner and Silvia Messuti and G{\'{a}}bor Simonyi}, title = {Families of Graph-different Hamilton Paths}, journal = {{SIAM} J. Discret. Math.}, volume = {26}, number = {1}, pages = {321--329}, year = {2012}, url = {https://doi.org/10.1137/110837814}, doi = {10.1137/110837814}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerMS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1208-1963, author = {J{\'{a}}nos K{\"{o}}rner and Irene Muzi}, title = {Degree-doubling graph families}, journal = {CoRR}, volume = {abs/1208.1963}, year = {2012}, url = {http://arxiv.org/abs/1208.1963}, eprinttype = {arXiv}, eprint = {1208.1963}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1208-1963.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:books/cu/CsiszarK11, author = {Imre Csisz{\'{a}}r and J{\'{a}}nos K{\"{o}}rner}, title = {Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition}, publisher = {Cambridge University Press}, year = {2011}, url = {https://doi.org/10.1017/CBO9780511921889}, doi = {10.1017/CBO9780511921889}, isbn = {978-0-51192188-9}, timestamp = {Tue, 23 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/books/cu/CsiszarK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BrightwellCFFKST11, author = {Graham R. Brightwell and G{\'{e}}rard D. Cohen and Emanuela Fachini and Marianne Fairthorne and J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi and {\'{A}}gnes T{\'{o}}th}, title = {Permutation Capacities and Oriented Infinite Paths}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {195--199}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.033}, doi = {10.1016/J.ENDM.2011.09.033}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BrightwellCFFKST11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KornerMS11, author = {J{\'{a}}nos K{\"{o}}rner and Silvia Messuti and G{\'{a}}bor Simonyi}, title = {Families of Very Different Paths}, journal = {Electron. Notes Discret. Math.}, volume = {38}, pages = {529--533}, year = {2011}, url = {https://doi.org/10.1016/j.endm.2011.09.086}, doi = {10.1016/J.ENDM.2011.09.086}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KornerMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/FachiniK11, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Forbiddance and Capacity}, journal = {Graphs Comb.}, volume = {27}, number = {4}, pages = {495--503}, year = {2011}, url = {https://doi.org/10.1007/s00373-010-0987-9}, doi = {10.1007/S00373-010-0987-9}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/FachiniK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CohenFK11, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Skewincidence}, journal = {{IEEE} Trans. Inf. Theory}, volume = {57}, number = {11}, pages = {7313--7316}, year = {2011}, url = {https://doi.org/10.1109/TIT.2011.2161753}, doi = {10.1109/TIT.2011.2161753}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/CohenFK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1106-3754, author = {J{\'{a}}nos K{\"{o}}rner and Silvia Messuti and G{\'{a}}bor Simonyi}, title = {Families of graph-different Hamilton paths}, journal = {CoRR}, volume = {abs/1106.3754}, year = {2011}, url = {http://arxiv.org/abs/1106.3754}, eprinttype = {arXiv}, eprint = {1106.3754}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1106-3754.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BrightwellCFFKST10, author = {Graham R. Brightwell and G{\'{e}}rard D. Cohen and Emanuela Fachini and Marianne Fairthorne and J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi and {\'{A}}gnes T{\'{o}}th}, title = {Permutation Capacities of Families of Oriented Infinite Paths}, journal = {{SIAM} J. Discret. Math.}, volume = {24}, number = {2}, pages = {441--456}, year = {2010}, url = {https://doi.org/10.1137/090765407}, doi = {10.1137/090765407}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BrightwellCFFKST10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KornerSS09, author = {J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi and Blerina Sinaimeri}, title = {On types of growth for graph-different permutations}, journal = {J. Comb. Theory, Ser. {A}}, volume = {116}, number = {3}, pages = {713--723}, year = {2009}, url = {https://doi.org/10.1016/j.jcta.2008.11.003}, doi = {10.1016/J.JCTA.2008.11.003}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/KornerSS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerMS08, author = {J{\'{a}}nos K{\"{o}}rner and Claudia Malvenuto and G{\'{a}}bor Simonyi}, title = {Graph-Different Permutations}, journal = {{SIAM} J. Discret. Math.}, volume = {22}, number = {2}, pages = {489--499}, year = {2008}, url = {https://doi.org/10.1137/070692686}, doi = {10.1137/070692686}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerMS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0809-1522, author = {G{\'{e}}rard D. Cohen and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {On the permutation capacity of digraphs}, journal = {CoRR}, volume = {abs/0809.1522}, year = {2008}, url = {http://arxiv.org/abs/0809.1522}, eprinttype = {arXiv}, eprint = {0809.1522}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0809-1522.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/KornerS07, author = {J{\'{a}}nos K{\"{o}}rner and Blerina Sinaimeri}, title = {On Cancellative Set Families}, journal = {Comb. Probab. Comput.}, volume = {16}, number = {5}, pages = {767--773}, year = {2007}, url = {https://doi.org/10.1017/S0963548307008413}, doi = {10.1017/S0963548307008413}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/KornerS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/FachiniK07, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Cross-intersecting couples of graphs}, journal = {J. Graph Theory}, volume = {56}, number = {2}, pages = {105--112}, year = {2007}, url = {https://doi.org/10.1002/jgt.20252}, doi = {10.1002/JGT.20252}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/FachiniK07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0712-1442, author = {J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi and Blerina Sinaimeri}, title = {On types of growth for graph-different permutations}, journal = {CoRR}, volume = {abs/0712.1442}, year = {2007}, url = {http://arxiv.org/abs/0712.1442}, eprinttype = {arXiv}, eprint = {0712.1442}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0712-1442.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerM06, author = {J{\'{a}}nos K{\"{o}}rner and Claudia Malvenuto}, title = {Pairwise colliding permutations and the capacity of infinite graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {20}, number = {1}, pages = {203--212}, year = {2006}, url = {https://doi.org/10.1137/050632877}, doi = {10.1137/050632877}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/gtitc/AhlswedeK06, author = {Rudolf Ahlswede and J{\'{a}}nos K{\"{o}}rner}, editor = {Rudolf Ahlswede and Lars B{\"{a}}umer and Ning Cai and Harout K. Aydinian and Vladimir M. Blinovsky and Christian Deppe and Haik Mashurian}, title = {Appendix: On Common Information and Related Characteristics of Correlated Information Sources}, booktitle = {General Theory of Information Transfer and Combinatorics}, series = {Lecture Notes in Computer Science}, volume = {4123}, pages = {664--677}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11889342\_41}, doi = {10.1007/11889342\_41}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/gtitc/AhlswedeK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KornerPS05, author = {J{\'{a}}nos K{\"{o}}rner and Concetta Pilotto and G{\'{a}}bor Simonyi}, title = {Local chromatic number and Sperner capacity}, journal = {J. Comb. Theory, Ser. {B}}, volume = {95}, number = {1}, pages = {101--117}, year = {2005}, url = {https://doi.org/10.1016/j.jctb.2005.03.006}, doi = {10.1016/J.JCTB.2005.03.006}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/KornerPS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/FachiniK03, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Codes for a long silence}, journal = {{IEEE} Trans. Inf. Theory}, volume = {49}, number = {8}, pages = {2020--2023}, year = {2003}, url = {https://doi.org/10.1109/TIT.2003.814933}, doi = {10.1109/TIT.2003.814933}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/FachiniK03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KornerM02, author = {J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {Delta-Systems and Qualitative (In)Dependence}, journal = {J. Comb. Theory, Ser. {A}}, volume = {99}, number = {1}, pages = {75--84}, year = {2002}, url = {https://doi.org/10.1006/jcta.2002.3256}, doi = {10.1006/JCTA.2002.3256}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KornerM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FachiniKM01, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {Self-Similarity Bounds for Locally Thin Set Families}, journal = {Comb. Probab. Comput.}, volume = {10}, number = {4}, pages = {309--315}, year = {2001}, url = {https://doi.org/10.1017/S0963548301004667}, doi = {10.1017/S0963548301004667}, timestamp = {Wed, 13 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cpc/FachiniKM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/FachiniK01, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {A Note On Counting Very Different Sequences}, journal = {Comb. Probab. Comput.}, volume = {10}, number = {6}, pages = {501--504}, year = {2001}, url = {https://doi.org/10.1017/S0963548301004783}, doi = {10.1017/S0963548301004783}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/FachiniK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KornerM01, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {Relative capacity and dimension of graphs}, journal = {Discret. Math.}, volume = {235}, number = {1-3}, pages = {307--315}, year = {2001}, url = {https://doi.org/10.1016/S0012-365X(00)00283-1}, doi = {10.1016/S0012-365X(00)00283-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KornerM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KornerM01, author = {J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {Delta-systems and qualitative (in)dependence}, journal = {Electron. Notes Discret. Math.}, volume = {10}, pages = {160--163}, year = {2001}, url = {https://doi.org/10.1016/S1571-0653(04)00385-3}, doi = {10.1016/S1571-0653(04)00385-3}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KornerM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FachiniKM01, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {A Better Bound for Locally Thin Set Families}, journal = {J. Comb. Theory, Ser. {A}}, volume = {95}, number = {2}, pages = {209--218}, year = {2001}, url = {https://doi.org/10.1006/jcta.2000.3162}, doi = {10.1006/JCTA.2000.3162}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/FachiniKM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerM01, author = {J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {Compact Representations of the Intersection Structure of Families of Finite Sets}, journal = {{SIAM} J. Discret. Math.}, volume = {14}, number = {2}, pages = {181--192}, year = {2001}, url = {https://doi.org/10.1137/S0895480198348343}, doi = {10.1137/S0895480198348343}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KornerS00, author = {J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi}, title = {Graph Pairs and their Entropies: Modularity Problems}, journal = {Comb.}, volume = {20}, number = {2}, pages = {227--240}, year = {2000}, url = {https://doi.org/10.1007/s004930070022}, doi = {10.1007/S004930070022}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KornerS00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/AlonKM00, author = {Noga Alon and J{\'{a}}nos K{\"{o}}rner and Angelo Monti}, title = {String Quartets In Binary}, journal = {Comb. Probab. Comput.}, volume = {9}, number = {5}, pages = {381--390}, year = {2000}, url = {http://journals.cambridge.org/action/displayAbstract?aid=65797}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/AlonKM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cpc/AlonFK00, author = {Noga Alon and Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Locally Thin Set Families}, journal = {Comb. Probab. Comput.}, volume = {9}, number = {6}, pages = {481--488}, year = {2000}, url = {http://journals.cambridge.org/action/displayAbstract?aid=72363}, timestamp = {Thu, 12 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cpc/AlonFK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/FachiniK00, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Colour Number, Capacity, and Perfectness of Directed Graphs}, journal = {Graphs Comb.}, volume = {16}, number = {4}, pages = {389--398}, year = {2000}, url = {https://doi.org/10.1007/PL00007226}, doi = {10.1007/PL00007226}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/FachiniK00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/SimoneK99, author = {Caterina De Simone and J{\'{a}}nos K{\"{o}}rner}, title = {On the Odd Cycles of Normal Graphs}, journal = {Discret. Appl. Math.}, volume = {94}, number = {1-3}, pages = {161--169}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00018-9}, doi = {10.1016/S0166-218X(99)00018-9}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/SimoneK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/Korner98, author = {J{\'{a}}nos K{\"{o}}rner}, title = {On Clique Growth in Products of Directed Graphs}, journal = {Graphs Comb.}, volume = {14}, number = {1}, pages = {25--36}, year = {1998}, url = {https://doi.org/10.1007/s003730050012}, doi = {10.1007/S003730050012}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/Korner98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerO98, author = {J{\'{a}}nos K{\"{o}}rner and Alon Orlitsky}, title = {Zero-Error Information Theory}, journal = {{IEEE} Trans. Inf. Theory}, volume = {44}, number = {6}, pages = {2207--2229}, year = {1998}, url = {https://doi.org/10.1109/18.720537}, doi = {10.1109/18.720537}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerO98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HollmannKL97, author = {Henk D. L. Hollmann and J{\'{a}}nos K{\"{o}}rner and Simon Litsyn}, title = {Tiling Hamming Space with Few Spheres}, journal = {J. Comb. Theory, Ser. {A}}, volume = {80}, number = {2}, pages = {388--393}, year = {1997}, url = {https://doi.org/10.1006/jcta.1997.2816}, doi = {10.1006/JCTA.1997.2816}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/HollmannKL97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/FachiniK96, author = {Emanuela Fachini and J{\'{a}}nos K{\"{o}}rner}, title = {Tight Packings of Hamming Spheres}, journal = {J. Comb. Theory, Ser. {A}}, volume = {76}, number = {2}, pages = {292--294}, year = {1996}, url = {https://doi.org/10.1006/jcta.1996.0105}, doi = {10.1006/JCTA.1996.0105}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/FachiniK96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Korner95, author = {J{\'{a}}nos K{\"{o}}rner}, title = {Intersection number and capacities of graphs}, journal = {Discret. Math.}, volume = {142}, number = {1-3}, pages = {169--184}, year = {1995}, url = {https://doi.org/10.1016/0012-365X(95)00011-K}, doi = {10.1016/0012-365X(95)00011-K}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Korner95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/HolzmanK95, author = {Ron Holzman and J{\'{a}}nos K{\"{o}}rner}, title = {Cancellative pairs of families of sets}, journal = {Eur. J. Comb.}, volume = {16}, number = {3}, pages = {263--266}, year = {1995}, url = {https://doi.org/10.1016/0195-6698(95)90031-4}, doi = {10.1016/0195-6698(95)90031-4}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/HolzmanK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/GarganoKV95, author = {Luisa Gargano and J{\'{a}}nos K{\"{o}}rner and Ugo Vaccaro}, title = {On the capacity of boolean graph formul{\ae}}, journal = {Graphs Comb.}, volume = {11}, number = {1}, pages = {29--48}, year = {1995}, url = {https://doi.org/10.1007/BF01787419}, doi = {10.1007/BF01787419}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/GarganoKV95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/Korner95, author = {J{\'{a}}nos K{\"{o}}rner}, title = {On the Extremal Combinatorics of the Hamming Space}, journal = {J. Comb. Theory, Ser. {A}}, volume = {71}, number = {1}, pages = {112--126}, year = {1995}, timestamp = {Mon, 05 Jul 2004 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/Korner95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/GalluccioGKS94, author = {Anna Galluccio and Luisa Gargano and J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi}, title = {Different capacities of a digraph}, journal = {Graphs Comb.}, volume = {10}, number = {2-4}, pages = {105--121}, year = {1994}, url = {https://doi.org/10.1007/BF02986655}, doi = {10.1007/BF02986655}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/GalluccioGKS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/GarganoKV94, author = {Luisa Gargano and J{\'{a}}nos K{\"{o}}rner and Ugo Vaccaro}, title = {Capacities: From Information Theory to Extremal Set Theory}, journal = {J. Comb. Theory, Ser. {A}}, volume = {68}, number = {2}, pages = {296--316}, year = {1994}, timestamp = {Mon, 12 Jul 2004 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/GarganoKV94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerL94, author = {J{\'{a}}nos K{\"{o}}rner and Mario Lucertini}, title = {Compressing inconsistent data}, journal = {{IEEE} Trans. Inf. Theory}, volume = {40}, number = {3}, pages = {706--715}, year = {1994}, url = {https://doi.org/10.1109/18.335882}, doi = {10.1109/18.335882}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerL94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/GarganoKV93, author = {Luisa Gargano and J{\'{a}}nos K{\"{o}}rner and Ugo Vaccaro}, title = {Sperner capacities}, journal = {Graphs Comb.}, volume = {9}, number = {1}, pages = {31--46}, year = {1993}, url = {https://doi.org/10.1007/BF01195325}, doi = {10.1007/BF01195325}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/GarganoKV93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KornerST92, author = {J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi and Zsolt Tuza}, title = {Perfect couples of graphs}, journal = {Comb.}, volume = {12}, number = {2}, pages = {179--192}, year = {1992}, url = {https://doi.org/10.1007/BF01204721}, doi = {10.1007/BF01204721}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KornerST92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GarganoKV92, author = {Luisa Gargano and J{\'{a}}nos K{\"{o}}rner and Ugo Vaccaro}, title = {Search problems for two irregular coins with incomplete feedback: the underweight model}, journal = {Discret. Appl. Math.}, volume = {36}, number = {2}, pages = {191--197}, year = {1992}, url = {https://doi.org/10.1016/0166-218X(92)90232-Y}, doi = {10.1016/0166-218X(92)90232-Y}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/GarganoKV92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/KornerS92, author = {J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi}, title = {A Sperner-Type Theorem and Qualitative Independence}, journal = {J. Comb. Theory, Ser. {A}}, volume = {59}, number = {1}, pages = {90--103}, year = {1992}, timestamp = {Mon, 19 Jul 2004 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/KornerS92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/GarganoKV92, author = {Luisa Gargano and J{\'{a}}nos K{\"{o}}rner and Ugo Vaccaro}, title = {Qualitative Independence and Sperner Problems for Directed Graphs}, journal = {J. Comb. Theory, Ser. {A}}, volume = {61}, number = {2}, pages = {173--192}, year = {1992}, timestamp = {Mon, 19 Jul 2004 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jct/GarganoKV92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/CsiszarKLMS90, author = {Imre Csisz{\'{a}}r and J{\'{a}}nos K{\"{o}}rner and L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and Katalin Marton and G{\'{a}}bor Simonyi}, title = {Entropy splitting for antiblocking corners and perfect graphs}, journal = {Comb.}, volume = {10}, number = {1}, pages = {27--40}, year = {1990}, url = {https://doi.org/10.1007/BF02122693}, doi = {10.1007/BF02122693}, timestamp = {Fri, 25 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/combinatorica/CsiszarKLMS90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerM90, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {On the capacity of uniform hypergraphs}, journal = {{IEEE} Trans. Inf. Theory}, volume = {36}, number = {1}, pages = {153--156}, year = {1990}, url = {https://doi.org/10.1109/18.50381}, doi = {10.1109/18.50381}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerM90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/KornerM88, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {New Bounds for Perfect Hashing via Information Theory}, journal = {Eur. J. Comb.}, volume = {9}, number = {6}, pages = {523--530}, year = {1988}, url = {https://doi.org/10.1016/S0195-6698(88)80048-9}, doi = {10.1016/S0195-6698(88)80048-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/KornerM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerM88, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {Graphs that Split Entropies}, journal = {{SIAM} J. Discret. Math.}, volume = {1}, number = {1}, pages = {71--79}, year = {1988}, url = {https://doi.org/10.1137/0401008}, doi = {10.1137/0401008}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KornerS88, author = {J{\'{a}}nos K{\"{o}}rner and G{\'{a}}bor Simonyi}, title = {Separating Partition Systems and Locally Different Sequences}, journal = {{SIAM} J. Discret. Math.}, volume = {1}, number = {3}, pages = {355--359}, year = {1988}, url = {https://doi.org/10.1137/0401035}, doi = {10.1137/0401035}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KornerS88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerM88, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {Random access communication and graph entropy}, journal = {{IEEE} Trans. Inf. Theory}, volume = {34}, number = {2}, pages = {312--314}, year = {1988}, url = {https://doi.org/10.1109/18.2639}, doi = {10.1109/18.2639}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerM88.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KornerW86, author = {J{\'{a}}nos K{\"{o}}rner and Victor K. Wei}, title = {Addendum to "odd and even hamming spheres also have minimum boundary"}, journal = {Discret. Math.}, volume = {62}, number = {1}, pages = {105--106}, year = {1986}, url = {https://doi.org/10.1016/0012-365X(86)90047-6}, doi = {10.1016/0012-365X(86)90047-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KornerW86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/bstj/WolfWZK84, author = {Jack K. Wolf and Aaron D. Wyner and Jacob Ziv and J{\'{a}}nos K{\"{o}}rner}, title = {Coding for a write-once memory}, journal = {AT{\&}T Bell Lab. Tech. J.}, volume = {63}, number = {6}, pages = {1089--1112}, year = {1984}, url = {https://doi.org/10.1002/j.1538-7305.1984.tb00115.x}, doi = {10.1002/J.1538-7305.1984.TB00115.X}, timestamp = {Tue, 18 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/bstj/WolfWZK84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KornerW84, author = {J{\'{a}}nos K{\"{o}}rner and Victor K. Wei}, title = {Odd and even hamming spheres also have minimum boundary}, journal = {Discret. Math.}, volume = {51}, number = {2}, pages = {147--165}, year = {1984}, url = {https://doi.org/10.1016/0012-365X(84)90068-2}, doi = {10.1016/0012-365X(84)90068-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KornerW84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jct/HwangKW84, author = {Frank K. Hwang and J{\'{a}}nos K{\"{o}}rner and Victor K.{-}W. Wei}, title = {Selecting Non-consecutive Balls Arranged in Many Lines}, journal = {J. Comb. Theory, Ser. {A}}, volume = {37}, number = {3}, pages = {327--336}, year = {1984}, url = {https://doi.org/10.1016/0097-3165(84)90053-0}, doi = {10.1016/0097-3165(84)90053-0}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jct/HwangKW84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/Korner84, author = {J{\'{a}}nos K{\"{o}}rner}, title = {{OPEC} or a basic problem in source networks}, journal = {{IEEE} Trans. Inf. Theory}, volume = {30}, number = {1}, pages = {68--77}, year = {1984}, url = {https://doi.org/10.1109/TIT.1984.1056841}, doi = {10.1109/TIT.1984.1056841}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/Korner84.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/EricsonK83, author = {Thomas H. E. Ericson and J{\'{a}}nos K{\"{o}}rner}, title = {Successive encoding of correlated sources}, journal = {{IEEE} Trans. Inf. Theory}, volume = {29}, number = {3}, pages = {390--395}, year = {1983}, url = {https://doi.org/10.1109/TIT.1983.1056668}, doi = {10.1109/TIT.1983.1056668}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/EricsonK83.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CsiszarK82, author = {Imre Csisz{\'{a}}r and J{\'{a}}nos K{\"{o}}rner}, title = {Feedback does not affect the reliability function of a {DMC} at rates above capacity}, journal = {{IEEE} Trans. Inf. Theory}, volume = {28}, number = {1}, pages = {92--93}, year = {1982}, url = {https://doi.org/10.1109/TIT.1982.1056444}, doi = {10.1109/TIT.1982.1056444}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/CsiszarK82.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CsiszarK81, author = {Imre Csisz{\'{a}}r and J{\'{a}}nos K{\"{o}}rner}, title = {Graph decomposition: {A} new key to coding theorems}, journal = {{IEEE} Trans. Inf. Theory}, volume = {27}, number = {1}, pages = {5--11}, year = {1981}, url = {https://doi.org/10.1109/TIT.1981.1056281}, doi = {10.1109/TIT.1981.1056281}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/CsiszarK81.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CsiszarK80, author = {Imre Csisz{\'{a}}r and J{\'{a}}nos K{\"{o}}rner}, title = {Towards a general theory of source networks}, journal = {{IEEE} Trans. Inf. Theory}, volume = {26}, number = {2}, pages = {155--165}, year = {1980}, url = {https://doi.org/10.1109/TIT.1980.1056166}, doi = {10.1109/TIT.1980.1056166}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/CsiszarK80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerS80, author = {J{\'{a}}nos K{\"{o}}rner and Andrea Sgarro}, title = {Universally attainable error exponents for broadcast channels with degraded message sets}, journal = {{IEEE} Trans. Inf. Theory}, volume = {26}, number = {6}, pages = {670--679}, year = {1980}, url = {https://doi.org/10.1109/TIT.1980.1056275}, doi = {10.1109/TIT.1980.1056275}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerS80.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/DueckK79, author = {Gunter Dueck and J{\'{a}}nos K{\"{o}}rner}, title = {Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)}, journal = {{IEEE} Trans. Inf. Theory}, volume = {25}, number = {1}, pages = {82--85}, year = {1979}, url = {https://doi.org/10.1109/TIT.1979.1056003}, doi = {10.1109/TIT.1979.1056003}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/DueckK79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerM79, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {How to encode the modulo-two sum of binary sources (Corresp.)}, journal = {{IEEE} Trans. Inf. Theory}, volume = {25}, number = {2}, pages = {219--221}, year = {1979}, url = {https://doi.org/10.1109/TIT.1979.1056022}, doi = {10.1109/TIT.1979.1056022}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerM79.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/CsiszarK78, author = {Imre Csisz{\'{a}}r and J{\'{a}}nos K{\"{o}}rner}, title = {Broadcast channels with confidential messages}, journal = {{IEEE} Trans. Inf. Theory}, volume = {24}, number = {3}, pages = {339--348}, year = {1978}, url = {https://doi.org/10.1109/TIT.1978.1055892}, doi = {10.1109/TIT.1978.1055892}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/CsiszarK78.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerM77, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {General broadcast channels with degraded message sets}, journal = {{IEEE} Trans. Inf. Theory}, volume = {23}, number = {1}, pages = {60--64}, year = {1977}, url = {https://doi.org/10.1109/TIT.1977.1055655}, doi = {10.1109/TIT.1977.1055655}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerM77.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerM77a, author = {J{\'{a}}nos K{\"{o}}rner and Katalin Marton}, title = {Images of a set via two channels and their role in multi-user communication}, journal = {{IEEE} Trans. Inf. Theory}, volume = {23}, number = {6}, pages = {751--761}, year = {1977}, url = {https://doi.org/10.1109/TIT.1977.1055800}, doi = {10.1109/TIT.1977.1055800}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerM77a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/AhlswedeK75, author = {Rudolf Ahlswede and J{\'{a}}nos K{\"{o}}rner}, title = {Source coding with side information and a converse for degraded broadcast channels}, journal = {{IEEE} Trans. Inf. Theory}, volume = {21}, number = {6}, pages = {629--637}, year = {1975}, url = {https://doi.org/10.1109/TIT.1975.1055469}, doi = {10.1109/TIT.1975.1055469}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/AhlswedeK75.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KornerL73, author = {J{\'{a}}nos K{\"{o}}rner and Giuseppe Longo}, title = {Two-step encoding for finite sources}, journal = {{IEEE} Trans. Inf. Theory}, volume = {19}, number = {6}, pages = {778--782}, year = {1973}, url = {https://doi.org/10.1109/TIT.1973.1055109}, doi = {10.1109/TIT.1973.1055109}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KornerL73.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.