PhD Thesis Seminar
Communication Complexity of XOR Functions
Communication Complexity and Characterization Results in Secure Computation
Communication Complexity Amplification by Function Composition
On Sparsest Cut and Parallel Repetition
Complexity Measures of Boolean Functions: Fourier Sparsity, Fourier Dimension and Query Complexity
The Bit-probe Complexity of Set Membership
On Stochastic Approximation, Stochastic Algebraic Topology and Optimization in High Dimensions
Hardness of Approximate Coloring
One-shot Bounds in Classical and Quantum Information Theory
Pages
