Demo Data from VLDB 2026 / reviewers in the wild / expert
Esa Antero Seuranen
dblp:75/4148
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-authorTheory 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 · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
covering codes |
0.1 | 1 | 2006 | Unidirectional covering codes · IEEE Trans. Inf. Theory 2006 |
Methods — techniques the papers use, named apart from their topics
tabu search · 0.1integer programming · 0.1exhaustive search · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | New lower bounds for multiple coverings
Esa Antero Seuranen |
Des. Codes Cryptogr. | 1 |
| 2006 | Unidirectional covering codesabstractA code C/spl sube/Z/sup n//sub 2/, where Z/sub 2/={0,1}, has unidirectional covering radius R if R is the smallest integer so that any word in Z/sup n//sub 2/ can be obtained from at least one codeword c/spl isin/C by replacing either 1s by 0s in at most R coordinates or 0s by 1s in at most R coordinates. The minimum cardinality of such a code is denoted by E(n,R). Upper bounds on this function are here obtained by constructing codes using tabu search; lower bounds, on the other hand, are mainly obtained by integer programming and exhaustive search. Best known bounds on E(n,R) for n/spl les/13 and R/spl les/6 are tabulated. Patric R. J. Östergård, Esa Antero Seuranen |
IEEE Trans. Inf. Theory | 2 |