{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:03:51Z","timestamp":1794337431314,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540649175","type":"print"},{"value":"9783540683117","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0029567","type":"book-chapter","created":{"date-parts":[[2005,12,6]],"date-time":"2005-12-06T09:47:06Z","timestamp":1133862426000},"page":"118-146","source":"Crossref","is-referenced-by-count":1,"title":["Competitive analysis of distributed algorithms"],"prefix":"10.1007","author":[{"given":"James","family":"Aspnes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,11,22]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the Seventh ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 291\u2013302, August 1988.","DOI":"10.1145\/62546.62594"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts. A theory of competitive analysis for distributed algorithms. In Proc. 35th Symp. of Foundations of Computer Science, pages 401\u2013411, 1994.","DOI":"10.1109\/SFCS.1994.365676"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"R. Anderson and H. Woll. Wait-free parallel algorithms for the union-find problem. In Proc. 23rd ACM Symposium on Theory of Computing, pages 370\u2013380, 1991.","DOI":"10.1145\/103418.103458"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"J. Aspnes and W. Hurwood. Spreading rumors rapidly despite an adversary. In Proc. 15th ACM Symposium on Principles of Distributed Computing, pages 143\u2013151, 1996.","DOI":"10.1145\/248052.248077"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"J. Aspnes and O. Waarts. Modular competitiveness for distributed algorithms. In Proc. 28th ACM Symposium on the Theory of Computing, pages 237\u2013246, 1996.","DOI":"10.1145\/237814.237869"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"H. Attiya and O. Rachman. Atomic snapshots in o(n log n) operations. In Proc. 12th ACM Symposium on Principles of Distributed Computing, pages 29\u201340, 1993.","DOI":"10.1145\/164051.164055"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Y. Aumann. Efficient asynchronous consensus with the weak adversary scheduler. In Proc. 16th ACM Symposium on Principles of Distributed Computing, 1997.","DOI":"10.1145\/259380.259441"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Y. Aumann and M.A. Bender. Efficient asynchronous consensus with the valueoblivious adversary scheduler. In Proc. 23rd International Colloquium on Automata, Languages, and Programming, 1996.","DOI":"10.1007\/3-540-61440-0_164"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Widgerson. On the power of randomization in on-line algorithms. In Proc. 22nd Symposium on Theory of Algorithms, pages 379\u2013386, 1990.","DOI":"10.1145\/100216.100268"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"T. Chandra. Polylog randomized wait-free consensus. In Proc. 15th ACM Symposium on Principles of Distributed Computing, 1996.","DOI":"10.1145\/248052.248083"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/S0097539790192635","volume":"23","author":"B. Chor","year":"1994","unstructured":"B. Chor, A. Israeli, and M. Li. Wait-free consensus using asynchronous hardware. SIAM J. Comput., 23(4):701\u2013712, August 1994. Preliminary version appears in Proceedings of the 6th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 86\u201397, 1987.","journal-title":"SIAM J. Comput."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien. On the number of rounds needed to disseminate information. In Proc. 1st ACM Symposium on Parallel Algorithms and Architectures, 1989.","DOI":"10.1145\/72935.72969"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124\u2013149, January 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"E. Koutsoupias and C. Papadimitriou. Beyond competitive analysis. In Proc. 25th Symposium on Foundations of Computer Science, pages 394\u2013400, 1994.","DOI":"10.1109\/SFCS.1994.365677"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"B. Patt-Shamir and S. Rajsbaum. A theory of clock synchronization. In Proc. 26th ACM Symposium on the Theory of Computing, pages 810\u2013819, 1994.","DOI":"10.1145\/195058.195466"},{"key":"6_CR16","unstructured":"M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus \u2014 making resilient algorithms fast in practice. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pages 351\u2013362, 1991."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28:202\u2013208, 1985.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T07:17:25Z","timestamp":1586589445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649175","9783540683117"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0029567","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0029561","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}