{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:58Z","timestamp":1725456238488},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627814"},{"type":"electronic","value":"9783540685173"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997]]},"DOI":"10.1007\/bfb0030599","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:10:41Z","timestamp":1133399441000},"page":"225-236","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal implementation of wait-free binary relations"],"prefix":"10.1007","author":[{"given":"Eric","family":"Goubault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"18_CR1","volume-title":"Technical report","author":"E. Borowsky","year":"1995","unstructured":"E. Borowsky. Capturing the power of resiliency and set consensus in distributed systems. Technical report, University of California in Los Angeles, 1995."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. of the 25th STOC. ACM Press, 1993.","DOI":"10.1145\/167088.167119"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri. Agreement is harder than consensus: set consensus problems in totally asynchronous systems. In Proc. of the 9th Annual ACM Symposium on Principles of Distributed Computing, pages 311\u2013334. ACM Press, August 1990.","DOI":"10.1145\/93385.93431"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M. Fisher","year":"1985","unstructured":"M. Fisher, N. A. Lynch, and M. S. Paterson. Impossibility of distributed commit with one faulty process. Journal of the ACM, 32(2):374\u2013382, April 1985.","journal-title":"Journal of the ACM"},{"key":"18_CR5","unstructured":"E. Goubault. The Geometry of Concurrency. PhD thesis, Ecole Normale Sup\u00e9rieure, 1995. to be published, 1997, also available at http:\/\/www.ens.fr\/\u223cgoubault."},{"key":"18_CR6","volume-title":"Proc. of PEPM'95","author":"E. Goubault","year":"1995","unstructured":"E. Goubault. Schedulers as abstract interpretations of HDA. In Proc. of PEPM'95, La Jolla, June 1995. ACM Press."},{"key":"18_CR7","unstructured":"E. Goubault. The dynamics of wait-free distributed computations. Technical report, Research Report LIENS-96-26, December 1996."},{"key":"18_CR8","unstructured":"E. Goubault. A semantic view on distributed computability and complexity. In Proceedings of the 3rd Theory and Formal Methods Section Workshop. Imperial College Press, also available at http:\/\/www.ens.fr\/\u223cgoubault, 1996."},{"key":"18_CR9","unstructured":"M. Herlihy. A Tutorial on Algebraic Topology and Distributed Computation. Technical report, presented at UCLA, 1994."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"M. Herlihy and S. Rajsbaum. Set consensus using arbitrary objects. In Proc. of the 13th Annual ACM Symposium on Principles of Distributed Computing. ACM Press, August 1994.","DOI":"10.1145\/197917.198119"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"M. Herlihy and S. Rajsbaum. Algebraic topology and distributed computing, a primer. Technical report, Brown University, 1995.","DOI":"10.1145\/224964.224975"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proc. of the 25th STOC. ACM Press, 1993.","DOI":"10.1145\/167088.167125"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"M. Herlihy and N. Shavit. A simple constructive computability theorem for wait-free computation. In Proceedings of STOC'94. ACM Press, 1994.","DOI":"10.1145\/195058.195144"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"V. Pratt. Modeling concurrency with geometry. In Proc. of the 18th ACM Symposium on Principles of Programming Languages. ACM Press, 1991.","DOI":"10.1145\/99583.99625"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proc. of the 25th STOC. ACM Press, 1993.","DOI":"10.1145\/167088.167122"},{"key":"18_CR16","unstructured":"B. Sedgewick. Algorithms. Addison-Wesley, 1988."},{"key":"18_CR17","unstructured":"R. van Glabbeek. Bisimulation semantics for higher dimensional automata. Technical report, Stanford University, Manuscript available on the web as http:\/\/theory.stanford.edu\/\u223crvg\/hda, 1991."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '97: Theory and Practice of Software Development"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:01:26Z","timestamp":1558256486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627814","9783540685173"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0030599","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"20 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}