PhD Synopsis Seminar
Secure Multiparty Computation with Limited Connectivity
Hitting Sets for Some Algebraic Models - Constructions and Consequences
Partial Function Extension with Applications to Learning and Property Testing
Coordination Over Networks: Shared Randomness, Security, and Interaction
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
Pages
