VLDB 2026 Research / reviewers in the wild / expert
Wolfgang Haas
dblp:20/2701
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2007
—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 · 44% Computational complexity · 44% Combinatorics and discrete mathematics · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
covering codes |
0.1 | 1 | 2007 | Lower Bounds for Binary Codes of Covering Radius One · IEEE Trans. Inf. Theory 2007 |
Computational complexity
lower bounds |
0.1 | 1 | 2007 | Lower Bounds for Binary Codes of Covering Radius One · IEEE Trans. Inf. Theory 2007 |
Combinatorics and discrete mathematics
extremal combinatorics |
0.0 | 1 | 2007 | Lower Bounds for Binary Codes of Covering Radius One · IEEE Trans. Inf. Theory 2007 |
Methods — techniques the papers use, named apart from their topics
combinatorial proof · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Lower Bounds for Binary Codes of Covering Radius OneabstractLet K(n, l) denote the minimal cardinality of a binary code of length n and covering radius one. Blass and Litsyn proved a lower bound K(n, l) for in the case n equiv 5 (mod6). We give a simplification of the proof, which yields a slightly better result. Wolfgang Haas |
IEEE Trans. Inf. Theory | 1 |