Testing equality under the local broadcast model

DOI10.1007/978-3-030-79527-6_15MaRDI QIDQ2117734zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Testing Equality in Communication Graphs
• Local testing of lattices
• Local testing for membership in lattices
• Strict local testability with consensus equals regularity
• scientific article; zbMATH DE number 1923048
• scientific article; zbMATH DE number 7650374
• Strict local testability with consensus equals regularity, and other properties
• From local to robust testing via agreement testing
• From Local to Robust Testing via Agreement Testing
• scientific article; zbMATH DE number 2050949

Cites work

• scientific article; zbMATH DE number 7650880 (Why is no real title available?)
• Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
• Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
• Nearly complete graphs decomposable into large induced matchings and their applications
• On weakly connected domination in graphs
• Polynomial Codes Over Certain Finite Fields
• Testing Equality in Communication Graphs
• The Range of Topological Effects on Communication
• Weakly connected domination in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117734)