Demo Data from EDBT 2026 / reviewers in the wild / expert
Doron Puder
dblp:11/8684
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
expander graphs |
0.2 | 1 | 2016 | Ramanujan coverings of graphs · STOC 2016 |
Graph algorithms and graph theory › graph theory
graph covering |
0.2 | 1 | 2016 | Ramanujan coverings of graphs · STOC 2016 |
Graph algorithms and graph theory › expander graphs
ramanujan graphs |
0.2 | 1 | 2016 | Ramanujan coverings of graphs · STOC 2016 |
Graph algorithms and graph theory
spectral graph theory |
0.2 | 1 | 2016 | Ramanujan coverings of graphs · STOC 2016 |
Methods — techniques the papers use, named apart from their topics
spectral radius bounds · 0.2interlacing families · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Ramanujan coverings of graphsabstractLet G be a finite connected graph, and let ρ be the spectral radius of its universal cover. For example, if G is k-regular then ρ=2√k−1. We show that for every r, there is an r-covering (a.k.a. an r-lift) of G where all the new eigenvalues are bounded from above by ρ. It follows that a bipartite Ramanujan graph has a Ramanujan r-covering for every r. This generalizes the r=2 case due to Marcus, Spielman and Srivastava (2013). Chris Hall, Doron Puder, William F. Sawin |
STOC | 2 |