EDBT 2026 Demo / reviewers in the wild / expert
Roland Heim
dblp:134/5200
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1979
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author
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 |
Computational complexity · 40% Coding theory · 40% Information theory · 20% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
algorithmic information theory |
0.0 | 1 | 1979 | On the algorithmic foundation of information theory · IEEE Trans. Inf. Theory 1979 |
Computational complexity › algorithmic randomness
martingales |
0.0 | 1 | 1979 | On the algorithmic foundation of information theory · IEEE Trans. Inf. Theory 1979 |
Computational complexity › complexity measures
program complexity |
0.0 | 1 | 1979 | On the algorithmic foundation of information theory · IEEE Trans. Inf. Theory 1979 |
Coding theory
source coding |
0.0 | 1 | 1979 | On the algorithmic foundation of information theory · IEEE Trans. Inf. Theory 1979 |
Coding theory › source coding › lossless compression
source coding theorem |
0.0 | 1 | 1979 | On the algorithmic foundation of information theory · IEEE Trans. Inf. Theory 1979 |
Methods — techniques the papers use, named apart from their topics
martingale theory · 0.0kolmogorov complexity · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1979 | On the algorithmic foundation of information theoryabstractThe information content of binary sequences is defined by minimal program complexity measures and is related to computable martingales. The equivalence of the complexity approach and the martingale approach after restriction to effective random tests is used to establish generalized source coding theorems and converses. Finite state complexity and decomposable martingales are related to classical block codes and the relative frequency behavior of sequences. Roland Heim |
IEEE Trans. Inf. Theory | 1 |