János Körner - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 76 from 76

2023

Structured Codes of GraphsNoga Alon, Anna Gujgiczer, János Körner, Aleksa Milojevic, Gábor Simonyi. siamdm, 37(1):379-403, March 2023. [doi]

2021

Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein"Alexander Barg, Lara Dolecek, Ryan Gabrys, Gyula O. H. Katona, János Körner, Andrew McGregor 0001, Olgica Milenkovic, Sihem Mesnager, Gilles Zémor. TIT, 67(6):3187-3189, 2021. [doi]

2020

Divergent permutationsEmanuela Fachini, János Körner. jcta, 173:105231, 2020. [doi]

2019

Interlocked PermutationsGérard D. Cohen, Emanuela Fachini, János Körner. siamdm, 33(3):1662-1668, 2019. [doi]

On the size of pairwise-colliding permutationsJános Körner, Chandra Nair, David Ng. isit 2019: 2354-2358 [doi]

2018

Families of locally separated Hamilton pathsJános Körner, Angelo Monti. jgt, 88(3):402-410, 2018. [doi]

2017

Path Separation by Short CyclesGérard D. Cohen, Emanuela Fachini, János Körner. jgt, 85(1):107-114, 2017. [doi]

Hamilton Paths With Lasting SeparationEmanuela Fachini, János Körner. TIT, 63(10):6344-6346, 2017. [doi]

2016

Zero-Error Capacity of Binary Channels With MemoryGérard D. Cohen, Emanuela Fachini, János Körner. TIT, 62(1):3-7, 2016. [doi]

2014

Connector Families of GraphsGérard D. Cohen, Emanuela Fachini, János Körner. gc, 30(6):1417-1425, 2014. [doi]

2013

More on Connector FamiliesGérard D. Cohen, Emanuela Fachini, János Körner. endm, 44:23-29, 2013. [doi]

Degree-Doubling Graph FamiliesJános Körner, Irene Muzi. siamdm, 27(3):1575-1583, 2013. [doi]

2012

Families of Graph-different Hamilton PathsJános Körner, Silvia Messuti, Gábor Simonyi. siamdm, 26(1):321-329, 2012. [doi]

2011

Permutation Capacities and Oriented Infinite PathsGraham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth. endm, 38:195-199, 2011. [doi]

SkewincidenceGérard D. Cohen, Emanuela Fachini, János Körner. TIT, 57(11):7313-7316, 2011. [doi]

Information Theory - Coding Theorems for Discrete Memoryless Systems, Second EditionImre Csiszár, János Körner. Cambridge University Press, 2011. [doi]

Forbiddance and CapacityEmanuela Fachini, János Körner. gc, 27(4):495-503, 2011. [doi]

Families of Very Different PathsJános Körner, Silvia Messuti, Gábor Simonyi. endm, 38:529-533, 2011. [doi]

2010

Permutation Capacities of Families of Oriented Infinite PathsGraham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth. siamdm, 24(2):441-456, 2010. [doi]

2008

Graph-Different PermutationsJános Körner, Claudia Malvenuto, Gábor Simonyi. siamdm, 22(2):489-499, 2008. [doi]

2007

Cross-intersecting couples of graphsEmanuela Fachini, János Körner. jgt, 56(2):105-112, 2007. [doi]

On Cancellative Set FamiliesJános Körner, Blerina Sinaimeri. cpc, 16(5):767-773, 2007. [doi]

2006

Appendix: On Common Information and Related Characteristics of Correlated Information SourcesRudolf Ahlswede, János Körner. gtitc 2006: 664-677 [doi]

Pairwise colliding permutations and the capacity of infinite graphsJános Körner, Claudia Malvenuto. siamdm, 20(1):203-212, 2006. [doi]

2005

Local chromatic number and Sperner capacityJános Körner, Concetta Pilotto, Gábor Simonyi. JCT, 95(1):101-117, 2005. [doi]

2003

Codes for a long silenceEmanuela Fachini, János Körner. TIT, 49(8):2020-2023, 2003.

2002

Delta-Systems and Qualitative (In)DependenceJános Körner, Angelo Monti. JCT, 99(1):75-84, 2002. [doi]

2001

A Note On Counting Very Different SequencesEmanuela Fachini, János Körner. cpc, 10(6):501-504, 2001.

Self-Similarity Bounds for Locally Thin Set FamiliesEmanuela Fachini, János Körner, Angelo Monti. cpc, 10(4):309-315, 2001. [doi]

A Better Bound for Locally Thin Set FamiliesEmanuela Fachini, János Körner, Angelo Monti. JCT, 95(2):209-218, 2001. [doi]

Relative capacity and dimension of graphsJános Körner, Katalin Marton. DM, 235(1-3):307-315, 2001. [doi]

Delta-systems and qualitative (in)dependenceJános Körner, Angelo Monti. endm, 10:160-163, 2001. [doi]

Compact Representations of the Intersection Structure of Families of Finite SetsJános Körner, Angelo Monti. siamdm, 14(2):181-192, 2001. [doi]

2000

String Quartets In BinaryNoga Alon, János Körner, Angelo Monti. cpc, 9(5):381-390, 2000.

Locally Thin Set FamiliesNoga Alon, Emanuela Fachini, János Körner. cpc, 9(6):481-488, 2000.

Colour Number, Capacity, and Perfectness of Directed GraphsEmanuela Fachini, János Körner. gc, 16(4):389-398, 2000. [doi]

Graph Pairs and their Entropies: Modularity ProblemsJános Körner, Gábor Simonyi. combinatorica, 20(2):227-240, 2000. [doi]

