EDBT 2026 Demo / reviewers in the wild / expert

Scott Garrabrant

dblp:06/8657 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

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
Combinatorics and discrete mathematics · 50% Computational complexity · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
counting complexity		 0.212016
Permutation patterns are hard to count · SODA 2016
Combinatorics and discrete mathematics › permutation
permutation patterns		 0.212016
Permutation patterns are hard to count · SODA 2016
YearPublicationVenuePosition
2016 Permutation patterns are hard to count
abstract
Let ℱ ⊂ Sk be a finite set of permutations and let Cn(ℱ) denote the number of permutations σ ∊ Sn avoiding the set of patterns ℱ. We prove that {Cn (ℱ)} cannot be computed in time polynomial in n, unless EXP = ⊕EXP. Our tools also allow us to disprove the Noonan–Zeilberger conjecture which states that the sequence {Cn(ℱ)} is P-recursive.
Scott Garrabrant, Igor Pak
 SODA1