Demo Data from SIGIR 2026 / reviewers in the wild / expert
Harry H. Denman
dblp:66/4054
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1961
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, 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.
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization
code generation |
0.0 | 1 | 1961 | Computer Generation of Optimized Subroutines · J. ACM 1961 |
Mathematical optimization
approximation theory |
0.0 | 1 | 1961 | Computer Generation of Optimized Subroutines · J. ACM 1961 |
Mathematical optimization › approximation theory
chebyshev approximation |
0.0 | 1 | 1961 | Computer Generation of Optimized Subroutines · J. ACM 1961 |
Methods — techniques the papers use, named apart from their topics
minimax polynomial approximation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1961 | Computer Generation of Optimized SubroutinesabstractA inethod is presented by met~ns of which a digit~d computer ratty be programmed to generate function-evtfluation subroutines.The ttpproximation formub~ uMed in t.hese subroutines is nettrly the opt~imum polynomitfl ~tpproximation (in the Chebyshev sense) for that function in e~ given arbitr~ry intervtfl.A program has been written which .'~pplies this method to a set of functions; some results t, re presented. Harry H. Denman |
J. ACM | 1 |