Demo Data from SIGIR 2026 / reviewers in the wild / expert
Pál Takácsi-Nagy
dblp:43/5607
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none
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 |
Computational complexity · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational complexity
boolean function complexity |
0.0 | 1 | 1992 | Symmetry and Complexity · STOC 1992 |
Computational complexity
circuit complexity |
0.0 | 1 | 1992 | Symmetry and Complexity · STOC 1992 |
Computational complexity › boolean function analysis
symmetric functions |
0.0 | 1 | 1992 | Symmetry and Complexity · STOC 1992 |
Methods — techniques the papers use, named apart from their topics
group-theoretic symmetry analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Symmetry and ComplexityabstractWe examine the effect of symmetry on the complexity of Boolean functions and find a remarkably tight hierarchy.Generalizing the fact that all symmetric Boolean functions belong to (nonuniform) Z'CO, we find that the complexity of the class of Boolean functions admitting a given group of symmetries is essentially determined by a single parameter of that group. László Babai, Robert Beals, Pál Takácsi-Nagy |
STOC | 3 |