Demo Data from EDBT 2026 / reviewers in the wild / expert
Istvan Pali
dblp:54/736
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1994
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Coding theory · 50% Information theory · 25% Mathematical optimization · 25% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › statistical estimation › point estimation
consistent estimation |
0.0 | 1 | 1994 | There is no universal source code for an infinite source alphabet · IEEE Trans. Inf. Theory 1994 |
Information theory › estimation theory
entropy estimation |
0.0 | 1 | 1994 | There is no universal source code for an infinite source alphabet · IEEE Trans. Inf. Theory 1994 |
Coding theory
source coding |
0.0 | 1 | 1994 | There is no universal source code for an infinite source alphabet · IEEE Trans. Inf. Theory 1994 |
Coding theory › source coding
universal coding |
0.0 | 1 | 1994 | There is no universal source code for an infinite source alphabet · IEEE Trans. Inf. Theory 1994 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | There is no universal source code for an infinite source alphabetabstractShows that a discrete infinite distribution with finite entropy cannot be estimated consistently in information divergence. As a corollary the authors show that there is no universal source code for an infinite source alphabet over the class of all discrete memoryless sources with finite entropy.> László Györfi, Istvan Pali, Edward C. van der Meulen |
IEEE Trans. Inf. Theory | 2 |