Demo Data from SIGIR 2026 / reviewers in the wild / expert
J. W. Wright
dblp:55/3288
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1975
—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 · 67% Algorithms and data structures · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › combinatorial optimization
change-making problem |
0.0 | 1 | 1975 | The Change-Making Problem · J. ACM 1975 |
Mathematical optimization
combinatorial optimization |
0.0 | 1 | 1975 | The Change-Making Problem · J. ACM 1975 |
Algorithms and data structures
dynamic programming |
0.0 | 1 | 1975 | The Change-Making Problem · J. ACM 1975 |
Methods — techniques the papers use, named apart from their topics
dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | The Change-Making ProblemabstractA cashier has a number of coins of different denominatmns at his disposal and wishes to make a selection, using the least number of corns, to meet a g~ven total The solution given here employs dynamic programming Suggestions are made which reduce the volume of computation required m handling the recurmve equatmns The method can be apphed to the one-dimensional cargoloading and stock-cutting problem, and ~t can be extended to the two-dimensional problem. J. W. Wright |
J. ACM | 1 |