Fast protocols for leader election and spanning tree construction in a distributed network

DOI10.1134/S0032946017020065zbMath1436.68048OpenAlexW2734676669MaRDI QIDQ2285076

I. M. Khuziev, Mikhail N. Vyalyi

Publication date: 16 January 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946017020065

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12)

Cites Work

• Symmetry breaking in distributed networks
• Distributed communication complexity of spanning tree construction
• A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
• Bit complexity of breaking and achieving symmetry in chains and rings

This page was built for publication: Fast protocols for leader election and spanning tree construction in a distributed network