Abstract: For applications with geo-distributed client base such as Twitter, Amazon, Wikipedia, etc., in order to provide an always-on service with uniform low latency, application data needs to be replicated in multiple locations across the world

Abstract: Given a graph $G$ with one source vertex $s$ and several target vertices, a shortest path tree rooted at $s$ is a subgraph of $G$ that preserves distances from $s$ to each of the target vertices.

Abstract:  The task of manipulating randomness has been a subject of intense investigation in computational complexity with dispersers, extractors, pseudorandom generators, condensers, mergers being just a few of the objects of interest.

Abstract: Many recent advancements in computation have come from harnessing the power of very large sets of data.  This leads to an algorithmic question: how can we store a large dataset so that we can quickly query it later on? 

Abstract: A famous result of Ahlswede in the theory of Arbitrarily Varying Channels (AVCs) stated that the deterministic coding capacity of an AVC is either zero or is equal to its random coding capacity.