The Laplacian Paradigm in the Broadcast Congested Clique

Principles of Distributed Computing（2022）

引用 4|浏览7

暂无评分

摘要

BSTRACTIn this paper, we bring the main tools of the Laplacian paradigm to the Broadcast Congested Clique. We introduce an algorithm to compute spectral sparsifiers in a polylogarithmic number of rounds, which directly leads to an efficient Laplacian solver. Based on this primitive, we consider the linear program solver of Lee and Sidford [30].

查看译文

关键词

broadcast congested clique,laplacian paradigm

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要