A combinatorial characterization of the distributed 1-solvable tasks

Attiya, 1987, Achievable cases in an asynchronous environment, 337 Attiya, 1988, Computing on anonymous rings, J. Assoc. Comput. Mach., 35, 845, 10.1145/48014.48247 Biran, 1990, Deciding 1-solvability of distributed tasks is NP-hard O. Biran, S. Moran, and S. Zaks, Tight bounds on the round complexity of distributed 1-solvable tasks, in preparation. Dolev, 1987, On the minimal synchronism needed for distributed consensus, J. Assoc. Comput. Mach., 34, 77, 10.1145/7531.7533 Dolev, 1986, Reaching approximate agreement in the presence of faults, J. Assoc. Comput. Mach., 33, 499, 10.1145/5925.5931 Fekete, 1987, Asynchronous approximate agreement, 64 Fischer, 1986, Easy impossibility proofs for distributed consensus problems, Distrib. Comput., 1, 26, 10.1007/BF01843568 Fischer, 1985, Impossibility of distributed consensus with one faulty process, J. Assoc. Comput. Mach., 32, 373, 10.1145/3149.214121 Korach, 1984, Tight lower and upper bounds for some distributed algorithms for a complete network of processors, 199 Lamport, 1982, The Byzantine generals problem, ACM Trans. Programming Lang. Systems, 4, 382, 10.1145/357172.357176 Moran, 1987, Extended impossibility results for asynchronous complete networks, Inform. Process. Lett., 26, 145, 10.1016/0020-0190(87)90052-4 Taubenfeld, 1988