Demo Data from VLDB 2026 / reviewers in the wild / expert
Heinz H. Schreiber
dblp:134/4285
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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.
| Computer networks
1 paper |
Physical-layer communications · 100% | |
| Theoretical computer science
1 paper |
Information theory · 67% Coding theory · 33% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
spread spectrum |
0.0 | 1 | 1985 | Spread-spectrum communications · Proc. IEEE 1985 |
Information theory › signal processing › spectral estimation
power spectral density |
0.0 | 1 | 1970 | Bandwidth requirements for Walsh functions (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Coding theory › boolean functions
walsh functions |
0.0 | 1 | 1970 | Bandwidth requirements for Walsh functions (Corresp.) · IEEE Trans. Inf. Theory 1970 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Spread-spectrum communications
Heinz H. Schreiber |
Proc. IEEE | 1 |
| 1970 | Bandwidth requirements for Walsh functions (Corresp.)abstractThe power-density spectrum for the Walsh function of binary orderkis calculated. The model analyzed considers the Walsh function as a random sequence modulating akth-order Rademacher function. The total number of Walsh functions of binary orderkand less is found to be about\frac{1}{6}of the overbound 2.4TW. Heinz H. Schreiber |
IEEE Trans. Inf. Theory | 1 |