Interweaved Clique design delivers communication cost within factor 4e of the converse bound and order-optimal computation cost for general d-uniform distributed computing tasks.
An achievable scheme for the k-user lin- ear computation broadcast channel
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
The work provides achievable and converse bounds on worst-case load for decentralized coded caching using independent random linear coding placement that coincide under certain conditions.
citing papers explorer
-
Order Optimal Task Allocation in Distributed Computing via Interweaved Cliques
Interweaved Clique design delivers communication cost within factor 4e of the converse bound and order-optimal computation cost for general d-uniform distributed computing tasks.
-
On Coded Caching Systems with Decentralized Linear Coding Placement
The work provides achievable and converse bounds on worst-case load for decentralized coded caching using independent random linear coding placement that coincide under certain conditions.