research
∙
08/07/2023
Testing Graph Properties with the Container Method
We establish nearly optimal sample complexity bounds for testing the ρ-c...
share
research
∙
05/04/2023
Testing Convexity of Discrete Sets in High Dimensions
We study the problem of testing whether an unknown set S in n dimensions...
research
∙
08/26/2022
Randomised Composition and Small-Bias Minimax
We prove two results about randomised query complexity R(f). First, we i...
research
∙
12/07/2020
VC Dimension and Distribution-Free Sample-Based Testing
We consider the problem of determining which classes of functions can be...
research
∙
02/25/2020
A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions
We prove two new results about the randomized query complexity of compos...
research
∙
02/25/2020
A New Minimax Theorem for Randomized Algorithms
The celebrated minimax principle of Yao (1977) says that for any Boolean...
research
∙
09/26/2019
Box Covers and Domain Orderings for Beyond Worst-Case Join Processing
Recent beyond worst-case optimal join algorithms Minesweeper and its gen...
research
∙
08/07/2019
Testing convexity of functions over finite domains
We establish new upper and lower bounds on the number of queries require...
research
∙
08/02/2019
