Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
What cannot be computed locally! , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces CIRCLES protocol that computes relative majority with k^3 states via circular lists where no two agents of same color share a list.
citing papers explorer
-
Distributed Stochastic Graph Algorithms
Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.
-
Ranking Opinions with Few States in Population Protocols
Introduces CIRCLES protocol that computes relative majority with k^3 states via circular lists where no two agents of same color share a list.