Randomized distributed decision

Pierre Fraigniaud, Mika Goeoes, Amos Korman, Merav Parter, David Peleg

Research output: Contribution to journalArticlepeer-review

19 Citations (Scopus)

Abstract

The paper tackles the power of randomization in the context of local distributed computing by analyzing the ability to “boost” the success probability of deciding a distributed language using a Monte-Carlo algorithm. We prove that, in many cases, the ability to increase the success probability for deciding distributed languages is rather limited. This contrasts with the sequential computing setting where boosting can systematically be achieved by repeating the randomized execution.

Original languageEnglish
Pages (from-to)419-434
Number of pages16
JournalDistributed Computing
Volume27
Issue number6
DOIs
Publication statusPublished - 23 Nov 2014

Funding

Publisher Copyright: © 2014, Springer-Verlag Berlin Heidelberg.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Randomized distributed decision'. Together they form a unique fingerprint.

Cite this