Demo Data from VLDB 2026 / reviewers in the wild / expert
R. Duane Hays
dblp:177/1200
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1973
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
Mathematical optimization · 50% Algorithms and data structures · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
convolution |
0.0 | 1 | 1973 | Numerical Technique for the Convolution of Piecewise Polynomial Functions · IEEE Trans. Computers 1973 |
Mathematical optimization
numerical computation |
0.0 | 1 | 1973 | Numerical Technique for the Convolution of Piecewise Polynomial Functions · IEEE Trans. Computers 1973 |
Methods — techniques the papers use, named apart from their topics
algebraic convolution law · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1973 | Numerical Technique for the Convolution of Piecewise Polynomial FunctionsabstractThis paper describes a general systematic procedure for the convolution of functions that are piecewise polynomial. The procedure can be implemented by hand using a simple table format or programmed for execution on a digital computer. An algebraic convolution law is dermed to replace integration; this provides an efficient digital computation algorithm. Thus, convolution operations of any complexity can be transformed into the algebraic manipulation of numbers by a digital computer. Robert J. Polge, R. Duane Hays |
IEEE Trans. Computers | 2 |