149 citations · 573 across the 30 of their papers we have counts for
23 papers · 1 filter
Byzantine-Resilient Distributed Computation via Task Replication and Local Computations
Aayush Rajesh, Nikhil Karamchandani, Vinod M. Prabhakaran
We study a distributed computation problem in the presence of Byzantine workers where a central node wishes to solve a task that is divided into independent sub-tasks, each of whic…
On the Regret of Coded Caching with Adversarial Requests
Anupam Nayak, Kota Srinivas Reddy, Nikhil Karamchandani
We study the well-known coded caching problem in an online learning framework, wherein requests arrive sequentially, and an online policy can update the cache contents based on the…
Cascaded Group Testing
Waqar Mirza, Nikhil Karamchandani, Niranjan Balachandran
In this paper, we introduce a variation of the group testing problem where each test is specified by an ordered subset of items and returns the first defective item in the specifie…
On the Regret of Online Coded Caching
Anupam Nayak, Sheel Shah, Nikhil Karamchandani
We consider the widely studied problem of coded caching under non-uniform requests where users independently request files according to some underlying popularity distribution in e…
Multi-access Coded Caching with Linear Subpacketization
Srinivas Reddy Kota, Nikhil Karamchandani
We consider the multi-access coded caching problem, which contains a central server with files, caches with units of memory each and users where each one is connect…
On Gradient Coding with Partial Recovery
Sahasrajit Sarmasarkar, V. Lalitha, Nikhil Karamchandani
We consider a generalization of the gradient coding framework where a dataset is divided across workers and each worker transmits to a master node one or more linear combinatio…