{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:58Z","timestamp":1750306078666,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["26330084","15H00816"],"award-info":[{"award-number":["26330084","15H00816"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087840","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"411-413","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Michiko","family":"Inoue","sequence":"first","affiliation":[{"name":"Nara Institute of Science and Technology, Ikoma, Nara, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fukuhito","family":"Ooshita","sequence":"additional","affiliation":[{"name":"Nara Institute of Science and Technology, Ikoma, Nara, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[{"name":"UPMC Sorbonne Universit\u00e9s LIP6 - CNRS 7606, IUF, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00384"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2003.1203448"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571877"},{"key":"e_1_3_2_1_4_1","volume-title":"International Conference on Principles of Distributed Systems.","author":"Cohen Johanne","year":"2016","unstructured":"Johanne Cohen , Khaled Ma\u00e2mra , George Manoussakis , and Laurence Pilard . 2016 . Polynomial self-stabilizing maximal matching algorithm with approximation ratio 2\/3 . In International Conference on Principles of Distributed Systems. Johanne Cohen, Khaled Ma\u00e2mra, George Manoussakis, and Laurence Pilard. 2016. Polynomial self-stabilizing maximal matching algorithm with approximation ratio 2\/3. In International Conference on Principles of Distributed Systems."},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of International Conference on Principles of Distributed Systems. 1--16","author":"Datta Ajoy K.","year":"2015","unstructured":"Ajoy K. Datta , Lawrence L. Larmoreand , and Toshimitsu Masuzawa . 2015 . Maximum Matching for Anonymous Trees with Constant Space per Process . In Proceedings of International Conference on Principles of Distributed Systems. 1--16 . Ajoy K. Datta, Lawrence L. Larmoreand, and Toshimitsu Masuzawa. 2015. Maximum Matching for Anonymous Trees with Constant Space per Process. In Proceedings of International Conference on Principles of Distributed Systems. 1--16."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2009.24"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications. 797--803","author":"Goddard Wayne","year":"2006","unstructured":"Wayne Goddard , Stephen T Hedetniemi , Zhengnan Shi , 2006 . An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees . In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications. 797--803 . Wayne Goddard, Stephen T Hedetniemi, Zhengnan Shi, et al. 2006. An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. In Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications. 797--803."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2009.11.006"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90015-N"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49259-9_17"},{"key":"e_1_3_2_1_12_1","first-page":"175","article-title":"Distributed self-stabilizing algorithm for finding maximum matching","volume":"15","author":"Karaata Mehmet Hakan","year":"2000","unstructured":"Mehmet Hakan Karaata and Kassem Afif Saleh . 2000 . Distributed self-stabilizing algorithm for finding maximum matching . Computer Systems Science and Engineering 15 , 3 (2000), 175 -- 180 . Mehmet Hakan Karaata and Kassem Afif Saleh. 2000. Distributed self-stabilizing algorithm for finding maximum matching. Computer Systems Science and Engineering 15, 3 (2000), 175--180.","journal-title":"Computer Systems Science and Engineering"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.022"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.019"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087840","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:07Z","timestamp":1750217407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087840"}},"subtitle":["Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks"],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":14,"alternative-id":["10.1145\/3087801.3087840","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087840","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}