A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
- David Peleg
- , Vitaly Rubinovich
- Weizmann Institute of Science
- Department of Mathematics and Computer Science
- Bar-Ilan University
Research output: Contribution to journal › Article › peer-review
135
Scopus
citations