Tight Bounds for Asymptotic and Approximate Consensus.
Invited Article Foreword.
Adjacency Labelling for Planar Graphs (and Beyond).
Logical Relations as Types: Proof-Relevant Parametricity for Program Modules.
Near-linear Time Approximation Schemes for Clustering in Doubling Metrics.
Fast Sampling and Counting
Distribution-free, Risk-controlling Prediction Sets.
#NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes.
Decision List Compression by Mild Random Restrictions.