Demo Data from EDBT 2026 / reviewers in the wild / expert
Gilad Chase
dblp:294/3997
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2022
—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 · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
boolean function analysis |
0.6 | 1 | 2022 | Approximate polymorphisms · STOC 2022 |
Computational complexity
constraint satisfaction |
0.6 | 1 | 2022 | Approximate polymorphisms · STOC 2022 |
Computational complexity › constraint satisfaction › algebraic approach to constraint satisfaction
polymorphism |
0.6 | 1 | 2022 | Approximate polymorphisms · STOC 2022 |
Methods — techniques the papers use, named apart from their topics
fourier analysis · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Approximate polymorphismsabstractFor a function g∶{0,1}m→{0,1}, a function f∶ {0,1}n→{0,1} is called a g-polymorphism if their actions commute: f(g(row1(Z)),…,g(rown(Z))) = g(f(col1(Z)),…,f(colm(Z))) for all Z∈{0,1}n× m. The function f is called an approximate g-polymorphism if this equality holds with probability close to 1, when Z is sampled uniformly. A pair of functions f0,f1∶ {0,1}n → {0,1} are called a skew g-polymorphism if f0(g(row1(Z)),…,g(rown(Z))) = g(f1(col1(Z)),…,f1(colm(Z))) for all Z∈{0,1}n× m. Gilad Chase, Yuval Filmus, Dor Minzer, Elchanan Mossel, Nitin Saurabh |
STOC | 1 |