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 the o ptimal load-memory tradeoff of cache-aided scalar linear functio n retrieval,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.