{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:09Z","timestamp":1742617149735,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:24Z","timestamp":1330253784000},"page":"203-220","source":"Crossref","is-referenced-by-count":6,"title":["Memory adaptive self-stabilizing protocols (extended abstract)"],"prefix":"10.1007","author":[{"given":"Efthymios","family":"Anagnostou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"El-Yaniv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassos","family":"Hadzilacos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Y. Afek and G.M. Brown. Self-Stabilization of the Alternating-Bit Protocol. IEEE Proc. on Reliable Distr. Systems, pages 80\u201383, 1989.","key":"14_CR1","DOI":"10.1109\/RELDIS.1989.72751"},{"doi-asserted-by":"crossref","unstructured":"H. Attiya, A. Bar-Noy, D. Dolev, D. Koller, D. Peleg, and R. Reischuk. Achievable cases in an asynchronous environment. In FOCS, pages 337\u2013346, 1987.","key":"14_CR2","DOI":"10.1109\/SFCS.1987.5"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science, 579","first-page":"31","volume-title":"Distributed Algorithms, 5th IWDAG","author":"E. Anagnostou","year":"1991","unstructured":"E. Anagnostou and R. El-Yaniv. More on the Power of Random Walks: Uniform, Bounded Self-Stabilizing Protocols. In Distributed Algorithms, 5th IWDAG, pages 31\u201351, Delphi, Greece, October, 1991. Lecture Notes in Computer Science, 579 Springer-Verlag."},{"issue":"3","key":"14_CR4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1145\/2402.322387","volume":"30","author":"E. Arjomandi","year":"1983","unstructured":"E. Arjomandi, M. Fisher, and N. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems. Journal of the ACM, 30 (3):449\u2013456, 1983.","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"A. Arora and M. Gouda. Distributed Reset (Extended Abstract). In Tenth Conference on FSTCS, pages 316\u2013329, Bangalore, India, 1990.","key":"14_CR5","DOI":"10.1007\/3-540-53487-3_54"},{"doi-asserted-by":"crossref","unstructured":"B. Awerbuch, S. Kutten, and D. Peleg. Efficient Deadlock-Free Routing. In 10th PODC, pages 177\u2013188, 1991.","key":"14_CR6","DOI":"10.1145\/112600.112616"},{"doi-asserted-by":"crossref","unstructured":"Y. Afek, S. Kutten, and M. Yung. Memory-Efficient Self Stabilizing Protocols for General Networks. In 4th IWDAG, pages 15\u201328, Bari, Italy, September, 1990.","key":"14_CR7","DOI":"10.1007\/3-540-54099-7_2"},{"unstructured":"B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization by Local Checking and Correction. In 32nd FOCS, October, 1991.","key":"14_CR8"},{"doi-asserted-by":"crossref","unstructured":"B. Awerbuch and M. Sipser. Dynamic Networks are as fast as static networks. In 29th FOCS, pages 206\u2013219, 1988.","key":"14_CR9","DOI":"10.1109\/SFCS.1988.21938"},{"unstructured":"B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. In 32nd FOCS, October, 1991.","key":"14_CR10"},{"doi-asserted-by":"crossref","unstructured":"B. Awerbuch. On the effects of feedback in dynamic network protocols. In 29th FOCS, pages 231\u2013245, 1988.","key":"14_CR11","DOI":"10.1109\/SFCS.1988.21940"},{"doi-asserted-by":"crossref","unstructured":"A. Bar-Noy and D. Dolev. Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment. In Proc. of the 8th ACM Symposium on Principles of Distributed Computing, pages 307\u2013318, 1989.","key":"14_CR12","DOI":"10.1145\/72981.73003"},{"issue":"6","key":"14_CR13","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/12.24293","volume":"38","author":"G. Brown","year":"1989","unstructured":"G. Brown, M. Gouda, and C. Wu. Token Systems that Self-Stabilize. IEEE Transactions on Computers, 38, 6:845\u2013852, 1989.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"14_CR14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1145\/63264.63403","volume":"11","author":"L. E. Burns","year":"1989","unstructured":"L. E. Burns and J. Pachl. Uniform Self-Stabilizing Rings. ACM Transactions on Programming Languages and Systems, 11, 2:330\u2013344, 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"11","key":"14_CR15","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E. W. Dijkstra. Self-stabilizing systems in spite of distributed control. Comm. of the ACM, 17(11):643\u2013644, 1974.","journal-title":"Comm. of the ACM"},{"doi-asserted-by":"crossref","unstructured":"S. Dolev, A Israeli, and S. Moran. Self Stabilization of Dynamic Systems Assuming Only Read\/Write Atomicity. In Proc. of the 9th ACM Symposium on Principles of Distributed Computing, pages 103\u2013117, Quebec City, Canada, 1990.","key":"14_CR16","DOI":"10.1145\/93385.93407"},{"unstructured":"S. Dolev, A. Israeli, and S. Moran. Uniform Dynamic Self-Stabilizing Leader Election. In 5th IWDAG, Delphi, Greece, October, 1991.","key":"14_CR17"},{"issue":"1","key":"14_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E. W. Dijkstra","year":"1979","unstructured":"E. W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. IPL, 11(1):1\u20134, 1979.","journal-title":"IPL"},{"issue":"6","key":"14_CR19","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","volume":"27","author":"S. G. Finn","year":"1979","unstructured":"S. G. Finn. Resynch Procedures and a Fail-Safe Network Protocol. IEEE Transactions on Communications, 27(6):840\u2013845, 1979.","journal-title":"IEEE Transactions on Communications"},{"doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon. Token Management Schemes and Random Walks Yield Self Stabilizing Mutual Exclusion. In Proc. of the 9th ACM Symposium on Principles of Distributed Computing, pages 119\u2013131, 1990.","key":"14_CR20","DOI":"10.1145\/93385.93409"},{"doi-asserted-by":"crossref","unstructured":"S. Katz and K. J. Perry. Self-stabiling Extensions for Message-passing Systems. In Proc. of the 9th ACM Symp. on Principles of Distr. Computing, pages 91\u2013101, Quebec City, Canada, 1990.","key":"14_CR21","DOI":"10.1145\/93385.93405"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport. On interprocess communication. Part I: Basic Formalism. Distributed Computing, 1:77\u201385, 1986.","journal-title":"Distributed Computing"},{"key":"14_CR23","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/BF01786228","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport. On interprocess communication. Part II: Algorithms. Distributed Computing, 1:86\u2013101, 1986.","journal-title":"Distributed Computing"},{"issue":"5","key":"14_CR24","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1109\/26.24597","volume":"COM-37","author":"J. M. Spinelli","year":"1989","unstructured":"J. M. Spinelli and R. G., Gallager. Broadcasting topology information in computer networks. IEEE Transactions on Communications, COM-37(5):468\u2013474, 1989.","journal-title":"IEEE Transactions on Communications"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:46:31Z","timestamp":1742593591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}