Hundreds of impossibility results for distributed computing

Distributed Computing

Volumn 16, Issue 2-3, 2003, Pages 121-163

  Fich, Faith ^a   Ruppert, Eric ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b YORK UNIVERSITY   (Canada)

Author keywords

Complexity lower bounds; Distributed computing; Impossibility results

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING LANGUAGES; CRYPTOGRAPHY; FAULT TOLERANT COMPUTER SYSTEMS;

COMPLEXITY LOWER BOUNDS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0141854015     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-003-0091-y     Document Type: Conference Paper

References (300)

1. K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing, pages 291-302, 1988
2. K. Abrahamson, A. Adler, R. Gelbart, L. Higham, D. Kirkpatrick, The bit complexity of randomized leader election on a ring. SIAM J. Comput., 18(1): 12-29, Feb. 1989
3. K. Abrahamson, A. Adler, L. Higham, D. Kirkpatrick. Randomized function evaluation on a ring. Distributed Computing, 3(3): 107-117, July 1989
4. K. Abrahamson, A. Adler, L. Higham, D. Kirkpatrick. Tight lower bounds for probabilistic solitude verification on anonymous rings. J. ACM, 41(2): 277-310, Mar. 1994
5. M. Adler, F. Fich. The complexity of end-to-end communication in memoryless networks. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 239-248, 1999
6. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, N. Shavit. Atomic snapshots of shared memory. J. ACM, 40(4): 873-890, Sept. 1993
7. Y. Afek, H. Attiya, A. Fekete, M. Fischer, N. Lynch, Y. Mansour, D.-W. Wang, L. Zuck. Reliable communication over unreliable channels. J. ACM, 41(6): 1267-1297, Nov. 1994
8. Y. Afek, D. Dauber, D. Touitou. Wait-free made fast. In Proceedings of the 27th ACM Symposium on Theory of Computing, pages 538-547, 1995
9. Y. Afek, E. Gafni. Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J. Comput., 20(2): 376-394, Apr. 1991
10. Y. Afek, D. S. Greenberg, M. Merritt, G. Taubenfeld. Computing with faulty shared objects. J. ACM, 42(6): 1231-1274, Nov. 1995
11. Y. Afek, M. Merritt, G. Taubenfeld. The power of multi-objects. Information and Computation, 153(1): 117-138, Aug. 1999
12. Y. Afek, G. Stupp. Optimal time-space tradeoff for shared memory leader election. J. Algorithms, 25(1): 95-117, Oct. 1997
13. D. Agrawal, M. Choy, H. V. Leong, A. K. Singh. Mixed consistency: A model for parallel programming. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 101-110, 1994
14. M. K. Aguilera, S. Toueg. A simple bivalency proof that t-resilient consensus requires t + 1 rounds. Inf. Process. Lett., 71(3-4): 155-158, Aug. 1999
15. M. Ahamad, R. A. Bazzi, R. John, P. Kohli, G. Neiger. The power of processor consistency. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 251-260, 1993
16. M. Ahamad, G. Neiger, J. E. Burns, P. Kohli, P. W. Hutto. Causal memory: definitions, implementation, and programming. Distributed Computing, 9(1): 37-49, 1995
17. N. Allenberg-Navony, A. Itai, S. Moran. Average and randomized complexity of distributed problems. SIAM J. Comput., 25(6): 1254-1267, Dec. 1996
18. R. Alur, H. Attiya, G. Taubenfeld. Time-adaptive algorithms for synchronization. SIAMJ. Comput., 26(2): 539-556, 1997
19. R. Alur, G. Taubenfeld. Contention-free complexity of shared memory algorithms. Information and Computation, 126(1): 62-73, Apr. 1996
20. E. S. Amdur, S. M. Weber, V. Hadzilacos. On the message complexity of binary Byzantine agreement under crash failures. Distributed Computing, 5(4): 175-186, Apr. 1992
21. J. Anderson, J.-H. Yang. Time/contention tradeoffs for multiprocessor synchronization. Information and Computation, 124(1): 68-84, Jan. 1996
22. J. H. Anderson. Composite registers. Distributed Computing, 6(3): 141-154, Apr. 1993
23. J. H. Anderson, Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 90-99, 2001
24. R. Anderson, H. Woll. Wait-free parallel algorithms for the union-find problem. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 370-380, 1991
25. R. Anderson, H. Woll. Algorithms for the certified write-all problem. SIAM J. Comput., 26(5): 1277-1283, 1997
26. D. Angluin. Local and global properties in networks of processors. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 82-93, 1980
27. E. Arjomandi, M. J. Fischer, N. A. Lynch. Efficiency of synchronous versus asynchronous distributed systems. J. ACM, 30(3): 449-56, July 1983
28. J. Aspnes. Time- and space-efficient randomized consensus. J. Algorithms, 14(3): 414-431, May 1993
29. J. Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. J. ACM, 45(3): 415-450, May 1998
30. J. Aspnes, M. Herlihy. Wait-free data structures in the asynchronous PRAM model. In Proc. 2nd ACM Symposium on Parallel Algorithms and Architectures, pages 340-349, 1990
31. J. Aspnes, W. Hurwood. Spreading rumors rapidly despite an adversary. J. Algorithms, 26(2): 386-411, Feb. 1998
32. 2 n) operations per processor. SIAMJ. Comput., 25(5): 1024-1044, Oct. 1996
33. C. Attiya, D. Dolev, J. Gil. Asynchronous Byzantine consensus. In Proceedings of the 3rd Annual ACM Symposium on Principles of Distributed Computing, pages 119-133, 1984
34. H. Attiya. A direct proof of the asynchronous lower bound for k-set consensus. Technical Report 0930, Computer Science Department, Technion, 1998. Available from www.cs.technion.ac.il/Reports
35. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, R. Reischuk. Renaming in an asynchronous environment. J. ACM, 37(3): 524-548, July 1990
36. H. Attiya, T. Djerassi-Shintel. Time bounds for decision problems in the presence of timing uncertainty and failures. Journal of Parallel and Distributed Computing, 61(18): 1096-1109,Aug. 2001
37. H. Attiya, C. Dwork, N. Lynch, L. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. J. ACM, 41(1): 122-152, Jan. 1994
38. H. Attiya, R. Friedman. A correctness condition for high-performance multiprocessors. SIAM J. Comput., 27(6): 1637-1670, Dec. 1998
39. H. Attiya, A. Gorbach, S. Moran. Computing in totally anonymous asynchronous shared memory systems. Information and Computation, 173(2): 162-183, Mar. 2002
40. H. Attiya, A. Herzberg, S. Rajsbaum. Optimal clock synchronization under different delay assumptions. SIAMJ. Comput., 25(2): 369-389, Apr. 1996
41. H. Attiya, N. Lynch, N. Shavit. Are wait-free algorithms fast? J. ACM, 41(4): 725-763, July 1994
42. H. Attiya, Y. Mansour. Language complexity on the synchronous anonymous ring. Theoretical Comput. Sci., 53(2-3): 169-185, 1987
43. H. Attiya, M. Mavronicolas. Efficiency of semisynchronous versus asynchronous networks. Mathematical Systems Theory, 27(6): 547-571, Nov./Dec. 1994
44. H. Attiya, S. Rajsbaum. The combinatorial structure of wait-free solvable tasks. SIAM J. Comput., 31(4): 1286-1313, 2002
45. H. Attiya, M. Snir. Better computing on the anonymous ring. J. Algorithms, 12(2): 204-238, June 1991
46. H. Attiya, M. Snir, M. K. Warmuth. Computing on an anonymous ring. J. ACM, 35(4): 845-875, Oct. 1988
47. H. Attiya, J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998
48. H. Attiya, J. L. Welch. Sequential consistency versus linearizability. ACM Trans. Comput. Syst., 12(2): 91-122, May 1994
49. Y. Aumann. Efficient asynchronous consensus with the weak adversary scheduler. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 209-218, 1997
50. B. Awerbuch. Communication-time trade-offs in network synchronization. In Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, pages 272-276, 1985
51. B. Awerbuch. Complexity of network synchronization. J. ACM, 32(4): 804-823, Oct. 1985
52. B. Awerbuch, A. Baratz, D. Peleg. Cost-sensitive analysis of communication protocols. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 177-188, 1990
53. B. Awerbuch, O. Goldreich, D. Peleg, R. Vainish. A trade-off between information and communication in broadcast protocols. J. ACM, 37(2): 238-256, Apr. 1990
54. Ö. Babaog̃lu, P. Stephenson, R. Drummond. Reliable broadcasts and communication models: tradeoffs and lower bounds. Distributed Computing, 2(4): 177-189, Aug. 1988
55. R. Bagrodia. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Transactions on Software Engineering, 15(9): 1053-1065, Sept. 1989
56. Z. Bar-Joseph, M. Ben-Or. A tight lower bound for randomized synchronous consensus. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 193-199, 1998
57. K. A. Bartlett, R. A. Scantlebury, P. T. Wilkinson. A note on reliable, full-duplex transmission over half-duplex links. Commun. ACM, 12(5): 260-261, May 1969
58. R. A. Bazzi, G. Neiger. Simplifying fault-tolerance: Providing the abstraction of crash failures. J. ACM, 48(3): 499-554, May 2001
59. Y. Ben-Asher, D. G. Feitelson, L. Rudolph. ParC - an extension of C for shared memory parallel processing. Software Practice and Experience, 26(5): 581-612, 1996
60. S. Biaz, J. L. Welch. Closed form bounds for clock synchronization under simple uncertainty assumptions. Inf. Process. Lett., 80(3): 151-157, Nov. 2001
61. O. Biran, S. Moran, S. Zaks. A combinatorial characterization of the distributed 1-solvable tasks. J. Algorithms, 11(3): 420-440, Sept. 1990
62. O. Biran, S. Moran, S. Zaks. Deciding 1-solvability of distributed task is NP-hard. In Graph-Theoretic Concepts in Computer Science. 16th International Workshop, volume 484 of LNCS, pages 206-220, 1990
63. O. Biran, S. Moran, S. Zaks. Tight bounds on the round complexity of distributed 1-solvable tasks. Theoretical Comput. Sci., 145(1-2): 271-290, July 1995
64. H. L. Bodlaender. New lower bound techniques for distributed leader finding and other problems on rings of processors. Theoretical Comput. Sci., 81(2): 237-256, Apr. 1991
65. H. L. Bodlaender, S. Moran, M. K. Warmuth. The distributed bit complexity of the ring: From the anonymous to the nonanonymous case. Information and Computation, 108(1): 34-50, Jan. 1994
66. P. Boldi, S. Vigna. Computing anonymously with arbitrary knowledge. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 181-188, 1999
67. P. Boldi, S. Vigna. An effective characterization of computability in anonymous networks. In Distributed Computing, 15th International Symposium, pages 33-47, 2001
68. E. Borowsky. Capturing the power of resiliency and set consensus in distributed systems. PhD thesis, University of California, Los Angeles, Oct. 1995
69. E. Borowsky, E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 91-100, 1993
70. E. Borowsky, E. Gafni. Immediate atomic snapshots and fast renaming. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 41-52, 1993]
71. E. Borowsky, E. Gafni. A simple algorithmically reasoned characterization of wait-free computations. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 189-198, 1997
72. E. Borowsky, E. Gafni, N. Lynch, S. Rajsbaum. The BG distributed simulation algorithm. Distributed Computing, 14(3): 127-146, July 2001
73. L. Bougé. On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes. Acta Inf., 25(2): 179-201, Feb. 1988
74. 2log n) operations. In Distributed Algorithms, 5th International Workshop, volume 579 of LNCS, pages 143-150, 1991
75. G. Bracha, S. Toueg. Asynchronous consensus and broadcast protocols. J. ACM, 32(4): 824-840, Oct. 1985
76. M. F. Bridgland, R. J. Watro. Fault-tolerant decision making in totally asynchronous distributed systems. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 52-63, 1987
77. J. Burns, N. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2): 171-184, Dec. 1993
78. J. E. Burns. A formal model for message passing systems. Technical Report 91, Indiana University Computer Science Department, 1980
79. J. E. Burns, P. Jackson, N. A. Lynch, M. J. Fischer, G. L. Peterson. Data requirements for implementation of n-process mutual exclusion using a single shared variable. J. ACM, 29(1): 183-205, Jan. 1982
80. J. E. Burns, G. L. Peterson. The ambiguity of choosing. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 145-157, 1989
81. J. F. Buss, P.C. Kanellakis, P. L. Ragde, A. A. Shvartsman, Parallel algorithms with processor failures and delays, J. Algorithms, 20(1): 45-86, Jan. 1996.
82. J. Cage. An autobiographical statement. Southwest Review, 76(1): 59, 1991. A description of advice from his father, an inventor
83. L. Carroll. Through the Looking Glass, and What Alice Found There, chapter IX. Macmillan, 1872
84. M. Castro, B. Liskov. Practical Byzantine fault tolerance. In Proceedings of the USENIX Symposium on Operating Systems Design and Implementation (OSDI '99), pages 173-186, 1999
85. r hierarchy is not robust. Manuscript, 1994
86. T. Chandra, V. Hadzilacos, P. Jayanti, S. Toueg. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 334-343, 1994
87. T. Chandra, V. Hadzilacos, S. Toueg, B. Charron-Bost. On the impossibility of group membership. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 322-330, 1996
88. T. Chandra, S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2): 225-267, Mar. 1996
89. T. D. Chandra, V. Hadzilacos, S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4): 685-722, July 1996
90. T. D. Chandra, P. Jayanti, K. Tan. A polylog time wait-free construction for closed objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 287-296, 1998
91. K. M. Chandy, J. Misra. Parallel Program Design. Addison-Wesley, 1988
92. S. Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1): 132-158, July 1993
93. S. Chaudhuri, M. Herlihy, N. A. Lynch, M. R. Tuttle. Tight bounds for k-set agreement. J. ACM, 47(5): 912-943, Sept. 2000
94. S, Chaudhuri, M. Herlihy, M. R. Tuttle. Wait-free implementations in message-passing systems. Theoretical Comput. Sci., 220(1): 211-245, June 1999
95. S. Chaudhuri, P. Reiners. Understanding the set consensus partial order using the Borowsky-Gafni simulation. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, 1996
96. S. Chaudhuri, J. L. Welch. Bounds on the costs of multivalued register implementations. SIAM J. Comput., 23(2): 335-354, Apr. 1994
97. G. V. Chockler, I. Keidar, R. Vitenberg. Group communication specifications: A comprehensive study. ACM Computing Surveys, 33(4): 427-469, Dec. 2001
98. B. Chor, A. Israeli, M. Li. On processor coordination using asynchronous hardware. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, pages 86-97, 1987
99. B. Chor, M. Merritt, D. B. Shmoys. Simple constant-time consensus protocols in realistic failure models. J. ACM, 36(3): 591-614, July 1989
100. B. Chor, L. Moscovici. Solvability in asynchronous environments. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 422-427, 1989
101. B. Chor, L.-B. Nelson. Solvability in asynchronous environments II: Finite interactive tasks. SIAM J. Comput., 29(2): 351-377, Apr. 2000
102. I. Cidon, Y. Shavitt. Message terminating algorithms for anonymous rings of unknown size, Inf. Process. Lett., 54(2): 111-119, Apr. 1995
103. B. A. Coan, D. Dolev, C. Dwork, L. Stockmeyer. The distributed firing squad problem. SIAM J. Comput., 18(5): 990-1012, Oct. 1989
104. B. A. Coan, C. Dwork. Simultaneity is harder than agreement. Information and Computation, 91(2): 205-231, Apr. 1991
105. B. A. Coan, J. L. Welch. Transaction commit in arealistic timing model. Distributed Computing, 4(2): 87-103, June 1990
106. S. Cook, C. Dwork, R. Reischuk. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM J. Comput., 15(1): 87-97, Feb. 1986
107. R. Cori, S. Moran. Exotic behaviour of consensus numbers. In Distributed Algorithms, 8th International Workshop, volume 857 of LNCS, pages 101-115, 1994
108. A. Cremers, T. N. Hibbard. An algebraic approach to concurrent programming control and related complexity problems. In Algorithms and Complexity: New Directions and Recent Results, page 446, New York, 1976. Academic Press. Abstract only
109. R. De Prisco, D. Malkhi, M. K. Reiter. On k-set consensus in asynchronous systems. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 257-265, 1999
110. R. A. DeMillo, N. A. Lynch, M. J. Merritt. Cryptographic protocols. In Proceedings of the 14th ACM Symposium on Theory of Computing, pages 383-400, 1982
111. E. W. Dijkstra. Solution of a problem in concurrent programming control. Commun. ACM, 8(9): 569, Sept. 1965
112. E. W. Dijkstra. Hierarchical ordering of sequential processes. Acta Inf., 1(2): 115-138, 1971
113. D. Dolev. The Byzantine generals strike again. J. Algorithms, 3(1): 14-30, Mar. 1982
114. D. Dolev, C. Dwork, L. Stockmeyer. On the minimal synchronism needed for distributed consensus. J. ACM, 34(1): 77-97, Jan. 1987
115. D. Dolev, J. Y. Halpern, H. R. Strong. On the possibility and impossibility of achieving clock synchronization. J. Comput. Syst. Sci., 32(2): 230-250, Apr. 1986
116. D. Dolev, M. Klawe, M. Rodeh. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. J. Algorithms, 3: 245-260, 1982
117. D. Dolev, N. A. Lynch, S. S. Pinter, E. W. Stark, W. E. Weihl. Reaching approximate agreement in the presence of faults. J. ACM, 33(3): 499-516, July 1986
118. D. Dolev, R. Reischuk. Bounds on information exchange for Byzantine agreement. J. ACM, 32(1): 191-204, Jan. 1985
119. D. Dolev, R. Reischuk, H. R. Strong. Early stopping in Byzantine agreement. J. ACM, 37(4): 720-741, 1990
120. D. Dolev, H. R. Strong. Authenticated algorithms for Byzantine agreement. SIAM J. Comput., 12(4): 656-666, Nov. 1983
121. S. Dolev. Self-stabilization. MIT Press, 2000
122. S. Dolev, J. Welch. Crash resilient communication in dynamic networks. IEEE Transactions on Computers, 46(1): 14-26, Jan. 1997
123. P. Duris, Z. Galil. Two lower bounds in asynchronous distributed computation. J. Comput. Syst. Sci., 42(3): 254-266, June 1991
124. C. Dwork, M. Herlihy, O. Waarts. Contention in shared memory algorithms. J. ACM, 44(6): 779-805, Nov. 1997
125. C. Dwork, N. Lynch, L. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2): 288-323, Apr. 1988
126. C. Dwork, Y. Moses. Knowledge and common knowledge in a Byzantine environment: Crash failures. Information and Computation, 88(2): 156-186, Oct. 1990
127. C. Dwork, D. Skeen. The inherent cost of nonblocking commitment. In Proceedings of the 2nd Annual ACM Symposium on Principles of Distributed Computing, pages 1-11, 1983
128. P. Fatourou, F. Fich, E. Ruppert. Space-optimal multi-writer snapshot objects are slow. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing, pages 13-20, 2002
129. P. Fatourou, F. Fich, E. Ruppert. A tight time lower bound for space-optimal implementations of multi-writer snapshots. In Proceedings of the 35th ACM Symposium on Theory of Computing, 2003. To appear
130. A. Fekete, N. Lynch. The need for headers: An impossibility result for communication over unreliable channels. In CONCUR'90 Theories of Concurrency: Unification and Extensions, volume 458 of LNCS, pages 199-215, 1990
131. A. Fekete, N. Lynch, Y. Mansour, J. Spinelli. The impossibility of implementing reliable communication in the face of crashes. J. ACM, 40(5): 1087-1107, Nov. 1993
132. A. D. Fekete. Asymptotically optimal algorithms for approximate agreement. Distributed Computing, 4(1): 9-29, Jan. 1990
133. A. D. Fekete. Asynchronous approximate agreement. Information and Computation, 115(1): 95-124, Nov. 1994
134. P. Feldman, S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput., 26(4): 873-933, Aug. 1997
135. C. Fetzer, F. Cristian. Lower bounds for convergence function based clock synchronization. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 137-143, 1995
136. F. Fich, M. Herlihy, N. Shavit. On the space complexity of randomized synchronization. J. ACM, 45(5): 843-862, Sept. 1998
137. F. Fich, E. Ruppert. Lower bounds in distributed computing. In Distributed Computing, 14th International Symposium, volume 1914 of LNCS, pages 1-28, 2000
138. M. J. Fischer. The consensus problem in unreliable distributed systems, In Proc. International Conference on Foundations of Computation Theory, pages 127-140, 1983. Also available as Yale Technical Report, Department of Computer Science, YALEU/DCS/RR-273, June 1983
139. M. J. Fischer. The consensus problem in unreliable distributed systems, In Proc. International Conference on Foundations of Computation Theory, pages 127-140, 1983. Also available as Yale Technical Report, Department of Computer Science, YALEU/DCS/RR-273, June 1983
140. M. J. Fischer, N. A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Process. Lett., 14(4): 183-186, June 1982
141. M. J. Fischer, N. A. Lynch, M. Merritt. Easy impossibility proofs for distributed consensus problems. Distributed Comparing 1(1): 26-39, Jan. 1986
142. M. J. Fischer, N. A. Lynch, M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2): 374-382, Apr. 1985
143. M. J. Fischer, S. Moran, S. Rudich, G. Taubenfeld. Thewakeup problem. SIAM J. Comput., 25(6): 1332-1357, 1996
144. G. N. Frederickson, N. A. Lynch. Electing a leader in a synchronous ring. J. ACM, 34(1): 98-115, Jan. 1987
145. R. Friedman. Implementing hybrid consistency with high-level synchronization operations. Distributed Computing, 9(3): 119-129, Dec. 1995
146. E. Gafni. Distributed computing. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 48. CRC Press, 1998
147. E. Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 143-152, 1998
148. E. Gafni, E. Koutsoupias. Three-processor tasks are undecidable. SIAM J. Comput., 28(3): 970-983, Jan. 1999
149. J. A. Garay, K. J. Perry. A continuum of failure models for distributed computing. In Distributed Algorithms, 6th International Workshop, volume 647 of LNCS, pages 153-165, 1992
150. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, J. Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proc. 17th Annual International Symposium on Computer Architecture, pages 15-26, 1990. Proceedings published in Computer Architecture News, 18(2)
151. O. Goldreich. Cryptography and cryptographic protocols. Distributed Computing, in this issue
152. O. Goldreich, D. Sneh. On the complexity of global computation in the presence of link failures: The case of uni-directional faults. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 103-111, 1992
153. E. Goubault, T. P. Jensen. Homology of higher dimensional automata. In Proc. 3rd International Conference on Concurrency Theory, volume 630 of LNCS, pages 254-268, 1992
154. R. L. Graham, A. C. Yao. On the improbability of reaching Byzantine agreements. In Proceedings of the 21st ACM Symposium on Theory of Computing, pages 467-478, 1989
155. J. N. Gray. Notes on data base operating systems. In Operating Systems: An Advanced Course, pages 393-481. Springer-Verlag, 1979
156. D. S. Greenberg, G. Taubenfeld, D.-W. Wang. Choice coordination with multiple alternatives. In Distributed Algorithms, 6th International Workshop, volume 647 of LNCS, pages 54-68, 1992
157. J. F. Groote, W. Hesselink, S. Mauw, R. Vermeulen. An algorithm for the asynchronous write-all problem based on process collision. Distributed Computing, 14(2): 75-81, Apr. 2001
158. J. Gunawardena. Homotopy, concurrency. Bulletin of the EATCS, 54: 184-193, Oct. 1994
159. R. Gupta, S. A. Smolka, S. Bhaskar. On randomization in sequential and distributed algorithms. ACM Computing Surveys, 26(1): 7-86, Mar. 1994
160. V. Hadzilacos. A lower bound for Byzantine agreement with fail-stop processors. Technical Report 21-83, Harvard University, July 1983
161. V. Hadzilacos. Connectivity requirements for Byzantine agreement under restricted types of failures. Distributed Computing, 2(2): 95-103, Aug. 1987
162. V. Hadzilacos. A knowledge theoretic analysis of atomic commitment protocols. In Proceedings of the 6th ACM Symposium on Principles of Database Systems, pages 129-134, 1987
163. V. Hadzilacos, J. Y. Halpern. Message-optimal protocols for Byzantine agreement. Mathematical Systems Theory, 26(1): 41-102, 1993
164. V. Hadzilacos, S. Toueg. A modular approach to fault-tolerant broadcasts and related problems. Technical Report TR94-1425, Cornell University, May 1994
165. S. Haldar, K. Vidyasankar. Simple extensions of 1 -writer atomic variable constructions to multiwriter ones. Acta Informatica, 33(2): 177-202, 1996
166. J. Y. Halpern, N. Megiddo, A. A. Munshi. Optimal precision in the presence of uncertainty. Journal of Complexity, 1(2): 170-196, Dec. 1985
167. J. Y. Halpern, Y. Moses. Knowledge and common knowledge in a distributed environment. J. ACM, 37(3): 549-587, July 1990
168. J. Havlicek. Computable obstructions to wait-free computability. Distributed Computing, 13(2): 59-83, 2000
169. M. Herlihy. Impossibility results for asynchronous PRAM. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 327-336, 1991
170. M. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1): 124-149, Jan. 1991
171. M. Herlihy. A methodology for implementing highly concurrent data objects. ACM Trans. Prag. Lang. Syst., 15(5): 745-770, Nov. 1993
172. M. Herlihy, S. Rajsbaum. Set consensus using arbitrary objects. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 324-333, 1994
173. M. Herlihy, S. Rajsbaum. Algebraic spans. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 90-99, 1995
174. M. Herlihy, S. Rajsbaum. Algebraic topology and distributed computing: A primer. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000 of LNCS, pages 203-217. Springer, 1995
175. M. Herlihy, S. Rajsbaum. The decidability of distributed decision tasks. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 589-598, 1997. Full version available from www.cs.brown.edu/people/mph/decide.html
176. M. Herlihy, S. Rajsbaum. A wait-free classification of loop agreement tasks. In Distributed Computing, 12th International Symposium, volume 1499 of LNCS, pages 175-185, 1998
177. M. Herlihy, S. Rajsbaum. New perspectives in distributed computing. In Mathematical Foundations of Computer Science: 24th International Symposium, volume 1672 of LNCS, pages 170-186, 1999
178. M. Herlihy, S. Rajsbaum, M. R. Tuttle. Unifying synchronous and asynchronous message-passing models. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 133-142, 1998. Full version available from www.cs.brown.edu/people/mph/hrt.html
179. M. Herlihy, E. Ruppert. On the existence of booster types. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 653-663, 2000
180. M. Herlihy, N. Shavit. The topological structure of asynchronous computability. J. ACM, 46(6): 858-923, Nov. 1999
181. M. Herlihy, N. Shavit, O. Waarts. Linearizable counting networks. Distributed Computing, 9(4): 193-203, 1996
182. M. P. Herlihy, J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Prog. Lang. Syst., 12(3): 463-492, July 1990
183. L. Higham, J. Kawash. Bounds for mutual exclusion with only processor consistency. In Distributed Computing, 14th International Symposium, volume 1914 of LNCS, pages 44-58, 2000
184. L. Higham, J. Kawash, N. Verwaal. Defining and comparing memory consistency models. In Proc. of the 10th International Conference on Parallel and Distributed Computing Systems, pages 349-356, 1997
185. L. Higham, T. Przytycka. Asymptotically optimal election on weighted rings. SIAM J. Comput., 28(2): 720-732, 1998
186. G. Hoest, N. Shavit. Towards a topological characterization of asynchronous complexity. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, pages 199-208, 1997
187. P. W. Hutto, M. Ahamad. Slow memory: Weakening consistency to enhance concurrency in distributed shared memories. In The 10th International Conference on Distributed Computing Systems, pages 302-309, 1990
188. M. Inoue, S. Moriya, T. Masuzawa, H. Fujiwara. Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system. In Distributed Algorithms, llth International Workshop, volume 1320 of LNCS, pages 290-304, 1997
189. A. Israeli, A. Shirazi. The time complexity of updating snapshot memories. Inf. Process. Lett., 65(1): 33-40, Jan. 1998
190. A. Itai, M. Rodeh. Symmetry breaking in distributed networks. Information and Computation, 88(1): 60-87, 1990
191. J. James, A. K. Singh. Fault tolerance bounds for memory consistency. In Distributed Algorithms, llth International Workshop, volume 1320 of LNCS, pages 200-214, 1997
192. P. Jayanti. Wait-free computing. In Distributed Algorithms, 9th International Workshop, volume 972 of LNCS, pages 19-50, 1995
193. P. Jayanti. Robust wait-free hierarchies. J. ACM, 44(4): 592-614, July 1997
194. P. Jayanti. A lower bound on the local time complexity of universal constructions. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 183-192, 1998
195. P. Jayanti. Solvability of consensus: Composition breaks down for nondeterministic types. SIAM J. Comput., 28(3): 782-797, Sept. 1998
196. P. Jayanti. A time complexity lower bound for randomized implementations of some shared objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 201-210, 1998
197. P. Jayanti, T. D. Chandra, S. Toueg. Fault-tolerant wait-free shared objects. J. ACM, 45(3): 451-500, 1998
198. P. Jayanti, A. S. Sethi, E. L. Lloyd. Minimal shared information for concurrent reading and writing. In Distributed Algorithms, 5th International Workshop, volume 579 of LNCS, pages 212-228, 1991
199. P. Jayanti, K. Tan, S. Toueg. Time and space lower bounds for nonblocking implementations. SIAM J. Comput., 30(2): 438-456, 2000
200. P. Jayanti, S. Toueg. Wakeup under read/write atomicity, In Distributed Algorithms, 4th International Workshop, volume 486 of LNCS, pages 277-288, 1990
201. P. Jayanti, S. Toueg. Some results on the impossibility, universality and decidability of consensus. In Distributed Algorithms, 6th International Workshop, volume 647 of LNCS, pages 69-84, 1992
202. M. Jayaram, G. Varghese. Crash failures can drive protocols to arbitrary states. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, pages 247-256, 1996
203. R. E. Johnson, F. B. Schneider. Symmetry and similarity in distributed systems. In Proceedings of the 4th Annual ACM Symposium on Principles of Distributed Computing, pages 13-22, 1985
204. Y.-J. Joung. Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability. Theoretical Comput. Sci., 243(1-2): 307-338, July 2000
205. C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson, A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 285-296, 1990
206. P. C. Kanellakis, A. A. Shvartsman. Efficient parallel algorithms can be made robust. Distributed Computing, 5(4): 201-217, Apr. 1992
207. P. C. Kanellakis, A. A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic Publishers, Boston, 1997
208. Z. Kedem, K. Palem, A. Raghunathan, P. Spirakis. Combining tentative and definite executions for very fast dependable computing. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 381-390, 1991
209. J. M. Kleinberg, S. Mullainathan. Resource bounds and combinations of consensus objects. In Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pages 133-144, 1993
210. R. Koo, S. Toueg. Effects of message loss on the termination of distributed protocols. Inf. Process. Lett., 27(4): 181-188, Apr. 1988
211. E. Korach, S. Moran, S. Zaks. The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM J. Cornput., 16(2): 231-236, Apr. 1987
212. E. Korach, S. Moran, S. Zaks. Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoretical Comput. Sci., 64(1): 125-132, Apr. 1989
213. M. J. Kosa. Time bounds for strong and hybrid consistency for arbitrary abstract data types. Chicago Journal of Theoretical Computer Science, Aug. 1999. Available from cjtcs. cs. uchicago. edu
214. C. P. Kruskal, L. Rudolph, M. Snir. Efficient synchronization on multiprocessors with shared memory. ACM Trans. Prog. Lang. Syst., 10(4): 579-601, Oct. 1988
215. E. Kushilevitz, Y. Mansour, M. O. Rabin, D. Zuckerman. Lower bounds for randomized mutual exclusion. SIAM J. Comput., 27(6): 1550-1563, Dec. 1998
216. R. E. Ladner, A. LaMarca, E. Tempero. Counting protocols for reliable end-to-end transmission. J. Comput. Syst. Sci., 56(1): 96-111, Feb. 1998
217. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Commun. ACM, 17(8): 453-455, Aug. 1974
218. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocessor programs. IEEE Transactions on Computers, C-28(9): 690-691, Sept. 1979
219. L. Lamport. The weak Byzantine generals problem. J. ACM, 30(3): 668-676, July 1983
220. L. Lamport. The mutual exclusion problem. Part II: Statement and solutions. J. ACM, 33(2): 327-348, Apr. 1986
221. L. Lamport. On interprocess communication, part II: Algorithms. Distributed Computing, 1(2): 86-101, Apr. 1986
222. L. Lamport. A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, 5(1): 1-11, Feb. 1987
223. L. Lamport, M. Fischer. Byzantine generals and transaction commit protocols. Technical Report 62, SRI International, Menlo Park, Apr. 1982
224. L. Lamport, N. Lynch. Distributed computing: Models and methods. In Handbook of Theoretical Computer Science, volume B, chapter 18. Elsevier, 1990
225. L. Lamport, P. M. Melliar-Smith. Synchronizing clocks in the presence of faults. J. ACM, 32(1): 52-78, 1985
226. L. Lamport, R. Shostak, M. Pease. The Byzantine generals problem. ACM Trans. Prog. Lang. Syst., 4(3): 382-401, July 1982
227. W.-K. Lo. More on t-resilience vs. wait-freedom. In Proceedings of the 14th Annual ACM Symposium on Principles of Distributed Computing, pages 110-119, 1995
228. W.-K. Lo, V. Hadzilacos. All of us are smarter than any of us: Nondeterministic wait-free hierarchies are not robust. SIAM J. Comput., 30(3): 689-728, 2000
229. W.-K. Lo, V. Hadzilacos. On the power of shared object types to implement one-resilient consensus. Distributed Computing, 13(4): 219-238, 2000
230. Z. Lotker, B. Patt-Shamir, D. Peleg. Distributed MST for constant diameter graphs. In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 63-71, 2001
231. M. C. Loui, H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. In P. P. Preparata, editor, Advances in Computing Research, volume 4, pages 163-183. JAI Press, Greenwich, Connecticut, 1987
232. R. Lubitch, S. Moran. Closed schedulers: A novel technique for analyzing asynchronous protocols. Distributed Computing, 8(4): 203-210, 1995
233. J. Lundelius, N. Lynch. An upper and lower bound for clock synchronization. Information and Control, 62(2/3): 190-204, Aug./Sept. 1984
234. N. A. Lynch. A hundred impossibility proofs for distributed computing. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 1-27, 1989
235. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996
236. N. A. Lynch, M. J. Fischer. On describing the behavior and implementation of distributed systems. Theoretical Comput. Sci., 13(1): 17-43, Jan. 1981
237. D. Malkhi, M. Merritt, M. Reiter, G. Taubenfeld. Objects shared by Byzantine processes. In Distributed Computing, 14th International Symposium, volume 1914 of LNCS, pages 345-359, 2000
238. Y. Mansour, B. Schieber. The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels. J. ACM, 39(4): 783-799, Oct. 1992
239. Y. Mansour, S. Zaks. On the bit complexity of distributed computations in a ring with a leader. Information and Computation, 75(2): 162-177, Nov. 1987
240. C. Martel, R. Subramonian. On the complexity of certified write-all algorithms. J. Algorithms, 16: 361-387, 1994
241. M. Mavronicolas, D. Roth. Linearizable read/write objects. Theoretical Comput. Sci., 220(1): 267-319, June 1999
242. M. Merritt, O. Reingold, G. Taubenfeld, R. Wright. Tight bounds for shared memory systems accessed by Byzantine processes. In Distributed Computing, 16th International Symposium, pages 222-236, 2002
243. M. Merritt, G. Taubenfeld. Atomic m-register operations. Distributed Computing, 7(4): 213-221, May 1994
244. M. Merritt, G. Taubenfeld. Fairness of shared objects. In Distributed Computing, 12th International Symposium, volume 1499 of LNCS, pages 303-316, 1998
245. L. Mies van der Rohe. On restraint in design. New York Herald Tribune, 28 June 1959
246. r. In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS, pages 344-361, 1996
247. S. Moran, G. Taubenfeld. A lower bound on wait-free counting. J. Algorithms, 24(1): 1-19, July 1997
248. S. Moran, G. Taubenfeld, I. Yadin. Concurrent counting. J. Comput. Syst. Sci., 53(1): 61-78, Aug. 1996
249. S. Moran, M. K. Warmuth. Gap theorems for distributed computation. SIAM J. Comput., 22(2): 379-394, Apr. 1993
250. S. Moran, Y Wolfstahl. Extended impossibility results for asynchronous complete networks. Inf. Process. Lett., 26(3): 145-151, Nov. 1987
251. Y. Moses, S. Rajsbaum. A layered analysis of consensus. SIAM J. Comput., 31(4): 989-1021, 2002
252. Y. Moses, M. R. Turtle. Programming simultaneous actions using common knowledge. Algorithmica, 3(1): 121-169, 1988
253. A. Mostefaoui, S. Rajsbaum, M. Raynal. Conditions on input vectors for consensus solvability in asynchronous distributed systems. In Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 153-162, 2001
254. M. Naor, L. Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6): 1259-1277, 1995
255. G. Neiger. Distributed consensus revisited. Inf. Process. Lett., 49: 195-201, Feb. 1994
256. G. Neiger. Set-linearizability. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, page 396, 1994
257. G. Neiger, S. Toueg. Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms, 11(3): 374-419, Sept. 1990
258. N. Nishimura. A model for asynchronous shared memory parallel computation. SIAM J. Comput., 23(6): 1231-1252, 1994
259. J. K. Pachl. A lower bound for probabilistic distributed algorithms. J. Algorithms, 8(1): 53-65, Mar. 1987
260. B. Patt-Shamir, S. Rajsbaum. A theory of clock synchronization. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 810-819, 1994
261. M. Pease, R. Shostak, L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2): 228-234, Apr. 1980
262. D. Peleg, V. Rubinovich. A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction. SIAM J. Comput., 30(5): 1427-1442, 2000
263. G. L. Peterson. An O (n log n) unidirectional algorithm for the circular extrema problem. ACM Trans. Prog. Lang. Syst., 4(4): 758-762, Oct. 1982
264. G. L. Peterson. Properties of a family of booster types. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, page 281, 1999
265. R. Plunkett, A. Fekete. Approximate agreement with mixed mode faults: Algorithm and lower bound. In Distributed Computing, 12th International Symposium, volume 1499 of LNCS, pages 333-346, 1998
266. M. O. Rabin. The choice coordination problem. Acta Inf., 17(2): 121-134, June 1982
267. M. O. Rabin, D. Lehmann. The advantages of free choice: A symmetric and fully distributed solution for the dining philosophers problem. In A. W. Roscoe, editor, A Classical Mind; Essays in Honour of C. A. R. Hoare, chapter 20. Prentice Hall, 1994
268. O. Rachman. Anomalies in the wait-free hierarchy. In Distributed Algorithms, 8th International Workshop, volume 857 of LNCS, pages 156-163, 1994
269. G. M. Reed, A. W. Roscoe, R. F. Wachter, editors. Topology and Category Theory in Computer Science. Clarendon Press, Oxford, 1991
270. J. H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufmann, San Mateo, California, 1993
271. R. Reischuk, M. Koshors. Lower bounds for synchronous networks and the advantage of local information. In Distributed Algorithms, 2nd International Workshop, volume 312 of LNCS, pages 374-387, 1987
272. I. Rhee, J. L. Welch, The impact of time on the session problem. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 191-202, 1992
273. P. Rosenstiehl, J. R. Fiksel, A. Holliger. Intelligent graphs: Networks of finite automata capable of solving graph problems. In R. C. Read, editor, Graph Theory and Computing, pages 219-265. Academic Press, New York, 1972
274. E. Ruppert. Consensus numbers of multi-objects. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, pages 211-217, 1998
275. E. Ruppert. Determining consensus numbers. SIAM J. Comput., 30(4): 1156-1168, 2000
276. J. Rushby. Systematic formal verification for fault-tolerant time-triggered algorithms. IEEE Transactions on Software Engineering, 25(5): 651-650, 1999
277. A. Russell, M. Saks, D. Zuckerman. Lower bounds for leader election and collective coin-flipping in the perfect information model. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 339-347, 1999
278. N. Sakamoto. Comparison of initial conditions for distributed algorithms on anonymous networks. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pages 173-179, 1999
279. M. Saks, F. Zaharoglou. Optimal space distributed order-preserving lists. J. Algorithms, 31(2): 320-334, May 1999. The lower bound in this paper is joint work with R. Cori
280. M. Saks, F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SIAM J. Comput., 29(5): 1449-1483, Mar. 2000
281. N. Santoro, P. Widmayer. Time is not a healer. In 6th Annual Symposium on Theoretical Aspects of Computer Science, volume 349 of LNCS, pages 304-313, 1989
282. E. Schenk. Faster approximate agreement with multi-writer registers. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 714-723, 1995
283. E. Schenk. Computability and Complexity Results for Agreement Problems in Shared Memory Distributed Systems. PhD thesis, Department of Computer Science, University of Toronto, Sept. 1996
284. E. Schenk. The consensus hierarchy is not robust. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, page 279, 1997
285. A. Segall, O. Wolfson. Transaction commitment at minimal communication cost. In Proceedings of the 6th ACM Symposium on Principles of Database Systems, pages 112-118, 1987
286. B. Simons, J. L. Welch, N. Lynch. An overview of clock synchronization. In Fault-Tolerant Distributed Computing, volume 448 of LNCS, pages 84-96, 1990
287. G. Singh. Leader election in complete networks. In Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, pages 179-190, 1992
288. E. Sperner. Neuer Beweis für die Invarianz der Dimension szahl und des Gebietes. Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universität, 6(3/4): 265-272, Sept. 1928
289. T. K. Srikanth, S. Toueg. Optimal clock synchronization. Journal of the ACM, 34(3): 626-645, July 1987
290. M. Stenning. A data transfer protocol. Computer Net., 1: 99-110, 1976
291. F. Stomp, G. Taubenfeld. Constructing a reliable test&set bit. IEEE Transactions on Parallel and Distributed Systems, 10(3): 252-265, Mar. 1999
292. G. Taubenfeld, S. Katz, S. Moran. Initial failures in distributed computations. International Journal of Parallel Programming, 18(4): 255-276, Aug. 1989
293. G. Taubenfeld, S. Moran. Possibility and impossibility results in a shared memory environment. Acta Inf., 33(1): 1-20, Feb. 1996
294. J. Valois. Space bounds for transactional synchronization. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, page 243, 1996
295. D. Wang, L. Zuck. Tight bounds for the sequence transmission problem. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing, pages 73-83, 1989
296. R. Wattenhofer, P. Widmayer. An inherent bottleneck in distributed counting. Journal of Parallel and Distributed Computing, 49(1): 135-145, Feb. 1998
297. J. L. Welch. Simulating synchronous processors. Information and Computation, 74(2): 159-171, Aug. 1987
298. J. L. Welch, N. Lynch. A new fault-tolerant algorithm for clock synchronization. Information and Computation, 77(1): 1-36, 1988
299. M. Yaraashita, T. Kameda. Computing functions on asynchronous anonymous networks. Mathematical Systems Theory, 29(4): 331-356, July/Aug. 1996. See Erratum in Theory of Computing Systems, 31(1): 109, 1998
300. A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 222-227, 1977