Bounds on the time to reach agreement in the presence of timing uncertainty

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Hagit Attiya , Amotz Bar-Noy , Danny Dolev , David Peleg , Rüdiger Reischuk, Renaming in an asynchronous environment, Journal of the ACM (JACM), v.37 n.3, p.524-548, July 1990 [doi>10.1145/79147.79158]
	2	H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer, #'Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty," Report TM-435, Laboratory fo# Computer Science, MIT. Also: IBM l#ese#rch l#eport 1#J7853.
	3	H. Attiya and N. Lynch, "Time Bounds for P#eal-Time Process Control in the Presence of Timing Uncertainty," Proc. l Oth {EEE Real- Time Systems Symposium, 1989, pp. 268- 284. Also: Technical Memo MIT/LCS/TM- 403, Laboratory for Computer Science, MIT, July 1989.
	4	H. Attiya and M. Mavronicolas, "Efficieacy of Asynchronous vs. Semi-Synchronous Networks," 28th Allerton Conf. on Communication, Control and Computing, October 1990. Also: Technical P#eport 21-90, Department of Computer Science, Harvard University, September 1990.
	5	F. Cfisti#n, H. Aghili, t#. Strong and D. Dolev, "Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement," Proc. i5th Int. Conf. on Fault Tolerant Computing, 1985, pp. 1-7. Also: IBM Research Report t#J5244, revised October 1989.
	6	B. A. Coan and C. Dwork, "Simultaneity is Harder th#n Agreement," Proc. 5th IEEE Symp. on Reliability in Distributed Software and Database Systems, 1986, pp. 141-150.
	7	B. A. Coan znd G. Thomas, "Agreeing on a Le#der in P#eal-Time," Proc. 11th IEEE Real- Time Systems Symposium, 1990.
	8	Richard A. DeMillo , Nancy A. Lynch , Michael J. Merritt, Cryptographic protocols, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.383-400, May 05-07, 1982, San Francisco, California, United States [doi>10.1145/800070.802214]
	9	Danny Dolev , Cynthia Dwork , Larry Stockmeyer, On the minimal synchronism needed for distributed consensus, Journal of the ACM (JACM), v.34 n.1, p.77-97, Jan. 1987 [doi>10.1145/7531.7533]
	10	Danny Dolev , Ruediger Reischuk , H. Raymond Strong, Early stopping in Byzantine agreement, Journal of the ACM (JACM), v.37 n.4, p.720-741, Oct. 1990 [doi>10.1145/96559.96565]
	11	D. Dolev #nd H. P#. Strong, "Authenticated Algorithms for Byzantine Agreement," SIAM J. on Computing, Vol. 12, No. 4 (November 1983), pp. 656-666.
	12	Cynthia Dwork , Nancy Lynch , Larry Stockmeyer, Consensus in the presence of partial synchrony, Journal of the ACM (JACM), v.35 n.2, p.288-323, April 1988 [doi>10.1145/42282.42283]
	13	Cynthia Dwork , Yoram Moses, Knowledge and common knowledge in a byzantine environment: crash failures, Information and Computation, v.88 n.2, p.156-186, Oct. 1990 [doi>10.1016/0890-5401(90)90014-9]
	14	C. Dwork #nd L. Stockmeyer, "Bounds on the Time to l#each Agreement as # Function of Message Del#y," IBM Research t#eport, in preparation.
	15	M. Fischer and N. Lynch, "A Lower Bound for the Time to Assure Interactive Consistency," Information Processing Letters,- Vol. 14, No. 4 (june 1982), pp. 183-186.
	16	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi>10.1145/3149.214121]
	17	Vassos Hadzilacos, Issues of fault tolerance in concurrent computations (databases, reliability, transactions, agreement protocols, distributed computing), 1985
	18	M. Herlihy , Mark R. Tuttle, Lower bounds for wait-free computation in message-passing systems, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.347-362, August 22-24, 1990, Quebec City, Quebec, Canada [doi>10.1145/93385.93439]
	19	A. Herzberg , S. Kutten, Fast isolation of arbitrary forwarding faults, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.339-353, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.73006]
	20	L. L#mport and M. Fischer, "Byzantine Generals and Transaction Commit Protocols," Tech. Report Op. 62, SRI International, Menlo Park, CA, 1982.
	21	Leslie Lamport , Robert Shostak , Marshall Pease, The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.382-401, July 1982 [doi>10.1145/357172.357176]
	22	M. Merritt, "Notes on the Dolev-Strong Lower Bound for Byzantine Agreement," unpublished manuscript, 1985.
	23	Y. Moses and M. Turtle, "Programming Simultaneous Actions Using Common Knowledge," Algorithm#ca, Vol. 3 (1988), pp. 121- 169.
	24	M. Pease , R. Shostak , L. Lamport, Reaching Agreement in the Presence of Faults, Journal of the ACM (JACM), v.27 n.2, p.228-234, April 1980 [doi>10.1145/322186.322188]
	25	S. Ponzio, "KeM-time Analysis of Timingbased Distributed Algorithms," MS thesis, in progress, MIT Electrical Engineering #nd Computer Science, 1990.
	26	Barbara Simons , Jennifer L. Welch , Nancy A. Lynch, An Overview of Clock Synchronization, Proceedings of the Asilomar Workshop on Fault-Tolerant Distributed Computing, p.84-96, January 1990
	27	P#. Strong, D. Dolev and F. Cristi#n, "New Latency Bounds for Atomic Bro#dc#t," Proc. I l th IEEE Real-Time Systems Symposium, 1990.