Demo Data from SIGIR 2026 / reviewers in the wild / expert
Claude A. Christen
dblp:77/2121
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1988
—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 |
Distributed computing theory · 87% Algorithms and data structures · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed computing theory
conflict resolution |
0.0 | 1 | 1988 | Optimal contention among three senders · IEEE Trans. Inf. Theory 1988 |
Distributed computing theory
contention resolution |
0.0 | 1 | 1988 | Optimal contention among three senders · IEEE Trans. Inf. Theory 1988 |
Methods — techniques the papers use, named apart from their topics
nested detection algorithm · 0.0lower bound interpolation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1988 | Optimal contention among three sendersabstractThe tests allowed in conflict resolution problems have usually three types of outcomes, according to whether the test contains zero, one, or at least two senders. The question of locating three elements in a given interval of the real line with the least number of such tests is studied. A nested detection algorithm is provided which is then proven to be optimal. For this purpose, extensive use is made of a principle allowing interpolation between lower bounds.> Claude A. Christen |
IEEE Trans. Inf. Theory | 1 |