149 citations · 573 across the 30 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.SI2017
Persistence of the Jordan center in Random Growing Trees
Sarath Pattathil, Nikhil Karamchandani, Dhruti Shah
The Jordan center of a graph is defined as a vertex whose maximum distance to other nodes in the graph is minimal, and it finds applications in facility location and source detecti…
cs.IT2017
Caching with Partial Adaptive Matching
Jad Hachem, Nikhil Karamchandani, Sharayu Moharir +1
We study the caching problem when we are allowed to match each user to one of a subset of caches after its request is revealed. We focus on non-uniformly popular content, specifica…