{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:37Z","timestamp":1750307917374,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:00:00Z","timestamp":1181347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,9]]},"DOI":"10.1145\/1248377.1248402","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"154-160","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":29,"title":["Local MST computation with short advice"],"prefix":"10.1145","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[{"name":"CNRS and University Paris 7, Paris, France"}]},{"given":"Amos","family":"Korman","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}]},{"given":"Emmanuelle","family":"Lebhar","sequence":"additional","affiliation":[{"name":"CNRS and University Paris 7, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2007,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28421"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/112007.112009"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/11603771_2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_28"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.7"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen T.H.","year":"1990","unstructured":"T.H. Cormen , T. Leiserson , and R.L. Rivest . Introduction to Algorithms . MIT Press\/McGraw-Hill , 1990 . T.H. Cormen, T. Leiserson, and R.L. Rivest. Introduction to Algorithms. MIT Press\/McGraw-Hill, 1990."},{"key":"e_1_3_2_1_7_1","first-page":"352","volume-title":"Proc. ACM-SIAM on Discrete Algorithms (SODA)","author":"Elkin M.","year":"2004","unstructured":"M. Elkin . A Faster Distributed Protocol for Constructing a Minimum Spanning Tree . In Proc. ACM-SIAM on Discrete Algorithms (SODA) , pp. 352 -- 361 , 2004 . M. Elkin. A Faster Distributed Protocol for Constructing a Minimum Spanning Tree. In Proc. ACM-SIAM on Discrete Algorithms (SODA), pp. 352--361, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007407"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146410"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323612"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146389"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073817"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011811"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.383984"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167149"},{"key":"e_1_3_2_1_19_1","series-title":"SIAM Monographs on Discrete Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"A Locality-Sensitive Approach","author":"Peleg D.","year":"2000","unstructured":"D. Peleg . Distributed Computing : A Locality-Sensitive Approach . SIAM Monographs on Discrete Mathematics , 2000 . D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics, 2000."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796477"}],"event":{"name":"SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"San Diego California USA","acronym":"SPAA07"},"container-title":["Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1248377.1248402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:25Z","timestamp":1750258285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,9]]},"references-count":20,"alternative-id":["10.1145\/1248377.1248402","10.1145\/1248377"],"URL":"https:\/\/doi.org\/10.1145\/1248377.1248402","relation":{},"subject":[],"published":{"date-parts":[[2007,6,9]]},"assertion":[{"value":"2007-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}