Demo Data from EDBT 2026 / reviewers in the wild / expert
Amitay Kamber
dblp:322/1142
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · unresolved
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 |
Graph algorithms and graph theory · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
expander graphs |
0.6 | 1 | 2022 | Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders · STOC 2022 |
Graph algorithms and graph theory › expander graphs
ramanujan graphs |
0.6 | 1 | 2022 | Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders · STOC 2022 |
Graph algorithms and graph theory › expander graphs
unique-neighbor expanders |
0.6 | 1 | 2022 | Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders · STOC 2022 |
Methods — techniques the papers use, named apart from their topics
number theory · 0.6closed orbits · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expandersabstractThe question of finding expander graphs with strong vertex expansion properties such as unique neighbor expansion and lossless expansion is central to computer science. A barrier to constructing these is that strong notions of expansion could not be proven via the spectral expansion paradigm. Amitay Kamber, Tali Kaufman |
STOC | 1 |