Abstract
One of the main goals of the study of distributed computing concerns understanding and coping with the issue of locality. In particular, a central theme in this line of study deals with classifying problems according to their local distributed solvability and identifying the relevant parameters governing local solvability, towards establishing a computational complexity theory for locality. The talk will consider the locality of distributed decision problems, and focus on the question whether randomness helps in locally deciding distributed languages. The key issues related to this question will be illustrated via basic examples and relevant results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peleg, D. (2013). Randomized Distributed Decision (Invited Lecture Abstract). In: Gąsieniec, L., Wolter, F. (eds) Fundamentals of Computation Theory. FCT 2013. Lecture Notes in Computer Science, vol 8070. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40164-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-40164-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40163-3
Online ISBN: 978-3-642-40164-0
eBook Packages: Computer ScienceComputer Science (R0)