Space-Time Tradeoffs for Distributed Verification

  title={Space-Time Tradeoffs for Distributed Verification},
  author={Mor Baruch and Rafail Ostrovsky and Will Rosenbaum},
Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally checkable proofs (LCP), and nondeterministic local decision (NLD). In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa [15] presented a proof-labeling scheme for MST, with poly-logarithmic verification time… CONTINUE READING

Similar Papers

Loading similar papers…