{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T03:56:57Z","timestamp":1725767817166},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,6,6]]},"DOI":"10.1145\/1993806.1993823","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"119-128","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["From bounded to unbounded concurrency objects and back"],"prefix":"10.1145","author":[{"given":"Yehuda","family":"Afek","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Adam","family":"Morrison","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Guy","family":"Wertheim","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]}],"member":"320","published-online":{"date-parts":[[2011,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146415"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/164051.164071"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509983"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0123-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_10"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561927_12"},{"key":"e_1_3_2_1_8_1","unstructured":"David Eisenstat. A two-enqueuer queue. arXiv:0805.0444v2 {cs.DC} 2009. David Eisenstat. A two-enqueuer queue. arXiv:0805.0444v2 {cs.DC} 2009."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384008"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Eli\n \n Gafni\n and \n \n \n Sergio\n \n Rajsbaum\n .\n \n \n \n Recursion in distributed computing. In Shlomi Dolev Jorge Cobb Michael Fischer and Moti Yung editors Stabilization Safety and Security of Distributed Systems (SSS\n \n 2010\n ) volume \n 6366\n of \n Lecture Notes in Computer Science pages \n 362\n --\n 376\n . \n Springer Berlin \/ Heidelberg 2010. Eli Gafni and Sergio Rajsbaum. Recursion in distributed computing. In Shlomi Dolev Jorge Cobb Michael Fischer and Moti Yung editors Stabilization Safety and Security of Distributed Systems (SSS 2010) volume 6366 of Lecture Notes in Computer Science pages 362--376. Springer Berlin \/ Heidelberg 2010.","DOI":"10.1007\/978-3-642-16023-3_30"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/113379.113409"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263888"},{"volume-title":"University of Toronto","year":"2001","author":"Li Zongpeng","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645957.675966"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/72981.72992"},{"volume-title":"Tel Aviv University","year":"1994","author":"Weisman Hanan","key":"e_1_3_2_1_21_1"}],"event":{"name":"PODC '11: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Jose California USA","acronym":"PODC '11"},"container-title":["Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1993806.1993823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T17:26:48Z","timestamp":1672939608000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1993806.1993823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,6]]},"references-count":20,"alternative-id":["10.1145\/1993806.1993823","10.1145\/1993806"],"URL":"https:\/\/doi.org\/10.1145\/1993806.1993823","relation":{},"subject":[],"published":{"date-parts":[[2011,6,6]]},"assertion":[{"value":"2011-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}
