Demo Data from SIGIR 2026 / reviewers in the wild / expert
Benjamin Bedert
dblp:371/7836
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 first-author · 1 since 2021
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 |
Computational complexity · 44% Combinatorics and discrete mathematics · 44% Automated reasoning and model checking · 13% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics › additive combinatorics
polynomial freiman-ruzsa conjecture |
0.9 | 1 | 2025 | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa · FOCS 2025 |
Computational complexity
proof complexity |
0.9 | 1 | 2025 | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa · FOCS 2025 |
Automated reasoning and model checking
satisfiability |
0.3 | 1 | 2025 | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa · FOCS 2025 |
Methods — techniques the papers use, named apart from their topics
sparsification · 0.9polynomial freiman-ruzsa · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
Benjamin Bedert, Tamio-Vesa Nakajima, Karolina Okrasa, Stanislav Zivný |
FOCS | 1 |