Develops a probabilistic epistemic logic framework for bounded-round randomized distributed algorithms and applies it to formally analyze and strengthen the lower bound of the Varghese-Lynch randomized coordinated attack algorithm.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Epistemic Analysis of Random Coordinated Attack
Develops a probabilistic epistemic logic framework for bounded-round randomized distributed algorithms and applies it to formally analyze and strengthen the lower bound of the Varghese-Lynch randomized coordinated attack algorithm.