{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T21:42:15Z","timestamp":1790718135341,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540363217","type":"print"},{"value":"9783540363224","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11795490_11","type":"book-chapter","created":{"date-parts":[[2007,1,23]],"date-time":"2007-01-23T07:25:18Z","timestamp":1169537118000},"page":"118-129","source":"Crossref","is-referenced-by-count":11,"title":["A Self-stabilizing Link-Coloring Protocol Resilient to Unbounded Byzantine Faults in Arbitrary Networks"],"prefix":"10.1007","author":[{"given":"Toshimitsu","family":"Masuzawa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-57271-6_35","volume-title":"Distributed Algorithms","author":"E. Anagnostou","year":"1993","unstructured":"Anagnostou, E., Hadzilacos, V.: Tolerating transient and permanent failures. In: Schiper, A. (ed.) WDAG 1993. LNCS, vol.\u00a0725, pp. 174\u2013188. Springer, Heidelberg (1993)"},{"issue":"11","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1080\/00207729708929476","volume":"28","author":"J. Beauquier","year":"1997","unstructured":"Beauquier, J., Kekkonen-Moneta, S.: Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabiling failure detectors. International Journal of Systems Science\u00a028(11), 1177\u20131187 (1997)","journal-title":"International Journal of Systems Science"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Kekkonen-Moneta, S.: On ftss-solvable distributed problems. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing, p. 290 (1997)","DOI":"10.1145\/259380.259515"},{"key":"11_CR4","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. Communications of the Association of the Computing Machinery\u00a017, 643\u2013644 (1974)","journal-title":"Communications of the Association of the Computing Machinery"},{"key":"11_CR5","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)"},{"key":"11_CR6","volume-title":"Proceedings of Infocom 2005","author":"S. Gandham","year":"2005","unstructured":"Gandham, S., Dawande, M., Prakash, R.: Link scheduling in sensor networks: Distributed edge coloring revisited. In: Proceedings of Infocom 2005. IEEE Press, Los Alamitos (2005)"},{"issue":"1","key":"11_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02278856","volume":"7","author":"S. Ghosh","year":"1993","unstructured":"Ghosh, S., Karaata, M.H.: A self-stabilizing algorithm for coloring planar graphs. Distributed Computing\u00a07(1), 55\u201359 (1993)","journal-title":"Distributed Computing"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Gopal, A.S., Perry, K.J.: Unifying self-stabilization and fault-tolerance. In: Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, pp. 195\u2013206 (1993)","DOI":"10.1145\/164051.164074"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/3-540-44681-8_67","volume-title":"Euro-Par 2001 Parallel Processing","author":"M. Gradinariu","year":"2001","unstructured":"Gradinariu, M., Johnen, C.: Self-stabilizing Neighborhood Unique Naming under Unfair Scheduler. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol.\u00a02150, pp. 458\u2013465. Springer, Heidelberg (2001)"},{"key":"11_CR10","unstructured":"Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloration and arbitrary graphs. In: Procedings of the 4th International Conference on Principles of Distributed Systems, OPODIS 2000, Paris, France, December 20-22, 2000, pp. 55\u201370 (2000)"},{"issue":"5","key":"11_CR11","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0020-0190(03)00299-0","volume":"87","author":"S.T. Hedetniemi","year":"2003","unstructured":"Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Linear time self-stabilizing colorings. Inf. Process. Lett.\u00a087(5), 251\u2013255 (2003)","journal-title":"Inf. Process. Lett."},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-540-27820-7_6","volume-title":"Algorithmic Aspects of Wireless Sensor Networks","author":"T. Herman","year":"2004","unstructured":"Herman, T., Tixeuil, S.: A distributed TDMA slot assignment algorithm for wireless sensor networks. In: Nikoletseas, S.E., Rolim, J.D.P. (eds.) ALGOSENSORS 2004. LNCS, vol.\u00a03121, pp. 45\u201358. Springer, Heidelberg (2004)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.ipl.2005.03.005","volume":"95","author":"S.-T. Huang","year":"2005","unstructured":"Huang, S.-T., Hung, S.-S., Tzeng, C.-H.: Self-stabilizing coloration in anonymous planar networks. Information processing letters\u00a095(1), 307\u2013312 (2005)","journal-title":"Information processing letters"},{"key":"11_CR14","unstructured":"Masuzawa, T.: A fault-tolerant and self-stabilizing protocol for the topology problem. In: Proceedings of the 2nd Workshop on Self-Stabilizing Systems, pp. 1.1\u20131.15 (1995)"},{"issue":"10","key":"11_CR15","first-page":"1831","volume":"E83-D","author":"H. Matsui","year":"2000","unstructured":"Matsui, H., Inoue, M., Masuzawa, T., Fujiwara, H.: Fault-tolerant and self-stabilizing protocols using an unreliable failure detector. IEICE Transactions on Information and Systems\u00a0E83-D(10), 1831\u20131840 (2000)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: Proceedings of 21st IEEE Symposium on Reliable Distributed Systems, pp. 22\u201329 (2002)","DOI":"10.1109\/RELDIS.2002.1180170"},{"key":"11_CR17","unstructured":"Sakurai, Y., Ooshita, F., Masuzawa, T.: A self-stabilizing link-coloring protocol resilient to byzantine faults in tree networks. In: 8th International Conference on Principles of Distributed Systems, Grenoble, France, December 15-17, pp. 196\u2013206 (2004)"},{"key":"11_CR18","first-page":"668","volume-title":"Proceedings of the International Workshop on Parallel Processing","author":"S. Shukla","year":"1994","unstructured":"Shukla, S., Rosenkrantz, D., Ravi, S.: Developing self-stabilizing coloring algorithms via systematic randomization. In: Proceedings of the International Workshop on Parallel Processing, Bangalore, India, pp. 668\u2013673. Tata-McGrawhill, New Delhi (1994)"},{"key":"11_CR19","unstructured":"Shukla, S., Rosenkrantz, D., Ravi, S.: Observations on self-stabilizing graph algorithms for anonymous networks. In: Proceedings of the Second Workshop on Self-stabilizing Systems (WSS 1995), pp. 7.1\u20137.15 (1995)"},{"issue":"3","key":"11_CR20","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., Srimani, P.K.: A self-stabilizing algorithm for coloring bipartite graphs. Inf. Sci.\u00a069(3), 219\u2013227 (1993)","journal-title":"Inf. Sci."},{"issue":"11","key":"11_CR21","first-page":"1007","volume":"J85-D-I","author":"S. Ukena","year":"2002","unstructured":"Ukena, S., Katayama, Y., Masuzawa, T., Fujiwara, H.: A self-stabilizing spanning tree protocol that tolerates non-quiescent permanent faults. IEICE Transaction\u00a0J85-D-I(11), 1007\u20131014 (2002)","journal-title":"IEICE Transaction"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11795490_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T00:53:11Z","timestamp":1552351991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11795490_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540363217","9783540363224"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11795490_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}