{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:12:37Z","timestamp":1725466357650},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311031"},{"type":"electronic","value":"9783642311048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31104-8_17","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T12:59:54Z","timestamp":1340629194000},"page":"195-206","source":"Crossref","is-referenced-by-count":4,"title":["Early Deciding Synchronous Renaming in O( logf ) Rounds or Less"],"prefix":"10.1007","author":[{"given":"Dan","family":"Alistarh","sequence":"first","affiliation":[]},{"given":"Hagit","family":"Attiya","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Corentin","family":"Travers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Zadimoghaddam, M.: Optimal-time adaptive strong renaming, with applications to counting. In: PODC 2011: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, pp. 239\u2013248 (2011)","DOI":"10.1145\/1993806.1993850"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gilbert, S., Guerraoui, R.: The complexity of renaming. In: FOCS 2011: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 718\u2013727 (2011)","DOI":"10.1109\/FOCS.2011.66"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Attiya, H., Guerraoui, R., Travers, C.: Early deciding synchronous renaming in O( logf ) rounds or less. Technical report, INRIA (2012), \n                  \n                    http:\/\/hal.inria.fr\/hal-00687555\/en\/","DOI":"10.1007\/978-3-642-31104-8_17"},{"issue":"3","key":"17_CR4","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1145\/79147.79158","volume":"37","author":"H. Attiya","year":"1990","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D., Peleg, D., Reischuk, R.: Renaming in an asynchronous environment. Journal of the ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"Journal of the ACM"},{"issue":"8","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1006\/jpdc.2001.1730","volume":"61","author":"H. Attiya","year":"2001","unstructured":"Attiya, H., Djerassi-Shintel, T.: Time bounds for decision problems in the presence of timing uncertainty and failures. Journal of Parallel and Distributed Computing\u00a061(8), 1096\u20131109 (2001)","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/S0097539700366000","volume":"31","author":"H. Attiya","year":"2001","unstructured":"Attiya, H., Fouren, A.: Adaptive and efficient algorithms for lattice agreement and renaming. SIAM Journal on Computing\u00a031(2), 642\u2013664 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/164051.164056","volume-title":"PODC 2093: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC 2093: Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, pp. 41\u201351. ACM, New York (1993)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00446-011-0137-5","volume":"24","author":"A. Brodsky","year":"2011","unstructured":"Brodsky, A., Ellen, F., Woelfel, P.: Fully-adaptive algorithms for long-lived renaming. Distributed Computing\u00a024(2), 119\u2013134 (2011)","journal-title":"Distributed Computing"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/72981.72991","volume-title":"PODC 1989: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing","author":"J.E. Burns","year":"1989","unstructured":"Burns, J.E., Peterson, G.L.: The ambiguity of choosing. In: PODC 1989: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp. 145\u2013157. ACM, New York (1989)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: The upper bound. Journal of the ACM\u00a059(1) (March 2012)","DOI":"10.1145\/2108242.2108245"},{"issue":"5-6","key":"17_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00446-010-0108-2","volume":"22","author":"A. Casta\u00f1eda","year":"2010","unstructured":"Casta\u00f1eda, A., Rajsbaum, S.: New combinatorial topology bounds for renaming: The lower bound. Distributed Computing\u00a022(5-6), 287\u2013301 (2010)","journal-title":"Distributed Computing"},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/inco.1993.1043","volume":"105","author":"S. Chaudhuri","year":"1993","unstructured":"Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation\u00a0105(1), 132\u2013158 (1993)","journal-title":"Information and Computation"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(98)00242-4","volume":"220","author":"S. Chaudhuri","year":"1999","unstructured":"Chaudhuri, S., Herlihy, M., Tuttle, M.R.: Wait-free implementations in message-passing systems. Theoretical Computer Science\u00a0220(1), 211\u2013245 (1999)","journal-title":"Theoretical Computer Science"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D. Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. Journal of the ACM\u00a033, 499\u2013516 (1986)","journal-title":"Journal of the ACM"},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1145\/96559.96565","volume":"37","author":"D. Dolev","year":"1990","unstructured":"Dolev, D., Reischuk, R., Raymond Strong, H.: Early stopping in byzantine agreement. Journal of the ACM\u00a037(4), 720\u2013741 (1990)","journal-title":"Journal of the ACM"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/050640746","volume":"40","author":"E. Gafni","year":"2011","unstructured":"Gafni, E., Guerraoui, R., Pochon, B.: The complexity of early deciding set agreement. SIAM Journal on Computing\u00a040, 63\u201378 (2011)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy, M., Shavit, N.: The topological structure of asynchronous computability. Journal of the ACM\u00a046(2), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0020430","volume-title":"Distributed Algorithms","author":"M. Moir","year":"1994","unstructured":"Moir, M., Anderson, J.H.: Fast, Long-Lived Renaming (Extended Abstract). In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 141\u2013155. Springer, Heidelberg (1994)"},{"issue":"40-42","key":"17_CR19","doi-asserted-by":"publisher","first-page":"3787","DOI":"10.1016\/j.tcs.2010.06.001","volume":"411","author":"M. Okun","year":"2010","unstructured":"Okun, M.: Strong order-preserving renaming in the synchronous message passing model. Theoretical Computer Science\u00a0411(40-42), 3787\u20133794 (2010)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31104-8_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:55Z","timestamp":1620128695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31104-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311031","9783642311048"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31104-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}