PhD Synopsis Seminar
Succinct Representations of Shortest Paths in Graphs
Communication Complexity of $\mathsf{XOR}$ Functions
Communication Complexity and Characterization Results in Secure Computation
On Query and Communication Complexity
Invariant Measures for Queueing and Spatial Markov Processes: Algorithms and Analysis
Complexity Measures of Boolean Functions
On Sparsest Cut and Parallel Repetition
Dimension Reduction for Efficient Algorithms and Visualization
The Bit-Probe Complexity of Set Membership
Pages
