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 EDBT 2026 / reviewers in the wild / expert

C. Cullum

dblp:134/8713 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1972
—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 · 67% Algorithms and data structures · 33%

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

TopicWeightPapersLastEvidence papers
Algorithms and data structures › search algorithms
bidirectional search		 0.011972
An efficient algorithm for computing free distance (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes
convolutional codes		 0.011972
An efficient algorithm for computing free distance (Corresp.) · IEEE Trans. Inf. Theory 1972
Coding theory › error-correcting codes › convolutional codes › free distance
free distance computation		 0.011972
An efficient algorithm for computing free distance (Corresp.) · IEEE Trans. Inf. Theory 1972

Methods — techniques the papers use, named apart from their topics

bidirectional search algorithm · 0.0
YearPublicationVenuePosition
1972 An efficient algorithm for computing free distance (Corresp.)
abstract
An efficient bidirectional search algorithm for computing the free distance of convolutional codes is described.
Lalit R. Bahl, C. Cullum, W. Donald Frazer, Frederick Jelinek
 IEEE Trans. Inf. Theory2