{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:44:07Z","timestamp":1749825847040},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,10,30]],"date-time":"2007-10-30T00:00:00Z","timestamp":1193702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00446-007-0045-x","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T06:05:30Z","timestamp":1193637930000},"page":"403-413","source":"Crossref","is-referenced-by-count":9,"title":["Renaming in synchronous message passing systems with Byzantine failures"],"prefix":"10.1007","volume":"20","author":[{"given":"Michael","family":"Okun","sequence":"first","affiliation":[]},{"given":"Amnon","family":"Barak","sequence":"additional","affiliation":[]},{"given":"Eli","family":"Gafni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,30]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In: PODC, pp. 91\u2013103 (1999)","DOI":"10.1145\/301308.301335"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Merritt, M.: Fast, wait-free (2k \u2212 1)-renaming. In: PODC, pp. 105\u2013112 (1999)","DOI":"10.1145\/301308.301338"},{"issue":"3","key":"45_CR3","doi-asserted-by":"crossref","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. (1990). Renaming in an asynchronous environment. J. ACM 37(3): 524\u2013548","journal-title":"J. ACM"},{"issue":"8","key":"45_CR4","doi-asserted-by":"crossref","first-page":"1096","DOI":"10.1006\/jpdc.2001.1730","volume":"61","author":"H. Attiya","year":"2001","unstructured":"Attiya H., Djerassi-Shintel T. (2001). Time bounds for decision problems in the presence of timing uncertainty and failures. J. Parallel Distrib. Comput. 61(8): 1096\u20131109","journal-title":"J. Parallel Distrib. Comput."},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Attiya, H., Fouren, A.: Polynomial and adaptive long-lived (2k \u2212 1)-renaming. In: DISC, pp.149\u2013163 (2000)","DOI":"10.1007\/3-540-40026-5_10"},{"issue":"2","key":"45_CR6","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1137\/S0097539700366000","volume":"31","author":"H. Attiya","year":"2001","unstructured":"Attiya H., Fouren A. (2001). Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31(2): 642\u2013664","journal-title":"SIAM J. Comput."},{"key":"45_CR7","volume-title":"Distributed computing: fundamentals, simulations and advanced topics","author":"H. Attiya","year":"1998","unstructured":"Attiya H., Welch J.L. (1998). Distributed computing: fundamentals, simulations and advanced topics. McGraw-Hill, New York"},{"issue":"1","key":"45_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01187073","volume":"26","author":"A. Bar-Noy","year":"1993","unstructured":"Bar-Noy A., Dolev D. (1993). A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment. Math. Syst. Theory 26(1): 21\u201339","journal-title":"Math. Syst. Theory"},{"issue":"3","key":"45_CR9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/382780.382784","volume":"48","author":"R.A. Bazzi","year":"2001","unstructured":"Bazzi R.A., Neiger G. (2001). Simplifying fault-tolerance: providing the abstraction of crash failures. J. ACM 48(3): 499\u2013554","journal-title":"J. ACM"},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate atomic snapshots and fast renaming. In: PODC, pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Ellen, F., Woelfel, P.: Fully-adaptive algorithms for long-lived renaming. In: DISC, pp. 413\u2013427 (2006)","DOI":"10.1007\/11864219_29"},{"issue":"1","key":"45_CR12","doi-asserted-by":"crossref","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. (1999). Wait-free implementations in message-passing systems. Theor. Comput. Sci. 220(1): 211\u2013245","journal-title":"Theor. Comput. Sci."},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: On weak and strong termination. In: Dijkstra, E.W. (ed) Selected Writings on Computing: A Personal Perspective. Springer, Heidelberg, pp. 355\u2013357","DOI":"10.1007\/978-1-4612-5695-3_64"},{"issue":"2\u20133","key":"45_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s00446-003-0091-y","volume":"16","author":"F.E. Fich","year":"2003","unstructured":"Fich F.E., Ruppert E. (2003). Hundreds of impossibility results for distributed computing. Distrib. Comput. 16(2\u20133): 121\u2013163","journal-title":"Distrib. Comput."},{"issue":"2","key":"45_CR15","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A., Paterson M. (1985). Impossibility of distributed consensus with one faulty process. J. ACM 32(2): 374\u2013382","journal-title":"J. ACM"},{"issue":"1","key":"45_CR16","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/7531.7919","volume":"34","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson G.N., Lynch N.A. (1987). Electing a leader in a synchronous ring. J. ACM 34(1): 98\u2013115","journal-title":"J. ACM"},{"key":"45_CR17","volume-title":"Ramsey Theory","author":"R.L. Graham","year":"1980","unstructured":"Graham R.L., Rothschild B.L., Spencer J.H. (1980). Ramsey Theory. Wiley, New York"},{"issue":"6","key":"45_CR18","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M. Herlihy","year":"1999","unstructured":"Herlihy M., Shavit N. (1999). The topological structure of asynchronous computability. J. ACM 46(6): 858\u2013923","journal-title":"J. ACM"},{"issue":"3","key":"45_CR19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport L., Shostak R.E., Pease M.C. (1982). The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3): 382\u2013401","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"45_CR20","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch N.A. (1996). Distributed Algorithms. Morgan Kaufmann, New York"},{"issue":"4","key":"45_CR21","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D. Malkhi","year":"1998","unstructured":"Malkhi D., Reiter M.K. (1998). Byzantine quorum systems. Distrib. Comput. 11(4): 203\u2013213","journal-title":"Distrib. Comput."},{"issue":"1","key":"45_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(95)00009-H","volume":"25","author":"M. Moir","year":"1995","unstructured":"Moir M., Anderson J.H. (1995). Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25(1): 1\u201339","journal-title":"Sci. Comput. Program."},{"issue":"3","key":"45_CR23","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(90)90019-B","volume":"11","author":"G. Neiger","year":"1990","unstructured":"Neiger G., Toueg S. (1990). Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms 11(3): 374\u2013419","journal-title":"J. Algorithms"},{"key":"45_CR24","doi-asserted-by":"crossref","unstructured":"Okun, M.: Agreement among unacquainted Byzantine generals. In: DISC, pp. 499\u2013500 (2005)","DOI":"10.1007\/11561927_40"},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Okun, M., Barak, A.: Efficient algorithms for anonymous Byzantine agreement. Theory Comput. Syst. (to appear)","DOI":"10.1007\/s00224-007-9006-9"},{"key":"45_CR26","doi-asserted-by":"crossref","unstructured":"Okun, M., Barak, A.: Renaming in message passing systems with Byzantine failures. In: DISC, pp. 16\u201330 (2006)","DOI":"10.1007\/11864219_2"},{"issue":"2","key":"45_CR27","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease M.C., Shostak R.E., Lamport L. (1980). Reaching agreement in the presence of faults. J. ACM 27(2): 228\u2013234","journal-title":"J. ACM"},{"key":"45_CR28","doi-asserted-by":"crossref","unstructured":"Raynal, M.: An introduction to the renaming problem. In: PRDC, pp. 121\u2013124 (2002)","DOI":"10.1109\/PRDC.2002.1185627"},{"issue":"2","key":"45_CR29","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T.K. Srikanth","year":"1987","unstructured":"Srikanth T.K., Toueg S. (1987). Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2): 80\u201394","journal-title":"Distrib. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0045-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-007-0045-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0045-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:37Z","timestamp":1559136397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-007-0045-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,30]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["45"],"URL":"https:\/\/doi.org\/10.1007\/s00446-007-0045-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,30]]}}}