2 citations · 3 across the 3 of their papers we have counts for
3 papers
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…
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…
A Decentralized Policy for Minimization of Age of Incorrect Information in Slotted ALOHA Systems
Anupam Nayak, Anders E. Kalør, Federico Chiariotti +1
The Age of Incorrect Information (AoII) is a metric that can combine the freshness of the information available to a gateway in an Internet of Things (IoT) network with the accurac…