Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

V. N. Koshelev

dblp:134/8182 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1973
—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
Coding theory · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › channel coding
computational cutoff rate		 0.011973
Direct sequential encoding and decoding for discrete sources · IEEE Trans. Inf. Theory 1973
Coding theory
source coding		 0.011973
Direct sequential encoding and decoding for discrete sources · IEEE Trans. Inf. Theory 1973
YearPublicationVenuePosition
1973 Direct sequential encoding and decoding for discrete sources
abstract
The method of sequential encoding and decoding is generalized to the case of a source with redundancy. A computational entropy of the source analogous to the computational cutoff rate of the channel is introduced. A range of transmission rates is found for which the average number of decoding computations is finite.
V. N. Koshelev
 IEEE Trans. Inf. Theory1