{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:38Z","timestamp":1759638578855,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:56:44Z","timestamp":1330235804000},"page":"85-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Wait-free test-and-set"],"prefix":"10.1007","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]},{"given":"John","family":"Tromp","sequence":"additional","affiliation":[]},{"given":"Paul M. B.","family":"Vitanyi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson. On achieving consensus using a shared memory. In Proc. of the 7th ACM Symp. on Principles of Distributed Computing, pages 291\u2013302, 1988.","DOI":"10.1145\/62546.62594"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Hagit Attiya, Danny Dolev, and Nir Shavit. Bounded polynomial randomized consensus. Extended Abstract, January 1989.","DOI":"10.21236\/ADA213808"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, pages 281\u2013294, September 1990.","DOI":"10.1016\/0196-6774(90)90021-6"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"J. Aspnes. Time and space efficient randomized consensus. In Proc. of the Ninth ACM Symp. on Principles of Distributed Computing, pages 325\u2013331, August 1990.","DOI":"10.1145\/93385.93433"},{"key":"6_CR5","unstructured":"G. Bracha and O. Rachman. Randomized consensus in expected o(n2logn) operations. In Proceedings of the 4th International Workshop on Distributed Algorithms, October 1991."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy. Impossibility and universality results for wait-free synchronization. In Proc. of the Seventh ACM Symp. on Principles of Distributed Computing, pages 291\u2013302, 1988.","DOI":"10.1145\/62546.62593"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"M. P. Herlihy. Randomized wait-free concurrent objects. In Proc. of the Tenth ACM Symp. on Principles of Distributed Computing, pages 11\u201322, 1991.","DOI":"10.1145\/112600.112602"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Li. Bounded time stamps. In Proc. of the 28th IEEE Annual Symp. on Foundation of Computer Science, pages 362\u2013371, October 1987.","DOI":"10.1109\/SFCS.1987.10"},{"key":"6_CR9","first-page":"163","volume":"4","author":"M. C. Loui","year":"1987","unstructured":"M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, JAI Press, 4:163\u2013183, 1987.","journal-title":"Advances in Computing Research, JAI Press"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport. On interprocess communication, parts i and ii. Distributed Computing, 1:77\u2013101, 1986.","journal-title":"Distributed Computing"},{"key":"6_CR11","volume-title":"Technical Report CS-8916","author":"M. Li","year":"1989","unstructured":"M. Li, J. Tromp, and P. M. B. Vit\u00e1nyi. How to construct concurrent wait-free variables. Technical Report CS-8916, CWI, Amsterdam, April 1989. See also: pp. 488\u2013505 in: Proc. International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 372, Springer Verlag, 1989."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"G. L. Peterson and M. J. Fischer. Economical solutions for the critical section problem in a distributed system. In Proc. 9th ACM Symp. on Theory of Computing, pages 91\u201397, 1977.","DOI":"10.1145\/800105.803398"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"S. A. Plotkin. Chapter 4: Sticky Bits and Universality of Consensus. PhD thesis, M.I.T., August 1988.","DOI":"10.1145\/72981.72992"},{"key":"6_CR14","unstructured":"M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensusmaking resilient algorithms fast in practice. In Proc. of SODA 90, December 1990."},{"key":"6_CR15","unstructured":"J. Tromp and P. M. B. Vit\u00e1nyi. Randomized wait-free test-and-set. Manuscript, November 1990."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:12:28Z","timestamp":1578510748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_6"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"4 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}