{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:16Z","timestamp":1725455596281},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552369"},{"type":"electronic","value":"9783540467892"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","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":[[1992]]},"DOI":"10.1007\/bfb0022436","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:03:27Z","timestamp":1131843807000},"page":"31-51","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["More on the power of random walks: Uniform self-stabilizing randomized algorithms"],"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"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"3_CR1","unstructured":"E. Anagnostou, R. El-Yaniv, and V. Hadzilacos. Fast and Simple Self-Stabilizing Algorithms, 1991. In preparation."},{"key":"3_CR2","unstructured":"E. Anagnostou, R. El-Yaniv, and H. Tamaki. A Self Stabilizing Reduction and Applications, 1991. Unpublished Manuscript."},{"issue":"3","key":"3_CR3","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"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R. Karp, R. Lipton, L. Lov\u00e1sz, and C. Rackoff. Random walks, Universal traversal sequences, and the complexity of maze problems. In Proc. of the 20th Annual Symposium on Foundations of Computer Science, pages 218\u2013223, 1979.","DOI":"10.1109\/SFCS.1979.34"},{"key":"3_CR5","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.","DOI":"10.1007\/3-540-54099-7_2"},{"key":"3_CR6","unstructured":"Y. Afek, S. Kutten, and M. Yung, August, 1991. Personal Communication."},{"key":"3_CR7","unstructured":"B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-Stabilization by Local Checking and Correction. In 32nd FOCS, October, 1991."},{"key":"3_CR8","unstructured":"B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. In 32nd FOCS, October, 1991."},{"issue":"6","key":"3_CR9","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"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01048273","volume":"2","author":"A. Broder","year":"1989","unstructured":"A. Broder and A. Karlin. Bounds on Cover Times. Journal of Theoretical Probability, 2:101\u2013120, 1989.","journal-title":"Journal of Theoretical Probability"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"A. Broder, A. Karlin, P. Raghavan, and E. Upfal. Trading Space for Time in Undirected s-t Connectivity. In Proc. of the 21st ACM Symposium on Theory of Computing, pages 543\u2013549, Seattle, WA, 1989.","DOI":"10.1145\/73007.73059"},{"issue":"2","key":"3_CR12","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"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"A. Chandra, P. Raghavan, W. Ruzzo, R. Smolensky, and P. Tiwari. The Electrical Resistance of a Graph Captures its Commute and Cover Times. In Proc. of the 21st ACM Symposium on Theory of Computing, pages 574\u2013586, Seattle, WA, 1989.","DOI":"10.1145\/73007.73062"},{"issue":"11","key":"3_CR14","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"},{"key":"3_CR15","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.","DOI":"10.1145\/93385.93407"},{"key":"3_CR16","unstructured":"S. Dolev, A. Israeli, and S. Moran. Uniform Dynamic Self-Stabilizing Leader Election. In 5th IWDAG, Delphi, Greece, October, 1991."},{"key":"3_CR17","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.","DOI":"10.1145\/93385.93409"},{"key":"3_CR18","unstructured":"Marc Jalfon. Randomized Self Stabilizing Uniform Protocols for Distributed Systems. Master's thesis, Department of Computer Science, Technion, 1990."},{"key":"3_CR19","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.","DOI":"10.1145\/93385.93405"},{"issue":"2","key":"3_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(79)90151-0","volume":"8","author":"H. S. Kruijer","year":"1979","unstructured":"H. S. Kruijer. Self-stabilization (in spite of distributed control) in tree-structured systems. Inf. Proc. Letters, 8, 2:91\u201395, 1979.","journal-title":"Inf. Proc. Letters"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"B. Schieber and M. Snir. Calling Names on Nameless Networks. In Proc. of the 8th ACM Symp. on Prcnciples of Distr. Computing, pages 319\u2013328, Edmonton, Canada, 1989.","DOI":"10.1145\/72981.73004"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:36:09Z","timestamp":1578526569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022436"}},"subtitle":["Preliminary report"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552369","9783540467892"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0022436","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}