Approximate agreement on graphs is t-resilient solvable in asynchronous systems if and only if the graph's clique complex is (t-1)-connected, with separations shown between agreement variants.
Morgan Kaufmann, San Francisco, CA, 2014
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces DSL and DDSL as deontic logics on simplicial complexes for modeling joint commitments, with claimed soundness and completeness proofs.
citing papers explorer
-
Solvability of Approximate Agreement on Graphs and Simplicial Complexes
Approximate agreement on graphs is t-resilient solvable in asynchronous systems if and only if the graph's clique complex is (t-1)-connected, with separations shown between agreement variants.
-
A Dynamic Deontic Simplicial Logic for Joint Commitments
Introduces DSL and DDSL as deontic logics on simplicial complexes for modeling joint commitments, with claimed soundness and completeness proofs.