Testing equality under the local broadcast model
From MaRDI portal
Publication:2117734
DOI10.1007/978-3-030-79527-6_15OpenAlexW3176373813MaRDI QIDQ2117734FDOQ2117734
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
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
- scientific article; zbMATH DE number 7563814
- From Local to Robust Testing via Agreement Testing
- scientific article; zbMATH DE number 2050949
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Polynomial Codes Over Certain Finite Fields
- On weakly connected domination in graphs
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- The Range of Topological Effects on Communication
- Nearly complete graphs decomposable into large induced matchings and their applications
- Testing Equality in Communication Graphs
- Weakly connected domination in graphs
- Exact Byzantine Consensus on Undirected Graphs under Local Broadcast Model
- Title not available (Why is that?)
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)
