{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:12Z","timestamp":1743009852755,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","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":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_30","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"362-376","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Recursion in Distributed Computing"],"prefix":"10.1007","author":[{"given":"Eli","family":"Gafni","sequence":"first","affiliation":[]},{"given":"Sergio","family":"Rajsbaum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/153724.153741","volume":"40","author":"Y. Afek","year":"1993","unstructured":"Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic Snapshots of Shared Memory. J. ACM\u00a040(4), 873\u2013890 (1993)","journal-title":"J. ACM"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Afek, Y., Weisberger, E., Weisman, H.: A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract). In: Proc. 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), Ithaca, New York, USA, August 15-18, pp. 159\u2013170 (1993)","DOI":"10.1145\/164051.164071"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya, H., Bar-Noy, A., Dolev, D.: Sharing Memory Robustly in Message-Passing Systems. J. ACM\u00a042(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"30_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. J. ACM\u00a037(3), 524\u2013548 (1990)","journal-title":"J. ACM"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(92)90035-E","volume":"97","author":"A. Bar-Noy","year":"1992","unstructured":"Bar-Noy, A., Dolev, D., Dwork, C., Strong, H.R.: Shifting Gears. Changing Algorithms on the Fly to Expedite Byzantine Agreement. Inf. Comput.\u00a097(2), 205\u2013233 (1992)","journal-title":"Inf. Comput."},{"key":"30_CR6","first-page":"91","volume-title":"Proc. 25th ACM Symposium on the Theory of Computing (STOC)","author":"E. Borowsky","year":"1993","unstructured":"Borowsky, E., Gafni, E.: Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on the Theory of Computing (STOC), pp. 91\u2013100. ACM Press, New York (1993)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). In: 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), Ithaca, New York, USA, August 15-18, pp. 41\u201351 (1993)","DOI":"10.1145\/164051.164056"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Borowsky, E., Gafni, E.: A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract). In: Proc. 16th ACM Symposium on Principles of Distributed Computing (PODC 1997), Santa Barbara, California, USA, August 21-24, pp. 189\u2013198 (1997)","DOI":"10.1145\/259380.259439"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E. Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N., Rajsbaum, S.: The BG Distributed Simulation Algorithm. Distributed Computing\u00a014(3), 127\u2013146 (2001)","journal-title":"Distributed Computing"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Ca\u00f1eda, A., Rajsbaum, S.: New combinatorial topology upper and lower bounds for renaming. In: Proceedings of the 27-th Annual ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Canada, August 18-21, pp. 295\u2013304 (2008)","DOI":"10.1145\/1400751.1400791"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Chou, C.-T., Gafni, E.: Understanding and Verifying Distributed Algorithms Using Stratified Decomposition. In: Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing (PODC), Toronto, Ontario, Canada, August 15-17, pp. 44\u201365 (1988)","DOI":"10.1145\/62546.62556"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF01187076","volume":"26","author":"B.A. Coan","year":"1993","unstructured":"Coan, B.A., Welch, J.L.: Modular Construction of an Efficient 1-Bit Byzantine Agreement Protocol. Mathematical Systems Theory\u00a026(1), 131\u2013154 (1993)","journal-title":"Mathematical Systems Theory"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Dobson, J., Randell, B.: Building Reliable Secure Computing Systems out of Unreliable Insecure Components. In: Proc. IEEE Conference on Security and Privacy, Oakland, USA, pp. 187\u2013193 (1986)","DOI":"10.1109\/SP.1986.10018"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-6423(83)90013-8","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Elrad, T., Francez, N.: Decomposition of Distributed Programs into Communication-Closed Layers. Sci. Comput. Program\u00a02(3), 155\u2013173 (1982)","journal-title":"Sci. Comput. Program"},{"key":"30_CR15","unstructured":"Fouren, A.: Exponential examples for two renaming algorithms (August 1999), http:\/\/www.cs.technion.ac.il\/~hagit\/publications\/expo.ps.gz"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Gafni, E.: Round-by-Round Fault Detectors, Unifying Synchrony and Asynchrony (Extendeda Abstract). In: Proc. 17th Annual ACM Symposium on Principles of Distributed Computing (PODC), Puerto Vallarta, Mexico, June 28-July 2, pp. 143\u2013152 (1998)","DOI":"10.1145\/277697.277724"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/11864219_23","volume-title":"Distributed Computing","author":"E. Gafni","year":"2006","unstructured":"Gafni, E., Rajsbaum, S., Herlihy, M.: Subconsensus Tasks: Renaming Is Weaker Than Set Agreement. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 329\u2013338. Springer, Heidelberg (2006)"},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A Distributed Algorithm for Minimum-Weight Spanning Trees. ACM Trans. Program. Lang. Syst.\u00a05(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Herlihy, M., Rajsbaum, S.: The Topology of Shared-Memory Adversaries. In: Annual ACM Symposium on Principles of Distributed Computing, Proceeding of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Zurich, Switzerland, pp. 105\u2013113 (2010), ISBN: 978-1-60558-888-9","DOI":"10.1145\/1835698.1835724"},{"issue":"6","key":"30_CR20","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1145\/331524.331529","volume":"46","author":"M.P. Herlihy","year":"1999","unstructured":"Herlihy, M.P., Shavit, N.: The Topological Structure of Asynchronous Computability. Journal of the ACM\u00a046(6), 858\u2013923 (1999)","journal-title":"Journal of the ACM"},{"issue":"3","key":"30_CR21","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"30_CR22","first-page":"163","volume-title":"Advances in Computing Research","author":"M.C. Loui","year":"1987","unstructured":"Loui, M.C., Abu-Amara, H.H.: Memory requirements for agreement among unreliable asynchronous processes. In: Preparata, F.P. (ed.) Advances in Computing Research, vol.\u00a04, pp. 163\u2013183. JAI Press, Greenwich (1987)"},{"key":"30_CR23","volume-title":"Introduction to Algorithms: A Creative Approach","author":"U. Manber","year":"1989","unstructured":"Manber, U.: Introduction to Algorithms: A Creative Approach. Addison-Wesley, Reading (1989)"},{"key":"30_CR24","unstructured":"Randell: Brian Recursively structured distributed computing systems. In: Proc. IEEE Symposium on Reliability in Distributed Software and Database Systems, pp. 3\u201311 (1983)"},{"issue":"3","key":"30_CR25","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ipl.2008.05.001","volume":"108","author":"S. Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: An impossibility about failure detectors in the iterated immediate snapshot model. Inf. Process. Lett.\u00a0108(3), 160\u2013164 (2008)","journal-title":"Inf. Process. Lett."},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-540-69733-6_48","volume-title":"Computing and Combinatorics","author":"S. Rajsbaum","year":"2008","unstructured":"Rajsbaum, S., Raynal, M., Travers, C.: The Iterated Restricted Immediate Snapshot Model. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 487\u2013497. Springer, Heidelberg (2008)"},{"issue":"5","key":"30_CR27","doi-asserted-by":"publisher","first-page":"1449","DOI":"10.1137\/S0097539796307698","volume":"29","author":"M. Saks","year":"2000","unstructured":"Saks, M., Zaharoglou, F.: Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing\u00a029(5), 1449\u20131483 (2000)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"30_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/13.865200","volume":"43","author":"I. Stojmenovic","year":"2000","unstructured":"Stojmenovic, I.: Recursive algorithms in computer science courses: Fibonacci numbers and binomial coefficients. IEEE Trans. on Education\u00a043(3), 273\u2013276 (2000)","journal-title":"IEEE Trans. on Education"},{"key":"30_CR29","unstructured":"Weisman, H.: Implementing shared memory overwriting objects. Master\u2019s thesis, Tel Aviv University (May 1994)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:45:58Z","timestamp":1740523558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}