Highly acyclic groups, hypergraph covers, and the guarded fragment.
Probabilistic ω-automata.
Invited article foreword.
New combinatorial topology bounds for renaming: The upper bound.
Polylogarithmic concurrent data structures from monotone circuits.