270 citations · 835 across the 84 of their papers we have counts for
6 papers · 1 filter
An Efficient Multiple-Groupcast Coded Multicasting Scheme for Finite Fractional Caching
Mingyue Ji, Karthikeyan Shanmugam, Giuseppe Vettigli +3
Coded multicasting has been shown to improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes t…
Learning Causal Graphs with Small Interventions
Karthikeyan Shanmugam, Murat Kocaoglu, Alexandros G. Dimakis +1
We consider the problem of learning causal networks with interventions, when each intervention is limited in size under Pearl's Structural Equation Model with independent errors (S…
Distributed Estimation of Graph 4-Profiles
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We present a novel distributed algorithm for counting all four-node induced subgraphs in a big graph. These counts, called the -profile, describe a graph's connectivity properti…
Finite Length Analysis of Caching-Aided Coded Multicasting
Karthikeyan Shanmugam, Mingyue Ji, Antonia M. Tulino +2
In this work, we study a noiseless broadcast link serving users whose requests arise from a library of files. Every user is equipped with a cache of size files each. It…
Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs
Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich +1
We study the problem of approximating the -profile of a large graph. -profiles are generalizations of triangle counts that specify the number of times a small graph appears a…
On Approximating the Sum-Rate for Multiple-Unicasts
Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis
We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with …