Erik Waingarten

Optimal hashing-based time-space trade-offs for approximate near neighbors

[See the paper for the full abstract.] We show tight upper and lower bounds for time-space trade-offs for the

Approximate near neighbors for general symmetric norms

c

Settling the Query Complexity of Non-Adaptive Junta Testing

-Approximate Near Neighbor Search problem. For the

Boolean Unateness Testing with Õ(n^{3/4}) Adaptive Queries

d

Playing Dominoes Is Hard, Except by Yourself

-dimensional Euclidean space and

Data-dependent hashing via nonlinear spectral gaps

n

Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces

-point datasets, we develop a data structure with space

Arboral satisfaction: Recognition and LP approximation

n^{1 + \rho_u + o(1)} + O(dn)

Mario Kart Is Hard

and query time

Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness

n^{\rho_q + o(1)} + d n^{o(1)}