{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T18:32:07Z","timestamp":1787509927147,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSERC"},{"name":"Google Faculty Research Award"},{"name":"Danish Council for Independent Research under the Sapere Aude research career programme."},{"name":"Israeli Ministry of Science"},{"name":"Technion TASP center"},{"name":"Simons Institute for the Theory of Computing Berkeley"},{"name":"Israel Science Foundation"},{"name":"ENS Paris"},{"name":"Institute for Advanced Study Princeton"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,21]]},"DOI":"10.1145\/2767386.2767405","type":"proceedings-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T09:28:49Z","timestamp":1437125329000},"page":"71-80","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication"],"prefix":"10.1145","author":[{"given":"Valerie","family":"King","sequence":"first","affiliation":[{"name":"University of Victoria, Victoria, BC, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[{"name":"University of Copenhagen, Copenhagen, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.7"},{"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.1109\/FSCS.1990.89570"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77618"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391292"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73015"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233171"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646511.695324"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.07.002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7919"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366821"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627898"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77610"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/579.585"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699440"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/224964.224990"},{"key":"e_1_3_2_1_21_1","volume-title":"Maintenance of a spanning tree in dynamic networks. Distributed Computing","author":"Porat Avner","year":"1999","unstructured":"Kutten, Shay, and Avner Porat . Maintenance of a spanning tree in dynamic networks. Distributed Computing . Springer Berlin Heidelberg , 1999 . 342--355. Kutten, Shay, and Avner Porat. Maintenance of a spanning tree in dynamic networks. Distributed Computing. Springer Berlin Heidelberg, 1999. 342--355."},{"key":"e_1_3_2_1_22_1","unstructured":"Nati Linial. personal communication.  Nati Linial. personal communication."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031501"},{"issue":"4","key":"e_1_3_2_1_24_1","first-page":"18","article-title":"Paxos made simple","volume":"32","year":"2001","unstructured":"amport, Leslie . Paxos made simple . ACM Sigact News 32 . 4 ( 2001 ): 18 -- 25 . amport, Leslie. Paxos made simple. ACM Sigact News 32.4 (2001): 18--25.","journal-title":"ACM Sigact News"},{"key":"e_1_3_2_1_25_1","volume-title":"IFIP Congress.","volume":"7","year":"1977","unstructured":"e Lann, Gerard. Distributed Systems-Towards a Formal Approach . IFIP Congress. Vol. 7 . 1977 . e Lann, Gerard. Distributed Systems-Towards a Formal Approach. IFIP Congress. Vol. 7. 1977."},{"key":"e_1_3_2_1_26_1","volume-title":"Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms. (unpublished Masters Thesis supervised by Valerie King","year":"2013","unstructured":"en Mountjoy. Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms. (unpublished Masters Thesis supervised by Valerie King , University of Victoria , 2013 ). en Mountjoy. Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms. (unpublished Masters Thesis supervised by Valerie King, University of Victoria, 2013)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1842733.1842736"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/318951.319004"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"e_1_3_2_1_31_1","volume-title":"The future of networking, and the past of protocols. Open Networking Summit","year":"2011","unstructured":"henker, Scott. The future of networking, and the past of protocols. Open Networking Summit ( 2011 ). henker, Scott. The future of networking, and the past of protocols. Open Networking Summit (2011)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056620"},{"key":"e_1_3_2_1_33_1","volume-title":"arXiv:1411.4982v2","author":"Thorup M.","year":"2014","unstructured":"M. Thorup . Sample (x)=(a*x<=t) is a distinguisher with probability 1\/8. arXiv:1411.4982v2 , 2014 . M. Thorup. Sample (x)=(a*x<=t) is a distinguisher with probability 1\/8. arXiv:1411.4982v2, 2014."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"e_1_3_2_1_35_1","first-page":"585","volume-title":"INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE (Vol. 2","author":"Nguyen J. E.","year":"2000","unstructured":"Wieselthier, J. E. , Nguyen , G. D., and Ephremides, A . On the construction of energy-efficient broadcast and multicast trees in wireless networks . In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE (Vol. 2 , pp. 585 -- 594 ), 2000 . Wieselthier, J. E., Nguyen, G. D., and Ephremides, A. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE (Vol. 2, pp. 585--594), 2000."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1098-2418(199712)11:4%3C345::AID-RSA4%3E3.0.CO;2-Z"}],"event":{"name":"PODC '15: ACM Symposium on Principles of Distributed Computing","location":"Donostia-San Sebasti\u00e1n Spain","acronym":"PODC '15","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767386.2767405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:03Z","timestamp":1750210983000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":36,"alternative-id":["10.1145\/2767386.2767405","10.1145\/2767386"],"URL":"https:\/\/doi.org\/10.1145\/2767386.2767405","relation":{},"subject":[],"published":{"date-parts":[[2015,7,21]]},"assertion":[{"value":"2015-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}