1999

On the Odd Cycles of Normal GraphsCaterina De Simone, János Körner. DAM, 94(1-3):161-169, 1999. [doi]

1998

Zero-Error Information TheoryJános Körner, Alon Orlitsky. TIT, 44(6):2207-2229, 1998.

On Clique Growth in Products of Directed GraphsJános Körner. gc, 14(1):25-36, 1998. [doi]

1997

Tiling Hamming Space with Few SpheresHenk D. L. Hollmann, János Körner, Simon Litsyn. JCT, 80(2):388-393, 1997. [doi]

1996

Tight Packings of Hamming SpheresEmanuela Fachini, János Körner. JCT, 76(2):292-294, 1996. [doi]

1995

On the capacity of boolean graph formulæLuisa Gargano, János Körner, Ugo Vaccaro. gc, 11(1):29-48, 1995. [doi]

Cancellative pairs of families of setsRon Holzman, János Körner. ejc, 16(3):263-266, 1995. [doi]

On the Extremal Combinatorics of the Hamming SpaceJános Körner. JCT, 71(1):112-126, 1995.

1994

Different capacities of a digraphAnna Galluccio, Luisa Gargano, János Körner, Gábor Simonyi. gc, 10(2-4):105-121, 1994. [doi]

Capacities: From Information Theory to Extremal Set TheoryLuisa Gargano, János Körner, Ugo Vaccaro. JCT, 68(2):296-316, 1994.

Compressing inconsistent dataJános Körner, M. Lucertini. TIT, 40(3):706-715, 1994.

1993

Sperner capacitiesLuisa Gargano, János Körner, Ugo Vaccaro. gc, 9(1):31-46, 1993. [doi]

1992

Qualitative Independence and Sperner Problems for Directed GraphsLuisa Gargano, János Körner, Ugo Vaccaro. JCT, 61(2):173-192, 1992.

Search problems for two irregular coins with incomplete feedback: the underweight modelLuisa Gargano, János Körner, Ugo Vaccaro. DAM, 36(2):191-197, 1992. [doi]

A Sperner-Type Theorem and Qualitative IndependenceJános Körner, Gábor Simonyi. JCT, 59(1):90-103, 1992.

Perfect couples of graphsJános Körner, Gábor Simonyi, Zsolt Tuza. combinatorica, 12(2):179-192, 1992.

1990

Entropy splitting for antiblocking corners and perfect graphsImre Csiszár, János Körner, László Lovász, Katalin Marton, Gábor Simonyi. combinatorica, 10(1):27-40, 1990.

On the capacity of uniform hypergraphsJános Körner, Katalin Marton. TIT, 36(1):153, 1990.

1988

Random access communication and graph entropyJános Körner, Katalin Marton. TIT, 34(2):312, 1988.

Separating Partition System and Locally Different SequencesJános Körner, Gábor Simonyi. siamdm, 1(3):355-359, 1988.

Graphs that Split EntropiesJános Körner, Katalin Marton. siamdm, 1(1):71-79, 1988.

New Bounds for Perfect Hashing via Information TheoryJános Körner, Katalin Marton. ejc, 9(6):523-530, 1988. [doi]

1986

Addendum to odd and even hamming spheres also have minimum boundary János Körner, Victor K. Wei. DM, 62(1):105-106, 1986. [doi]

1984

Selecting Non-consecutive Balls Arranged in Many LinesFrank K. Hwang, János Körner, Victor K.-W. Wei. JCT, 37(3):327-336, 1984.

OPEC or a basic problem in source networksJános Körner. TIT, 30(1):68-77, 1984.

Odd and even hamming spheres also have minimum boundaryJános Körner, Victor K. Wei. DM, 51(2):147-165, 1984. [doi]

Coding for a write-once memoryJack K. Wolf, Aaron D. Wyner, Jacob Ziv, János Körner. bstj, 63(6):1089-1112, 1984. [doi]

1983

Successive encoding of correlated sourcesThomas H. E. Ericson, János Körner. TIT, 29(3):390-395, 1983.

1982

Feedback does not affect the reliability function of a DMC at rates above capacityImre Csiszár, János Körner. TIT, 28(1):92, 1982.

1981

Graph decomposition: A new key to coding theoremsImre Csiszár, János Körner. TIT, 27(1):5-11, 1981.

1980

Towards a general theory of source networksImre Csiszár, János Körner. TIT, 26(2):155-165, 1980. [doi]

Universally attainable error exponents for broadcast channels with degraded message setsJános Körner, Andrea Sgarro. TIT, 26(6):670-679, 1980. [doi]

1979

Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)Gunter Dueck, János Körner. TIT, 25(1):82-85, 1979. [doi]

How to encode the modulo-two sum of binary sources (Corresp.)János Körner, Katalin Marton. TIT, 25(2):219-221, 1979. [doi]

1978

Broadcast channels with confidential messagesImre Csiszár, János Körner. TIT, 24(3):339-348, 1978. [doi]

1977

General broadcast channels with degraded message setsJános Körner, Katalin Marton. TIT, 23(1):60-64, 1977. [doi]

Images of a set via two channels and their role in multi-user communicationJános Körner, Katalin Marton. TIT, 23(6):751-761, 1977. [doi]

1975

Source coding with side information and a converse for degraded broadcast channelsRudolf Ahlswede, János Körner. TIT, 21(6):629-637, 1975. [doi]

1973

Two-step encoding for finite sourcesJános Körner, Giuseppe Longo. TIT, 19(6):778-782, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL