Solvability in asynchronous environments

Benny Chor*, Lior Moscovici

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


The authors present necessary and sufficient combinatorial conditions that determine membership in SMt (respectively, MPt), the class of distributed decision tasks that are solvable in the shared memory (resp. message passing) model by a t-resilient randomized protocol, which never errs and works in the presence of a strong adversary. The sufficiency of the conditions is proved by designing protocols that are applicable to all tasks in the appropriate class. The computational complexity of the membership characterization is studied.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Number of pages6
ISBN (Print)0818619821, 9780818619823
StatePublished - 1989
Externally publishedYes
Event30th Annual Symposium on Foundations of Computer Science - Research Triangle Park, NC, USA
Duration: 30 Oct 19891 Nov 1989

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428


Conference30th Annual Symposium on Foundations of Computer Science
CityResearch Triangle Park, NC, USA


Dive into the research topics of 'Solvability in asynchronous environments'. Together they form a unique fingerprint.

Cite this