{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T03:10:26Z","timestamp":1743217826470,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642303463"},{"type":"electronic","value":"9783642303470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30347-0_13","type":"book-chapter","created":{"date-parts":[[2012,5,31]],"date-time":"2012-05-31T02:27:55Z","timestamp":1338431275000},"page":"107-118","source":"Crossref","is-referenced-by-count":4,"title":["The Byzantine Brides Problem"],"prefix":"10.1007","author":[{"given":"Swan","family":"Dubois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nini","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Barbaro, N.: Diary of the Siege of Constantinople. Translation by John Melville-Jones, New York (1453)"},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M.C. Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM\u00a027(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"3","key":"13_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"11","key":"13_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. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dolev, S.: Self-stabilization. MIT Press (March 2000)","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Tixeuil, S.: Self-stabilizing Algorithms. Chapman & Hall\/CRC Applied Algorithms and Data Structures. In: Algorithms and Theory of Computation Handbook, 2nd edn., pp. 26.1\u201326.45. CRC Press, Taylor & Francis Group (November 2009)","DOI":"10.1201\/9781584888215-c26"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Nesterenko, M., Arora, A.: Tolerance to unbounded byzantine faults. In: 21st Symposium on Reliable Distributed Systems (SRDS 2002), pp. 22\u201329. IEEE Computer Society (2002)","DOI":"10.1109\/RELDIS.2002.1180170"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S.C. Hsu","year":"1992","unstructured":"Hsu, S.C., Huang, S.T.: A self-stabilizing algorithm for maximal matching. Inf. Process. Lett.\u00a043(2), 77\u201381 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"13_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0020-0190(94)90098-1","volume":"49","author":"G. Tel","year":"1994","unstructured":"Tel, G.: Maximal matching stabilizes in quadratic time. Inf. Process. Lett.\u00a049(6), 271\u2013272 (1994)","journal-title":"Inf. Process. Lett."},{"key":"13_CR10","unstructured":"Goddard, W., Hedetniemi, S.T., Jacobs, D.P., Srimani, P.K.: Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In: IPDPS, p. 162 (2003)"},{"issue":"14","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1016\/j.tcs.2008.12.022","volume":"410","author":"F. Manne","year":"2009","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A new self-stabilizing maximal matching algorithm. Theoretical Computer Science (TCS)\u00a0410(14), 1336\u20131345 (2009)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"13_CR12","unstructured":"Ghosh, S., Gupta, A., Hakan, M., Sriram, K., Pemmaraju, V.: Self-stabilizing dynamic programming algorithms on trees. In: Proceedings of the Second Workshop on Self-Stabilizing Systems, pp. 11.1\u201311.15 (1995)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree network. In: ICDCS, pp. 20\u201326 (2003)","DOI":"10.1109\/ICDCS.2003.1203448"},{"key":"13_CR14","unstructured":"Goddard, W., Hedetniemi, S.T., Shi, Z.: An anonymous self-stabilizing algorithm for 1-maximal matching in trees. In: PDPTA, pp. 797\u2013803 (2006)"},{"issue":"40","key":"13_CR15","doi-asserted-by":"publisher","first-page":"5515","DOI":"10.1016\/j.tcs.2011.05.019","volume":"412","author":"F. Manne","year":"2011","unstructured":"Manne, F., Mjelde, M., Pilard, L., Tixeuil, S.: A self-stabilizing 2\/3-approximation algorithm for the maximum matching problem. Theoretical Computer Science (TCS)\u00a0412(40), 5515\u20135526 (2011)","journal-title":"Theoretical Computer Science (TCS)"},{"issue":"5","key":"13_CR16","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1145\/1017460.1017463","volume":"51","author":"S. Dolev","year":"2004","unstructured":"Dolev, S., Welch, J.L.: Self-stabilizing clock synchronization in the presence of byzantine faults. J. ACM\u00a051(5), 780\u2013799 (2004)","journal-title":"J. ACM"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/11577327_4","volume-title":"Self-Stabilizing Systems","author":"A. Daliot","year":"2005","unstructured":"Daliot, A., Dolev, D.: Self-stabilization of Byzantine Protocols. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol.\u00a03764, pp. 48\u201367. Springer, Heidelberg (2005)"},{"issue":"1","key":"13_CR18","first-page":"1","volume":"1","author":"T. Masuzawa","year":"2007","unstructured":"Masuzawa, T., Tixeuil, S.: Stabilizing link-coloration of arbitrary networks with unbounded byzantine faults. International Journal of Principles and Applications of Information Science and Technology (PAIST)\u00a01(1), 1\u201313 (2007)","journal-title":"International Journal of Principles and Applications of Information Science and Technology (PAIST)"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-642-15763-9_47","volume-title":"Distributed Computing","author":"S. Dubois","year":"2010","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: The Impact of Topology on Byzantine Containment in Stabilization. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 495\u2013509. Springer, Heidelberg (2010)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-16023-3_10","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S. Dubois","year":"2010","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: On Byzantine Containment Properties of the min + 1 Protocol. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol.\u00a06366, pp. 96\u2013110. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30347-0_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T02:46:46Z","timestamp":1743216406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30347-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303463","9783642303470"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30347-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}