In this work, we explore the problem of multi-user linearly-separable distributed computation,
where servers help compute the desired functions (jobs) of users, and where each desired …

This work studies a well-known shared-cache coded caching scenario where each cache
can serve an arbitrary number of users. We analyze the case where there is some …

This work elevates coded caching networks from their purely information-theoretic
framework to a stochastic setting, by exploring the effect of random user activity and by …

This paper studies the fundamental limits of the shared-link coded caching problem with
correlated files, where a server with a library of files communicates with users who can …

In this paper, we consider a coded caching scenario where users have heterogeneous
interests. Taking into consideration the system model originally proposed by Wang and …

Network models are essential for representing a myriad of real-world problems. Two of the
most important categories of networks are centralized and distributed networks. In this …