Demo Data from EDBT 2026 / reviewers in the wild / expert
P. Schuurman
dblp:86/3739
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1996
—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 · 56% Automata and formal languages · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › block codes
linear code |
0.0 | 1 | 1996 | A table of state complexity bounds for binary linear codes · IEEE Trans. Inf. Theory 1996 |
Automata and formal languages › descriptional complexity › state complexity
state complexity bounds |
0.0 | 1 | 1996 | A table of state complexity bounds for binary linear codes · IEEE Trans. Inf. Theory 1996 |
Coding theory › error-correcting codes › block codes › linear code
binary linear codes |
0.0 | 1 | 1996 | A table of state complexity bounds for binary linear codes · IEEE Trans. Inf. Theory 1996 |
Methods — techniques the papers use, named apart from their topics
state complexity analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | A table of state complexity bounds for binary linear codesabstractThis article contains a table of bounds on the state complexity of binary linear codes with length smaller than 25. General results on the state complexity of binary linear codes with low dimension or low minimum distance are included. P. Schuurman |
IEEE Trans. Inf. Theory | 1 |