Testing equality under the local broadcast model

DOI10.1007/978-3-030-79527-6_15OpenAlexW3176373813MaRDI QIDQ2117734

Muhammad Samir Khan, Nitin H. Vaidya

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79527-6_15

zbMATH Keywords

communication complexitylocal broadcastmultiparty equalitystatic protocols

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• On weakly connected domination in graphs
• Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
• Weakly Connected Domination in Graphs
• Polynomial Codes Over Certain Finite Fields
• The Range of Topological Effects on Communication
• Testing Equality in Communication Graphs
• Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
• Nearly complete graphs decomposable into large induced matchings and their applications

This page was built for publication: Testing equality under the local broadcast model