research
∙
07/08/2023
On the Composition of Randomized Query Complexity and Approximate Degree
For any Boolean functions f and g, the question whether R(f∘ g) = Θ̃(R(f...
share
research
∙
11/30/2022
Lifting to Parity Decision Trees Via Stifling
We show that the deterministic decision tree complexity of a (partial) f...
research
∙
09/16/2022
Decision Tree Complexity versus Block Sensitivity and Degree
Relations between the decision tree complexity and various other complex...
research
∙
02/28/2022
Sampling-Based Winner Prediction in District-Based Elections
In a district-based election, we apply a voting rule r to decide the win...
research
∙
05/05/2021
One-way communication complexity and non-adaptive decision trees
We study the relationship between various one-way communication complexi...
research
∙
12/03/2020
Tight Chang's-lemma-type bounds for Boolean functions
Chang's lemma (Duke Mathematical Journal, 2002) is a classical result wi...
research
∙
08/01/2020
On parity decision trees for Fourier-sparse Boolean functions
We study parity decision trees for Boolean functions. The motivation of ...
research
∙
11/27/2018
A composition theorem for randomized query complexity via max conflict complexity
Let R_ϵ(·) stand for the bounded-error randomized query complexity with ...
research
∙
01/10/2018
A Composition Theorem via Conflict Complexity
Let (·) stand for the bounded-error randomized query complexity. We show...
research
∙
08/02/2017