{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:08Z","timestamp":1725455588354},"publisher-location":"Berlin\/Heidelberg","reference-count":25,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022445","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"167-180","source":"Crossref","is-referenced-by-count":11,"title":["Uniform dynamic self-stabilizing leader election"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amos","family":"Israeli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"K. Abrahamson, \u201cOn Achieving Consensus Using a Shared Memory\u201d, Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, Toronto Canada, August 1988, pp. 291,302.","DOI":"10.1145\/62546.62594"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"A. Arora and M. Gouda: \u201cDistributed Reset\u201d, to appear in Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science, Bangalore, India, December 1990.","DOI":"10.1007\/3-540-53487-3_54"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Y. Afek, S. Kutten and M. Yung, \u201cMemory-Efficient Self-Stabilization on General Networks\u201d, it Proceedings of the 4th International Workshop on Distributed Algorithms, Bari Italy, September 1990.","DOI":"10.1007\/3-540-54099-7_2"},{"key":"12_CR4","unstructured":"G.M. Brown, M.G. Gouda, and C.L. Wu, \u201cA Self-Stabilizing Token system\u201d, Proc. of the Twentieth Annual Hawaii International Conference on System sciences 1987, pp. 218\u2013223."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"J.E. Burns and J. Pachl, \u201cUniform Self-Stabilizing Rings\u201d, Aegean Workshop On Computing, 1988, Lecture notes in computer science 319, pp. 391\u2013400.","DOI":"10.1007\/BFb0040406"},{"key":"12_CR6","unstructured":"J.E. Burns, \u201cSelf-Stabilizing Rings without Demons\u201d, Technical Report GIT-ICS-87\/36, Georgia Institute of Technology."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"B. Chor, A. Israeli, and M. Li, \u201cOn Processor Coordination Using Asynchronous Hardware\u201d, Proc. of the Sixth Annual ACM Symposium on Principles of Distributed Computation, (1987), pp. 86\u201397.","DOI":"10.1145\/41840.41848"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"E.W. Dijkstra, \u201cSelf-Stabilizing Systems in Spite of Distributed Control\u201d, Communications of the ACM 17,11 1974, pp. 643\u2013644.","DOI":"10.1145\/361179.361202"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"S. Dolev, A. Israeli and S. Moran, \u201cSelf Stabilization of Dynamic Systems\u201d, Proc. of the Ninth Annual ACM Symposium on Principles of Distributed Computation, Quebec City, August 1990, pp. 103\u2013118.","DOI":"10.1145\/93385.93407"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"S. Dolev, A. Israeli and S. Moran, \u201cResource Bounds for Self Stabilization Message Driven Protocols\u201d, Proc. of the Tenth Annual ACM Symposium on Principles of Distributed Computation, Montreal, August 1991, pp. 281\u2013294.","DOI":"10.1145\/112600.112624"},{"key":"12_CR11","unstructured":"E. Angnostou and R. El-Yaniv More on the Power of Random Walks: Uniform SelfStabilizing Algorithms"},{"key":"12_CR12","volume-title":"Finding a leader in networks withe O(E)+O(NlogN) messages\u201d, Internal Memo.","author":"R. G. Gallagher","year":"1978","unstructured":"R. G. Gallagher, \u201cFinding a leader in networks withe O(E)+O(NlogN) messages\u201d, Internal Memo., M.I.T., Cambridge, Mass., 1978."},{"issue":"1","key":"12_CR13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"R.G. Gallager, P.M. Humblet and P.M. Spira, \u201cA distributed algorithm for minimum weight spanning trees\u201d, ACM Trans. Program. Lang. Sys. 5 1 (1983), pp. 66\u201377.","journal-title":"ACM Trans. Program. Lang. Sys."},{"key":"12_CR14","volume-title":"Inter. Memo., Laboratory for Information and Decision Systems","author":"P. Humblet","year":"1984","unstructured":"P. Humblet, \u201cSelecting a leader in a clique in O(n log n messages. Inter. Memo., Laboratory for Information and Decision Systems, M.I.T, Cambridge, Mass., 1984."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon, \u201cToken Management Schemes and Random walks Yield Self Stabilizing Mutual Exclusion\u201d, Proc. of the Ninth Annual ACM Symposium on Principles of Distributed Computation, Quebec City, August 1990, pp. 119\u2013132.","DOI":"10.1145\/93385.93409"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Jalfon, \u201cSelf stabilizing Ring Orientation\u201d, Proceedings of the 4th International Workshop on Distributed Algorithms, Bari Italy, September 1990.","DOI":"10.1007\/3-540-54099-7_1"},{"key":"12_CR17","unstructured":"A. Itai and M. Rodeh, \u201cProbabilistic Methods for Breaking Symmetry in Distributed Networks\u201d, To appear in Information and Computation."},{"issue":"1","key":"12_CR18","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/77606.77610","volume":"12","author":"E. Korach","year":"1990","unstructured":"E. Korach, S. Kutten and S. Moran, \u201cA Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms\u201d, ACM Trans. Program. Lang. Sys. 12, 1 (1990), 84\u2013101.","journal-title":"ACM Trans. Program. Lang. Sys."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"E. Korach, S. Moran and S.Zaks, \u201cTight lower and upper bounds for some distributed algorithms for complete network of processors\u201d, Proc. of the 3rd Annual ACM Symposium on Principles od Distributed Computing (1984), pp. 199\u2013207.","DOI":"10.1145\/800222.806747"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"S. Katz and K. J. Perry, \u201cSelf-stabilizing extensions for message-passing systems\u201d, Proc. of the Ninth Annual ACM Symposium on Principles of Distributed Computation, Quebec City, August 1990, pp. 91\u2013101.","DOI":"10.1145\/93385.93405"},{"issue":"2","key":"12_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(79)90151-0","volume":"8","author":"H.S.M. Kruijer","year":"1979","unstructured":"H.S.M. Kruijer, \u201cSelf-stabilization (in spite of distributed control) in tree-structured systems\u201d, Information Processing Letters 8,2 (1979), pp. 91\u201395.","journal-title":"Information Processing Letters"},{"issue":"No.2","key":"12_CR22","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, \u201cThe Mutual Exclusion Problem: Part II \u2014 Statement and Solutions\u201d, Journal of the Association for Computing Machinery, Vol. 33 No. 2 (1986), pp. 327\u2013348.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"12_CR23","unstructured":"G. L. Peterson, \u201cAn O(n log n) unidirectional algorithm for the circular extrema problem\u201d"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"B. Schieber and M. Snir \u201cCalling Names on Nameless Networks\u201d, Proceedings of the Eights Annual Symposium on Principles of Distributed Computing, Edmonton, August 1989, pp. 319\u2013328.","DOI":"10.1145\/72981.73004"},{"key":"12_CR25","unstructured":"George Varghese, \u201cDistributed Program Checking a Paradigm for Building Self-stabilizing Distributed Protocols\u201d, To appear in FOCS-91."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022445.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:28Z","timestamp":1607550508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022445"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0022445","relation":{},"subject":[]}}