{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:01:12Z","timestamp":1725544872740},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642113215"},{"type":"electronic","value":"9783642113222"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11322-2_19","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T05:17:59Z","timestamp":1265692679000},"page":"167-177","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Bernard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Devismes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katy","family":"Paroux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Afek, Y., Bremler-Barr, A.: Self-stabilizing unidirectional network algorithms by power supply. Chicago J. Theor. Comput. Sci. (1998)","DOI":"10.4086\/cjtcs.1998.003"},{"key":"19_CR2","volume-title":"Proceedings of the IEEE International Conference on Parallel and Distributed Processing Systems (IPDPS 2009)","author":"S. Bernard","year":"2009","unstructured":"Bernard, S., Devismes, S., Potop-Butucaru, M.G., Tixeuil, S.: Optimal deterministic self-stabilizing vertex coloring in unidirectional anonymous networks. In: Proceedings of the IEEE International Conference on Parallel and Distributed Processing Systems (IPDPS 2009), Rome, Italy, May 2009. IEEE Press, Los Alamitos (2009)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-45438-1_4","volume-title":"Self-Stabilizing Systems","author":"J.A. Cobb","year":"2001","unstructured":"Cobb, J.A., Gouda, M.G.: Stabilization of routing in directed networks. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 51\u201366. Springer, Heidelberg (2001)"},{"issue":"4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1142\/S0129626499000529","volume":"9","author":"S.K. Das","year":"1999","unstructured":"Das, S.K., Datta, A.K., Tixeuil, S.: Self-stabilizing algorithms in dag structured networks. Parallel Processing Letters\u00a09(4), 563\u2013574 (1999)","journal-title":"Parallel Processing Letters"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Dela\u00ebt, S., Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators revisited. Journal of Aerospace Computing, Information, and Communication (2006)","DOI":"10.2514\/1.19848"},{"issue":"11","key":"19_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-stabilization. MIT Press, Cambridge (2000)"},{"issue":"9","key":"19_CR8","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s00236-004-0143-1","volume":"40","author":"S. Dolev","year":"2004","unstructured":"Dolev, S., Schiller, E.: Self-stabilizing group communication in directed networks. Acta Inf.\u00a040(9), 609\u2013636 (2004)","journal-title":"Acta Inf."},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/PL00008934","volume":"14","author":"B. Ducourthial","year":"2001","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with r-operators. Distributed Computing\u00a014(3), 147\u2013162 (2001)","journal-title":"Distributed Computing"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(02)00238-4","volume":"293","author":"B. Ducourthial","year":"2003","unstructured":"Ducourthial, B., Tixeuil, S.: Self-stabilization with path algebra. Theoretical Computer Science\u00a0293(1), 219\u2013236 (2003); Extended abstract in Sirocco 2000","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","unstructured":"Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: International Conference on Principles of Distributed Systems (OPODIS 2000), Paris, France, December 2000, pp. 55\u201370 (2000)"},{"key":"19_CR12","series-title":"Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1002\/0471725161","volume-title":"A history of probability and statistics and their applications before 1750","author":"A. Hald","year":"1990","unstructured":"Hald, A.: A history of probability and statistics and their applications before 1750. Wiley Series in Probability and Mathematical Statistics: Probability and Mathematical Statistics, p. 586. John Wiley & Sons Inc., New York (1990) (A Wiley-Interscience Publication)"},{"key":"19_CR13","first-page":"31","volume-title":"Proceedings of ICPADS 2006","author":"N. Mitton","year":"2006","unstructured":"Mitton, N., Fleury, E., Gu\u00e9rin-Lassous, I., S\u00e9ricola, B., Tixeuil, S.: On fast randomized colorings in sensor networks. In: Proceedings of ICPADS 2006, pp. 31\u201338. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/RELDIS.2002.1180170","volume-title":"21st Symposium on Reliable Distributed Systems (SRDS 2002)","author":"M. Nesterenko","year":"2002","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), p. 22. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"19_CR15","series-title":"Cambridge Series in Statistical and Probabilistic Mathematics","volume-title":"Markov chains","author":"J.R. Norris","year":"1998","unstructured":"Norris, J.R.: Markov chains. Cambridge Series in Statistical and Probabilistic Mathematics, vol.\u00a02. Cambridge University Press, Cambridge (1998); Reprint of 1997 original"},{"key":"19_CR16","volume-title":"Introduction to probability models","author":"S.M. Ross","year":"2000","unstructured":"Ross, S.M.: Introduction to probability models, 7th edn. Harcourt\/Academic Press, Burlington (2000)","edition":"7"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11322-2_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:36Z","timestamp":1606167576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11322-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642113215","9783642113222"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11322-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}