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
∙
09/16/2022
Decision Tree Complexity versus Block Sensitivity and Degree
Relations between the decision tree complexity and various other complex...
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
∙
11/27/2018
