TY - GEN
T1 - Solvability in asynchronous environments
AU - Chor, Benny
AU - Moscovici, Lior
PY - 1989
Y1 - 1989
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0024768950&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1989.63513
DO - 10.1109/sfcs.1989.63513
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:0024768950
SN - 0818619821
SN - 9780818619823
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 422
EP - 427
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - Publ by IEEE
T2 - 30th Annual Symposium on Foundations of Computer Science
Y2 - 30 October 1989 through 1 November 1989
ER -