Demo Data from EDBT 2026 / reviewers in the wild / expert
Alexey Fedotov
dblp:79/5984
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none
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 |
Algorithms and data structures · 46% Coding theory · 46% Computational complexity · 7% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › data structure design › search structures › search trees
binary search trees |
0.0 | 1 | 2001 | The estimated cost of a search tree on binary words · IEEE Trans. Inf. Theory 2001 |
Coding theory › source coding
optimal coding |
0.0 | 1 | 2001 | The estimated cost of a search tree on binary words · IEEE Trans. Inf. Theory 2001 |
Algorithms and data structures › data structure design › search structures
search trees |
0.0 | 1 | 2001 | The estimated cost of a search tree on binary words · IEEE Trans. Inf. Theory 2001 |
Coding theory
source coding |
0.0 | 1 | 2001 | The estimated cost of a search tree on binary words · IEEE Trans. Inf. Theory 2001 |
Methods — techniques the papers use, named apart from their topics
approximation algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | The estimated cost of a search tree on binary wordsabstractThe problem of constructing a binary search tree for a set of binary words has wide applications in computer science, biology, mineralogy, etc. Shannon considered a similar statement in his optimal coding theorem. It is NP-complete to construct a tree of minimum cost; therefore, the problem arises of finding simple algorithms for constructing nearly optimal trees. We show that there is a simple algorithm for constructing search trees sufficiently close to the optimal tree on average. By means of this algorithm we prove that for the optimal tree the average number of bits to be checked is near to its natural lower bound, i.e., the binary logarithm of the number of given words: their difference is less than 1.04. Alexey Fedotov, Boris Ryabko |
IEEE Trans. Inf. Theory | 1 |