Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. J.E. Burns and N.A. Lynch, The byzantine firing squad problem, MIT Laboratory for Computer Science report TM-275, April 1985; to appear in Advances in Computing Research.
2. M.J. Fischer, N.A. Lynch and M. Merritt, Easy impossibility proofs for distributed consensus problems, Proc. 4th ACM Symp. on Principles of Distributed Computing, Minaki, Canada, August, 1985, 59–70.
3. Y. Nishitani and N. Honda, The firing squad synchronization problem for graphs, Theoretical Computer Science 14(1981), 39–61.
4. E.T. Ordman, Distributed graph recognition with malicious faults, to appear in Proceedings First China-U.S.A. International Conf. on Graph Theory and its Applications, Jinan, China, June, 1986.
5. E.T. Ordman, A byzantine firing squad algorithm for networks, Technical report, Memphis State University Dept. of Mathematical Sciences, 1987.