Demo Data from VLDB 2026 / reviewers in the wild / expert
Raymond A. Kristiansen
dblp:92/458
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2004
—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 · 93% Combinatorics and discrete mathematics · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences
binary sequences |
0.0 | 1 | 2004 | Binary sequences with merit factor ge6.3 · IEEE Trans. Inf. Theory 2004 |
Coding theory › sequences › pseudorandom sequences
legendre sequences |
0.0 | 1 | 2004 | Binary sequences with merit factor ge6.3 · IEEE Trans. Inf. Theory 2004 |
Coding theory › sequences › binary sequences
merit factor |
0.0 | 1 | 2004 | Binary sequences with merit factor ge6.3 · IEEE Trans. Inf. Theory 2004 |
Coding theory › sequences
sequence design |
0.0 | 1 | 2004 | Binary sequences with merit factor ge6.3 · IEEE Trans. Inf. Theory 2004 |
Combinatorics and discrete mathematics
number theory |
0.0 | 1 | 2004 | Binary sequences with merit factor ge6.3 · IEEE Trans. Inf. Theory 2004 |
Methods — techniques the papers use, named apart from their topics
deterministic search · 0.0asymptotic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Binary sequences with merit factor ge6.3abstractA method is described for the construction of binary sequences of very long length and with asymptotic merit factor>6.3. The result is backed up by strong experimental evidence although no formal proof for the asymptote is known. The sequences were found by Kristiansen using a small deterministic search, which we describe. Borwein, Choi, and Jedwab have independently identified a merit factor asymptote of 6.3421.... After we became aware of their work we realized that the sequences we construct are more simply described as periodic extensions of periodically rotated Legendre sequences. Raymond A. Kristiansen, Matthew Geoffrey Parker |
IEEE Trans. Inf. Theory | 1 |