Demo Data from EDBT 2026 / reviewers in the wild / expert
Milorad M. Obradovic
dblp:19/858
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › variable-length codes › prefix codes
huffman coding |
0.0 | 1 | 1987 | A lower bound on the redundancy of D-ary Huffman codes · IEEE Trans. Inf. Theory 1987 |
Coding theory › source coding › universal coding
redundancy lower bound |
0.0 | 1 | 1987 | A lower bound on the redundancy of D-ary Huffman codes · IEEE Trans. Inf. Theory 1987 |
Coding theory
source coding |
0.0 | 1 | 1987 | A lower bound on the redundancy of D-ary Huffman codes · IEEE Trans. Inf. Theory 1987 |
Methods — techniques the papers use, named apart from their topics
necessary and sufficient condition derivation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | Correction to 'A lower bound on the redundancy of D-ary Huffman codes' (Nov 87 910-911)
Jovan Dj. Golic, Milorad M. Obradovic |
IEEE Trans. Inf. Theory | 2 |
| 1987 | A lower bound on the redundancy of D-ary Huffman codesabstractA necessary and sufficient condition for the most likely letter of any discrete source to be coded by a single symbol with aD-ary Huffman code,2 \leq D < \infty, is derived. As a consequence, a lower bound on the redundancy of aD-ary Huffman code is established. Jovan Dj. Golic, Milorad M. Obradovic |
IEEE Trans. Inf. Theory | 2 |