Demo Data from EDBT 2026 / reviewers in the wild / expert
P. J. Buxbaum
dblp:134/6373
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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 |
Information theory · 67% Mathematical optimization · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory
estimation theory |
0.0 | 1 | 1974 | Fixed-memory recursive filters (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Mathematical optimization
least squares |
0.0 | 1 | 1974 | Fixed-memory recursive filters (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Information theory › signal processing › filtering
recursive filtering |
0.0 | 1 | 1974 | Fixed-memory recursive filters (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Methods — techniques the papers use, named apart from their topics
recursive algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | Fixed-memory recursive filters (Corresp.)abstractThis correspondence presents three algorithms for computing least-squares estimates based on fixed amounts of data. P. J. Buxbaum |
IEEE Trans. Inf. Theory | 1 |