相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Improved Deterministic (Δ+1)-Coloring in Low-Space MPC
Artur Czumaj et al.
PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21) (2021)
Algebraic methods in the congested clique
Keren Censor-Hillel et al.
DISTRIBUTED COMPUTING (2019)
Distributed distance computation and routing with small messages
Christoph Lenzen et al.
DISTRIBUTED COMPUTING (2019)
Thorup-Zwick emulators are universally optimal hopsets
Shang-En Huang et al.
INFORMATION PROCESSING LETTERS (2019)
Fast Approximate Shortest Paths in the Congested Clique
Keren Censor-Hillel et al.
PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19) (2019)
Near-Additive Spanners In Low Polynomial Deterministic CONGEST Time
Michael Elkin et al.
PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19) (2019)
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model
Taisuke Izumi et al.
PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19) (2019)
HOPSETS WITH CONSTANT HOPBOUND, AND APPLICATIONS TO APPROXIMATE SHORTEST PATHS
Michael Elkin et al.
SIAM JOURNAL ON COMPUTING (2019)
Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC
Michael Elkin et al.
SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019 (2019)
A HIERARCHY OF LOWER BOUNDS FOR SUBLINEAR ADDITIVE SPANNERS
Amir Abboud et al.
SIAM JOURNAL ON COMPUTING (2018)
Lessons from the Congested Clique applied to Map Reduce
James W. Hegeman et al.
THEORETICAL COMPUTER SCIENCE (2015)
Nearly Maximum Flows in Nearly Linear Time
Jonah Sherman
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2013)
Better Pseudorandom Generators from Milder Pseudorandom Restrictions
Parikshit Gopalan et al.
2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) (2012)
Minimum-weight spanning tree construction in O(log log n) communication rounds
Z Lotker et al.
SIAM JOURNAL ON COMPUTING (2005)
(1+epsilon, beta)-Spanner constructions for general graphs
M Elkin et al.
SIAM JOURNAL ON COMPUTING (2004)
All-pairs almost shortest paths
D Dor et al.
SIAM JOURNAL ON COMPUTING (2000)
分享论文
