{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:03:12Z","timestamp":1783576992887,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,16]],"date-time":"2019-07-16T00:00:00Z","timestamp":1563235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002241","name":"Japan Science and Technology Agency","doi-asserted-by":"publisher","award":["SICORP"],"award-info":[{"award-number":["SICORP"]}],"id":[{"id":"10.13039\/501100002241","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["7773087, 1535887"],"award-info":[{"award-number":["7773087, 1535887"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000646","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["16H02878,19K11824"],"award-info":[{"award-number":["16H02878,19K11824"]}],"id":[{"id":"10.13039\/501100000646","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7,16]]},"DOI":"10.1145\/3293611.3331604","type":"proceedings-article","created":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T13:17:21Z","timestamp":1563542241000},"page":"511-520","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Distributed Minimum Degree Spanning Trees"],"prefix":"10.1145","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[{"name":"Johns Hopkins University, Baltimore, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Magnus M.","family":"Halldorsson","sequence":"additional","affiliation":[{"name":"Reykjavik University, Reykjavik, Iceland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taisuke","family":"Izumi","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology, Nagoya, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Calvin","family":"Newport","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, DC, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Technical Report CS-91-94. Brown University.","author":"Agrawal A.","year":"1991"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28421"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/838237.838276"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054104002571"},{"key":"e_1_3_2_1_5_1","volume-title":"Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees. In 35th IEEE International Conference on Distributed Computing Systems, ICDCS 2015","author":"Blin L\u00e9","year":"2015"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2010.08.019"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212758"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.7"},{"key":"e_1_3_2_1_9_1","unstructured":"Michael Dinitz Magn\u00fas M Halld\u00f3rsson Taisuke Izumi and Calvin Newport. 2018. Distributed Algorithms for Minimum Degree Spanning Trees. arXiv preprint arXiv:1806.03365 (2018).  Michael Dinitz Magn\u00fas M Halld\u00f3rsson Taisuke Izumi and Calvin Newport. 2018. Distributed Algorithms for Minimum Degree Spanning Trees. arXiv preprint arXiv:1806.03365 (2018)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007407"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Manuela Fischer. 2018. Improved deterministic distributed matching via rounding. Distributed Computing (2018).  Manuela Fischer. 2018. Improved deterministic distributed matching via rounding. Distributed Computing (2018).","DOI":"10.1007\/s00446-018-0344-4"},{"key":"e_1_3_2_1_12_1","unstructured":"Orr Fischer Tzlil Gonen and Rotem Oshman. 2017. Distributed Property Testing for Subgraph-Freeness Revisited. CoRR Vol. abs\/1705.04033 (2017).  Orr Fischer Tzlil Gonen and Rotem Oshman. 2017. Distributed Property Testing for Subgraph-Freeness Revisited. CoRR Vol. abs\/1705.04033 (2017)."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Annual Allerton Conference on Communication, Control and Computing. 274--281","author":"F\u00fcrer Martin","year":"1990"},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Symposium on Discrete Algorithms. 317--324","author":"F\u00fcrer Martin","year":"1992"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1042"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323612"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09620-9_12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01456961"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224990"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.07.005"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00224-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"}],"event":{"name":"PODC '19: ACM Symposium on Principles of Distributed Computing","location":"Toronto ON Canada","acronym":"PODC '19","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331604","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331604","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3293611.3331604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:02Z","timestamp":1750208522000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3293611.3331604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,16]]},"references-count":25,"alternative-id":["10.1145\/3293611.3331604","10.1145\/3293611"],"URL":"https:\/\/doi.org\/10.1145\/3293611.3331604","relation":{},"subject":[],"published":{"date-parts":[[2019,7,16]]},"assertion":[{"value":"2019-07-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}