János Körner

Q: What Schools Are Affiliated With János Körner

János Körner is affiliated with the following schools: Eötvös Loránd University, Sapienza University of Rome

János Körner's AcademicInfluence.com Rankings

János Körner

Mathematics

#2609

World Rank

#3998

Historical Rank

Graph Theory

#65

World Rank

#72

Historical Rank

Combinatorics

#69

World Rank

#76

Historical Rank

Measure Theory

#1813

World Rank

#2218

Historical Rank

mathematics Degrees

Download Badge

Mathematics

János Körner's Degrees

PhD Mathematics Eötvös Loránd University

Why Is János Körner Influential?

(Suggest an Edit or Addition)

According to Wikipedia, János Körner is a Hungarian mathematician who works on information theory and combinatorics. Körner studied Mathematics at the Eötvös Loránd University in Budapest with a degree in 1970 and was then at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences until 1992. From 1981 to 1983 he was at the Bell Laboratories and in 1987–88 at Télécom Paris in Paris. He has been a professor at the Sapienza University of Rome since 1993.

(See a Problem?)

János Körner's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Broadcast channels with confidential messages (1978) (3222)
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition (2011) (2489)
Source coding with side information and a converse for degraded broadcast channels (1975) (439)
How to encode the modulo-two sum of binary sources (Corresp.) (1979) (339)
General broadcast channels with degraded message sets (1977) (294)
Zero-Error Information Theory (1998) (221)
Graph decomposition: A new key to coding theorems (1981) (180)
Bounds on conditional probabilities with applications in multi-user communication (1976) (164)
Towards a general theory of source networks (1980) (147)
Entropy splitting for antiblocking corners and perfect graphs (1990) (109)
New Bounds for Perfect Hashing via Information Theory (1988) (101)
Reliability function of a discrete memoryless channel at rates above capacity (Corresp.) (1979) (97)
Sperner capacities (1993) (90)
Fredman-Kolmo´s bounds and information theory (1986) (88)
Capacities: From Information Theory to Extremal Set Theory (1994) (86)
Coding for a write-once memory (1984) (82)
Images of a set via two channels and their role in multi-user communication (1977) (75)
Universally attainable error exponents for broadcast channels with degraded message sets (1980) (59)
Qualitative Independence and Sperner Problems for Directed Graphs (1992) (56)
On the capacity of the arbitrarily varying channel for maximum probability of error (1981) (56)
On the Extremal Combinatorics of the Hamming Space (1994) (53)
Appendix: On Common Information and Related Characteristics of Correlated Information Sources (2006) (51)
Separating Partition Systems and Locally Different Sequences (1988) (50)
Graph Pairs and their Entropies: Modularity Problems (2000) (45)
Local chromatic number and Sperner capacity (2005) (44)
A Sperner-Type Theorem and Qualitative Independence (1992) (42)
Two-step encoding for finite sources (1973) (42)
Graphs that Split Entropies (1988) (42)
Perfect couples of graphs (1992) (42)
Information Theory: Name index (2011) (40)
Zero-error capacities and very different sequences (1990) (40)
Compressing inconsistent data (1994) (37)
On the connection between the entropies of input and output distributions of discrete memoryless channels (1977) (33)
Pairwise colliding permutations and the capacity of infinite graphs (2006) (30)
Information Theory: Basic notation and conventions (2011) (28)
On the Odd Cycles of Normal Graphs (1999) (23)
Permutation Capacities of Families of Oriented Infinite Paths (2010) (20)
Graph-Different Permutations (2007) (20)
Locally Thin Set Families (2000) (20)
Odd and even hamming spheres also have minimum boundary (1984) (19)
Feedback does not affect the reliability function of a DMC at rates above capacity (1982) (19)
Random access communication and graph entropy (1988) (17)
Families of Graph-different Hamilton Paths (2011) (17)
Successive encoding of correlated sources (1983) (15)
Cancellative pairs of families of sets (1995) (14)
On types of growth for graph-different permutations (2007) (14)
On the capacity of uniform hypergraphs (1990) (13)
String Quartets in Binary (2000) (11)
Selecting Non-consecutive Balls Arranged in Many Lines (1984) (11)
Intersection number and capacities of graphs (1995) (9)
Search problems for two irregular coins with incomplete feedback: the underweight model (1992) (9)
Zero-Error Capacity of Binary Channels With Memory (2014) (7)
Path Separation by Short Cycles (2015) (7)
Degree-Doubling Graph Families (2012) (7)
On Clique Growth in Products of Directed Graphs (1998) (7)
Some Methods in Multi-User Communication: A Tutorial Survey (1975) (7)
On Cancellative Set Families (2007) (6)
Families of locally separated Hamilton paths (2014) (6)
Colour Number, Capacity, and Perfectness of Directed Graphs (2000) (6)
A Better Bound for Locally Thin Set Families (2001) (6)
Different capacities of a digraph (1994) (6)
A Note on Counting Very Different Sequences (2001) (5)
Addendum to "odd and even hamming spheres also have minimum boundary" (1986) (5)
Connector Families of Graphs (2014) (5)
Compact Representations of the Intersection Structure of Families of Finite Sets (2001) (4)
The Concept of Single-Letterization in Information Theory (1987) (4)
Delta-systems and qualitative (in)dependence (2001) (4)
Relative capacity and dimension of graphs (2001) (4)
Tight Packings of Hamming Spheres (1996) (3)
A new approach to rate-distortion theory (1986) (3)
Tiling Hamming Space with Few Spheres (1997) (3)
Skewincidence (2010) (3)
Information Theory: Introduction (2011) (3)
Cross‐intersecting couples of graphs (2007) (3)
Correction to bounds on conditional probabilities with applications (1977) (3)
On the capacity of boolean graph formulæ (1995) (2)
Information Theory: A packing lemma and the error exponent in channel coding (2011) (2)
Forbiddance and Capacity (2011) (2)
Self-Similarity Bounds for Locally Thin Set Families (2001) (2)
OPEC or a basic problem in source networks (1984) (1)
Information Theory: Information-theoretic security (2011) (1)
On the size of pairwise-colliding permutations (2019) (1)
On the permutation capacity of digraphs (2008) (1)
Codes for a long silence (2003) (1)
Information Theory: Rate-distortion trade-off in source coding and the source–channel transmission problem (2011) (0)
PERMUTATION CAPACITIES OF FAMILIES OF ORIENTED (2010) (0)
Interlocked Permutations (2018) (0)
Information theory in disguise (2017) (0)
Information Theory: Source coding and hypothesis testing; information measures (2011) (0)
When is graph entropy additive? Or: Perfect couples of graphs (1990) (0)
Zero-error information theory (invited paper) (2000) (0)
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein" (2021) (0)
Hamilton Paths With Lasting Separation (2017) (0)
Divergent permutations (2019) (0)
Information Theory: Non-block source coding (2011) (0)
BASIC NOTATIONS AND CONVENTIONS (1981) (0)
Information Theory: Multi-terminal systems (2011) (0)
Entropy splitting for antiblocking pairs and perfect graphs by (2007) (0)
Information Theory: Computation of channel capacity and Δ-distortion rates (2011) (0)
On the Shannon Capacity of Graph Formulae (1993) (0)
Information Theory: References (2011) (0)
Separate coding of correlated sources (2011) (0)
Information Measures in Simple Coding Problems (1981) (0)
Information Theory: Types and typical sequences (2011) (0)
Information Theory: Blowing up lemma: a combinatorial digression (2011) (0)
Information Theory: Source and channel networks (2011) (0)
Families of Very Different Paths (2011) (0)
Information Theory: Entropy and image size characterization (2011) (0)
Information Theory: Formal properties of Shannon's information measures (2011) (0)
Connector Families of Graphs (2013) (0)
More on Connector Families (2013) (0)
The Information Theory of Perfect Hashing (1987) (0)
About a Combinatorial Proof of the Noisy Channel Coding Theorem (1981) (0)
Information Theory: The noisy channel coding problem (2011) (0)
Information Theory: The compound channel revisited: zero-error information theory and extremal combinatorics (2011) (0)
Information Theory: A covering lemma and the error exponent in source coding (2011) (0)
Cross-intersecting couples of graphs (2007) (0)
Multi-Terminal Systems (1981) (0)
Arbitrarily varying channels (2011) (0)
Codes with structured Hamming distance in graph families (2022) (0)
Perfect graphs split entropies (1988) (0)
Two-Terminal Systems (1981) (0)
Permutation Capacities and Oriented Infinite Paths (2011) (0)

This paper list is powered by the following services:

Other Resources About János Körner

en.wikipedia.org

What Schools Are Affiliated With János Körner?

János Körner is affiliated with the following schools:

János Körner's Academic­Influence.com Rankings

János Körner's Degrees

Why Is János Körner Influential?

János Körner's Published Works

Published Works

Other Resources About János Körner

What Schools Are Affiliated With János Körner?

János Körner's AcademicInfluence.com Rankings