Demo Data from EDBT 2026 / reviewers in the wild / expert
Duncan B. Harris
dblp:88/1220
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory 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 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences
binary sequences |
0.0 | 1 | 1990 | A new search for skewsymmetric binary sequences with optimal merit factors · IEEE Trans. Inf. Theory 1990 |
Coding theory › sequences › binary sequences
merit factor |
0.0 | 1 | 1990 | A new search for skewsymmetric binary sequences with optimal merit factors · IEEE Trans. Inf. Theory 1990 |
Methods — techniques the papers use, named apart from their topics
sieve-based search · 0.0exhaustive search · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | A new search for skewsymmetric binary sequences with optimal merit factorsabstractPrevious results on skewsymmetric sequences with low autocorrelation obtained by making exhaustive searches for sequences with optimal merit factor are extended up to length 69. A sieve that required both the symmetric and antisymmetric components of a skewsymmetric sequence to have high merit factor to make limited searches up to length 117 was used, and many sequences with merit factor greater than 9 were found.> Marcel J. E. Golay, Duncan B. Harris |
IEEE Trans. Inf. Theory | 2 |