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

Doris Altenkamp

dblp:72/4073 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1980
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers
Coding theory · 97% Mathematical optimization · 3%

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

TopicWeightPapersLastEvidence papers
Coding theory
source coding		 0.021980
Codes: Unequal Probabilities, Unequal Letter Cost · J. ACM 1980
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract) · ICALP 1978
Coding theory › source coding › variable-length codes › prefix codes
unequal letter costs		 0.021980
Codes: Unequal Probabilities, Unequal Letter Cost · J. ACM 1980
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract) · ICALP 1978
Coding theory › source coding › variable-length codes › prefix codes
alphabetic codes		 0.011980
Codes: Unequal Probabilities, Unequal Letter Cost · J. ACM 1980
Coding theory › source coding › variable-length codes
prefix codes		 0.011980
Codes: Unequal Probabilities, Unequal Letter Cost · J. ACM 1980
Coding theory › source coding › lossless compression
source coding theorem		 0.011980
Codes: Unequal Probabilities, Unequal Letter Cost · J. ACM 1980
Mathematical optimization
optimization		 0.011978
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract) · ICALP 1978

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

dynamic programming · 0.0
YearPublicationVenuePosition
1980 Codes: Unequal Probabilities, Unequal Letter Cost
abstract
The construction of alphabetic prefix codes with unequal letter costs and unequal probabilities is considered.A variant of the noiseless coding theorem is proved giving closely matching lower and upper bounds for the cost of the optimal code.An algorithm is described which constructs a nearly optimal code in linear time. KEY WORDS AND PHRASES;
Doris Altenkamp, Kurt Mehlhorn
 J. ACM1
1978 Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract)
Doris Altenkamp, Kurt Mehlhorn
 ICALP1