DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead

DOI10.1145/3382734.3405716OpenAlexW3046536558MaRDI QIDQ5855269

Gopal Pandurangan, Peter Robinson, Amitabh Trehan

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3382734.3405716

zbMATH Keywords

randomized algorithmexpanderdistributed protocolpeer-to-peer networkself-repairing network

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (2)

Time-optimal construction of overlay networks ⋮ The complexity of growing a graph

This page was built for publication: DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead