Going Higher in First-Order Quantifier Alternation Hierarchies on Words.
Approaching 3/2 for the
Bar Induction is Compatible with Constructive Type Theory.
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models.
Pseudorandomness from Shrinkage.
Capacity Upper Bounds for Deletion-type Channels.
Exact Algorithms via Monotone Local Search.