2 citations · 2 across the 6 of their papers we have counts for
10 papers
Fundamental Limits of Hypergraph Edge Partitioning under Independent Edge Sampling
Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia
Hypergraph edge partitioning is a central problem in theoretical and applied computer science, with broad impact on distributed computation, communications, optimization, and machi…
Order Optimal Task Allocation in Distributed Computing via Interweaved Cliques
Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia
We consider a distributed computing system in which a master node coordinates workers to evaluate a function over input files, where this function accepts general decomposi…
Secure Multi-User Linearly-Separable Distributed Computing
Amir Masoud Jafarpisheh, Ali Khalesi, Petros Elia
The introduction of the new multi-user linearly-separable distributed computing framework, has recently revealed how a parallel treatment of users can yield large parallelization g…
Fundamental Limits of Multi-User Distributed Computing of Linearly Separable Functions
K. K. Krishnan Namboodiri, Elizabath Peter, Derya Malak +1
This work establishes the fundamental limits of the classical problem of multi-user distributed computing of linearly separable functions. In particular, we consider a distributed…
Universal and Asymptotically Optimal Data and Task Allocation in Distributed Computing
Javad Maheri, K. K. Krishnan Namboodiri, Petros Elia
We study the joint minimization of communication and computation costs in distributed computing, where a master node coordinates workers to evaluate a function over a library o…
Multi-User Non-Linearly Separable Distributed Computing
Ali Khalesi, Ahmad Tanha, Derya Malak +1
This paper considers an -server distributed computing setting with users requesting functions that are arbitrary multivariable polynomial evaluations of real (potentiall…
Hyper-Minrank: A Unified Hypergraph Characterization of Multi-Sender Index Coding
Ali Khalesi, Petros Elia
This work introduces a hypergraph formulation that generalizes the classical paradigm of Bar-Yossef et al. to the multi-sender index coding (MSIC) setting. Central to the model is…
Fundamental Limits of Distributed Computing for Linearly Separable Functions
K. K. Krishnan Namboodiri, Elizabath Peter, Derya Malak +1
This work addresses the problem of distributed computation of linearly separable functions, where a master node with access to datasets, employs servers to compute user…
Tessellated Distributed Computing
Ali Khalesi, Petros Elia
The work considers the -server distributed computing scenario with users requesting functions that are linearly-decomposable over an arbitrary basis of real (potentially…
Coded Caching Schemes for Multiaccess Topologies via Combinatorial Design
Minquan Cheng, Kai Wan, Petros Elia +1
This paper studies a multiaccess coded caching (MACC) where the connectivity topology between the users and the caches can be described by a class of combinatorial designs. Our mod…