{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:26Z","timestamp":1725490226795},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424956"},{"type":"electronic","value":"9783540446811"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-44681-8_67","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:35:09Z","timestamp":1188358509000},"page":"458-465","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler"],"prefix":"10.1007","author":[{"given":"Maria","family":"Gradinariu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colette","family":"Johnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"67_CR1","unstructured":"Beauquier, J., Gradinariu, M., and Johnen, C.: Randomized self-stabilizing optimal leader election under arbitrary scheduler on rings. Technical Report 1225, Laboratoire de Recherche en Informatique (1999)"},{"key":"67_CR2","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the ACM, vol. 17 (1974) 643\u2013644","journal-title":"Communications of the ACM"},{"key":"67_CR3","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02278856","volume":"7","author":"S. Ghosh","year":"1993","unstructured":"Ghosh, S., and Karaata, M. H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing, 7 (1993) 55\u201359","journal-title":"Distributed Computing"},{"key":"67_CR4","unstructured":"Gradinariu, M., and Tixeuil, S.: Tight space uniform self-stabilizing l-mutual exclusion. Technical Report 1249, Laboratoire de Recherche en Informatique (2000)"},{"key":"67_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., and Yeh., R. K.: Labeling graphs with a condition at distance two. SIAM, Journal of Discrete Mathematics, 5 (1992) 586\u2013595","journal-title":"SIAM, Journal of Discrete Mathematics"},{"issue":"2","key":"67_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S. Hsu","year":"1992","unstructured":"Hsu, S., and Huang, S.: A self-stabilizing algorithm for maximal matching. In Information Processing Letters, 43(2) (1992) 77\u201381","journal-title":"Information Processing Letters"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Micali, S., and Vazirani, V.: An algorithm for finding maximum matching in general graphs. In 21st IEEE Annual Symposium on Foundations of Computer Science (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/PL00008917","volume":"13","author":"A. Pogosyants","year":"2000","unstructured":"Pogosyants, A., Segala, R., and Lynch N.: Verification of the randomized consensus algorithm of Aspen and Herlihy: a case study. In Distributed Computing, 13 (2000), 155\u2013186","journal-title":"Distributed Computing"},{"key":"67_CR9","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/151254.151256","volume":"25","author":"M. Schneider","year":"1993","unstructured":"Schneider M.: Self-stabilization. ACM Computing Surveys, 25 (1993), 45\u201367","journal-title":"ACM Computing Surveys"},{"key":"67_CR10","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Dep. of Electrical EnG. and Comp. Science (1995)"},{"key":"67_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015027","volume-title":"CONCUR\u2019 94, Concurrency Theory, 5th International Conference","author":"R. Segala","year":"1994","unstructured":"Segala, R., and Lynch, N.: Probabilistic simulations for probabilistic processes. In LNCS, CONCUR\u2019 94, Concurrency Theory, 5th International Conference, Vol. 836 (1994)"},{"key":"67_CR12","unstructured":"Shukla, S., Rosenkrantz, D., and Ravi, S.: Developing self-stabilizing coloring algorithms via systematic randomization. In Proc. of the Int. Workshop on Parallel Processing (1994) 668\u2013673"},{"key":"67_CR13","unstructured":"Shukla, S., Rosenkrantz, D., and Ravi, S.: Observations on self-stabilizing graph algorithms for anonymous networks. In Proc. of the Second Workshop on Self-stabilizing Systems, pages 7.1\u20137.15 (1995)"},{"key":"67_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0020-0255(93)90121-2","volume":"69","author":"S. Sur","year":"1993","unstructured":"Sur S., and Srimani P. K.: A self-stabilizing algorithm for coloring bipartite graphs. Information Sciences, 69 (1993) 219\u2013227","journal-title":"Information Sciences"},{"key":"67_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BFb0015029","volume-title":"CONCUR\u2019 94, Concurrency Theory, 5th International Conference","author":"S.H. Wu","year":"1994","unstructured":"Wu, S.H., Smolka, S.A., and Stark, E. W.: Composition and behaviors of probabilistic i\/o automata. In LNCS, CONCUR\u2019 94, Concurrency Theory, 5th International Conference, Vol. 836 (1994) 513\u2013528"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:04:52Z","timestamp":1587341092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_67","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}