Catalogo dei prodotti della ricerca

KORNER, JANOS
 Distribuzione geografica
Salva come PNG Salva come JPEG
Continente #
NA - Nord America 4.357
EU - Europa 1.170
AS - Asia 561
SA - Sud America 56
OC - Oceania 22
AF - Africa 7
Totale 6.173
Salva come PNG Salva come JPEG
Nazione #
US - Stati Uniti d'America 4.327
UA - Ucraina 395
IN - India 201
IT - Italia 175
SG - Singapore 152
SE - Svezia 127
GB - Regno Unito 96
FI - Finlandia 93
CN - Cina 64
FR - Francia 55
HK - Hong Kong 52
DE - Germania 50
AR - Argentina 41
BG - Bulgaria 35
NL - Olanda 32
CA - Canada 30
IL - Israele 28
CH - Svizzera 27
AU - Australia 20
KR - Corea 18
IE - Irlanda 17
JP - Giappone 16
BE - Belgio 15
BR - Brasile 13
HU - Ungheria 12
IR - Iran 11
RU - Federazione Russa 7
GR - Grecia 6
PK - Pakistan 6
PT - Portogallo 6
DK - Danimarca 4
EE - Estonia 4
ES - Italia 4
RO - Romania 4
TW - Taiwan 4
ZA - Sudafrica 4
AT - Austria 3
CY - Cipro 3
CL - Cile 2
NZ - Nuova Zelanda 2
RW - Ruanda 2
TH - Thailandia 2
TR - Turchia 2
EG - Egitto 1
HR - Croazia 1
ID - Indonesia 1
NO - Norvegia 1
PH - Filippine 1
PL - Polonia 1
Totale 6.173
Salva come PNG Salva come JPEG
Città #
Fairfield 611
Woodbridge 528
Houston 392
Ann Arbor 331
Seattle 289
Ashburn 270
Chandler 270
Cambridge 220
Wilmington 195
Jacksonville 134
Plano 98
Princeton 98
Singapore 84
Boston 82
Rome 57
Federal 41
Lawrence 37
San Diego 37
Boardman 35
Sofia 35
Andover 27
Des Moines 26
Los Angeles 26
Brescia 24
Norwalk 24
Beijing 23
Millbury 23
San Paolo di Civitate 23
Toronto 22
Dublin 14
Brussels 13
Enschede 12
Ames 11
Franklin Park 11
Kolkata 10
Paris 10
London 9
Redwood City 9
Rio de Janeiro 9
Auburn Hills 8
Central 8
Dearborn 8
Dresden 8
Le Rouret 8
Tokyo 8
Central District 7
Kowloon City 7
Munich 7
Suwon 7
Sydney 7
Budapest 6
Bühl 6
New York 6
Queens 6
Shanghai 6
Antibes 5
Ballarat 5
Cazzago San Martino 5
Denver 5
Haarlem 5
Hyderabad 5
Mannheim 5
Milan 5
Naples 5
Pittsburgh 5
Zurich 5
Athens 4
Bern 4
Buffalo 4
Chicago 4
Delft 4
Muizenberg 4
Oxford 4
Pohang 4
Seoul 4
Tallinn 4
Venezia 4
Albuquerque 3
Amsterdam 3
Berkeley 3
Berlin 3
Bielefeld 3
Bologna 3
College Park 3
Epalinges 3
Falls Church 3
Geneva 3
Gönyű 3
Hefei 3
Indiana 3
Innsbruck 3
Jerusalem 3
Kirkland 3
Lexington 3
Melbourne 3
Mumbai 3
Nanjing 3
New Delhi 3
Nicosia 3
Padova 3
Totale 4.451
Salva come PNG Salva come JPEG
Nome #
Coding of an information source having ambiguous alphabet and the entropy of graphs. 599
Common information is far less than mutual information. 124
ON THE EXTREMAL COMBINATORICS OF THE HAMMING SPACE 97
Successive encoding of correlated sources 95
A SPERNER-TYPE THEOREM AND QUALITATIVE INDEPENDENCE 90
Search problems for two irregular coins with incomplete feedback: the underweight model 89
ENTROPY SPLITTING FOR ANTIBLOCKING CORNERS AND PERFECT GRAPHS 88
Broadcast channels with confidential messages 87
Images of a set via two channels and their role in multi-user communication 85
Separating partition systems and locally different sequences 84
General broadcast channels with degraded message sets 82
On clique growth in products of directed graphs 82
Relative capacity and dimension of graphs 82
Comparison of two noisy channels 82
Graph decomposition: a new key to coding theorems 81
Qualitative independence and Sperner problems for directed graphs 81
Addendum to "Odd and even Hamming spheres also have minimum boundary" 80
Towards a general theory of source networks 80
Graph pairs and their entropies: modularity problems 80
About a combinatorial proof of the noisy channel coding theorem 80
Capacities: from information theory to extremal set theory 79
A Better Bound for Locally Thin Set Families 79
Zero-error capacity of binary channels with memory 78
Coding for a long silence 76
Bounds on conditional probabilities with applications in multi-user communication 76
Graphs that split entropies 74
Tiling Hamming space with few spheres 73
New bounds for perfect hashing via information theory 73
OPEC or a basic problem in source networks 72
Fredman-Komlos bounds and information theory 70
Graph-different permutations 70
DELTA-SYSTEMS AND QUALITATIVE (IN)DEPENDENCE 70
More on connector families 68
Trifference 67
Compact representations of the intersection structure of families of finite sets 66
ON THE CAPACITY OF UNIFORM HYPERGRAPHS 66
Coding for a write-once memory 65
Source coding with side information and a converse for degraded broadcast channels 65
Universally attainable error exponents for broadcast channels with degraded message sets 65
Hamilton paths with lasting separation 64
Permutation capacities of families of oriented infinite paths 62
Forbiddance and Capacity 62
Colour number, capacity and perfectness of directed graphs. 62
A note on counting very different sequences 62
Random access communication and graph entropy 62
A new approach to rate-distortion theory 61
On types of growth for graph-different permutations 61
Locally thin set families. 61
Pairwise colliding permutations and the capacity of infinite graphs 61
Zero-error capacities and very different sequences 60
FAMILIES OF GRAPH-DIFFERENT HAMILTON PATHS 59
On cancellative set families 58
Degree-doubling graph families 58
On the capacity of Boolean graph formulae 58
COMPRESSING INCONSISTENT DATA 57
Zero--error information theory 57
INTERSECTION NUMBER AND CAPACITIES OF GRAPHS 56
Interlocked permutations 56
Families of locally separated Hamilton paths 55
Connector Families of Graphs 54
Odd and even Hamming spheres also have minimum boundary 54
Self-similarity bounds for locally thin set families 53
Two-step encoding of finite sources 53
Selecting non-consecutive balls arranged in many lines 53
Path separation by short cycles 53
IEEE Transactions on Information Theory 52
Local chromatic number and Sperner capacity 51
An extension of the class of perfect graphs 50
SPERNER CAPACITIES 49
Many coding theorems follow from an elementary combinatorial lemma 49
Connector Families of Graphs 49
Different capacities of digraphs 48
Tight packings of Hamming spheres 48
Cancellative Pairs of Families 48
A property of conditional entropy. 47
Information Theory: Coding Theorems for Discrete Memoryless Systems 46
Some methods in multi-user communication 41
PERFECT COUPLES OF GRAPHS 41
On common information and related characteristics of correlated information sources, 37
Cross-intersecting couples of graphs 37
Feedback does not effect the reliability function of a DMC at rates above capacity 37
On the capacity of the arbitrarily varying channel for maximum probability of error 35
Source networks with unauthorized users 35
Skewincidence 34
String quartets in binary 32
On the connection between the entropies of input and output distributions of discrete memoryless channels 30
Reliability function of a DMC at rates above capacity 30
Source networks and new information measures 27
Information Theory: Coding theorems for discrete memoryless systems, Second Edition 27
On the odd cycles of normal graphs 27
How to encode the modulo 2 sum of binary sources 25
Associate Editor Transactions on Information Theory 23
More on Connector Families 17
Shannon Award 2014 15
membro esterno dell'Accademia Ungherese delle Scienze 15
Totale 6.214
Salva come PNG Salva come JPEG
Categoria #
all - tutte 14.091
article - articoli 0
book - libri 0
conference - conferenze 0
curatela - curatele 0
other - altro 0
patent - brevetti 0
selected - selezionate 0
volume - volumi 0
Totale 14.091
Salva come PNG Salva come JPEG


Totale Lug Ago Sett Ott Nov Dic Gen Feb Mar Apr Mag Giu
2019/20201.092 0 44 18 85 138 148 143 184 133 114 54 31
2020/2021566 79 80 36 42 41 47 4 31 42 93 39 32
2021/2022937 11 50 94 23 132 24 23 111 101 78 102 188
2022/2023941 182 102 67 99 157 112 17 56 94 12 35 8
2023/2024524 27 86 23 26 29 54 17 33 3 100 48 78
2024/2025114 110 4 0 0 0 0 0 0 0 0 0 0
Totale 6.214