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

K. Deimer

dblp:72/1941 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1984
—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 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › constrained coding
circuit codes		 0.011984
Some new bounds for the maximum length of circuit codes · IEEE Trans. Inf. Theory 1984

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

combinatorial construction · 0.0
YearPublicationVenuePosition
1984 Some new bounds for the maximum length of circuit codes
abstract
Ad-dimensional circuit code of spreadsis a simple circuitCin the graph of thed-dimensional unit cube with the property that for any verticesxandyofCthat differ in exactlyrcoordinatesr < s, there exists a path fromxtoyconsisting ofredges ofC. Some new lower bounds will be given for the maximum length of ad-dimensional circuit code of spreadsfor some values ofdand fors = 4, s = 6, ands = 7.
K. Deimer
 IEEE Trans. Inf. Theory1