research
∙
07/29/2023
Locked Polyomino Tilings
A locked t-omino tiling is a tiling of a finite grid or torus by t-omino...
share
research
∙
05/20/2023
You Can Have Your Cake and Redistrict It Too
The design of algorithms for political redistricting generally takes one...
research
∙
04/24/2023
Pseudorandom Finite Models
We study pseudorandomness and pseudorandom generators from the perspecti...
research
∙
11/28/2022
Representation with Incomplete Votes
Platforms for online civic participation rely heavily on methods for con...
research
∙
07/07/2022
Playing Divide-and-Choose Given Uncertain Preferences
We study the classic divide-and-choose method for equitably allocating d...
research
∙
02/22/2022
Topological Universality of the Art Gallery Problem
We prove that any compact semi-algebraic set is homeomorphic to the solu...
research
∙
09/27/2021
Compact Redistricting Plans Have Many Spanning Trees
In the design and analysis of political redistricting maps, it is often ...
research
∙
06/25/2021
Can Buyers Reveal for a Better Deal?
We study small-scale market interactions in which buyers are allowed to ...
research
∙
06/21/2021
Thou Shalt Covet The Average Of Thy Neighbors' Cakes
We prove an Ω(n^2) lower bound on the query complexity of local proporti...
research
∙
04/09/2021
Inapproximability of Unique Games in Fixed-Point Logic with Counting
We study the extent to which it is possible to approximate the optimal v...
research
∙
08/03/2020
Approximating Constraint Satisfaction Problems Symmetrically
This thesis investigates the extent to which the optimal value of a cons...
research
∙
03/19/2018
Computational topology and the Unique Games Conjecture
Covering spaces of graphs have long been useful for studying expanders (...
research
∙
02/22/2018