{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:02:29Z","timestamp":1783576949381,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T00:00:00Z","timestamp":1219017600000},"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":[[2008,8,18]]},"DOI":"10.1145\/1400751.1400786","type":"proceedings-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T12:38:39Z","timestamp":1219149519000},"page":"253-262","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Distributed algorithms for ultrasparse spanners and linear size skeletons"],"prefix":"10.1145","author":[{"given":"Seth","family":"Pettie","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,8,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148144"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007916"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796303421"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_10"},{"key":"e_1_3_2_1_6_1","volume-title":"Personal communication","author":"Baswana S.","year":"2008","unstructured":"S. Baswana . Personal communication , 2008 . S. Baswana. Personal communication, 2008."},{"key":"e_1_3_2_1_7_1","first-page":"672","volume-title":"Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Baswana S.","year":"2005","unstructured":"S. Baswana , T. Kavitha , K. Mehlhorn , and S. Pettie . New constructions of (\u03b1,\u03b2)-spanners and purely additive spanners . In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 672 -- 681 , 2005 . S. Baswana, T. Kavitha, K. Mehlhorn, and S. Pettie. New constructions of (\u03b1,\u03b2)-spanners and purely additive spanners. In Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 672--681, 2005."},{"key":"e_1_3_2_1_8_1","first-page":"1125","volume-title":"Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA)","author":"Baswana S.","year":"2008","unstructured":"S. Baswana and S. Sarkar . Fully dynamic algorithms for graph spanners with poly-logaritmic update time . In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA) , pages 1125 -- 1134 , 2008 . S. Baswana and S. Sarkar. Fully dynamic algorithms for graph spanners with poly-logaritmic update time. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 1125--1134, 2008."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v30:4"},{"key":"e_1_3_2_1_10_1","volume-title":"Personal communication","author":"Derbel B.","year":"2008","unstructured":"B. Derbel . Personal communication , 2008 . B. Derbel. Personal communication, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780823_9"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2393794.2393812"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400788"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797327908"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2005.04.002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103963.1103968"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281128"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394539.2394624"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380797"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701393384"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0147-2"},{"key":"e_1_3_2_1_22_1","first-page":"29","volume-title":"Theory of Graphs and its Applications (Proc. Sympos. Smolenice","author":"Erdos P.","year":"1963","unstructured":"P. Erdos . Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice , 1963 ), pages 29 -- 36 . Publ. House Czechoslovak Acad . Sci., Prague, 1963. P. Erdos. Extremal problems in graph theory. In Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pages 29--36. Publ. House Czechoslovak Acad. Sci., Prague, 1963."},{"key":"e_1_3_2_1_23_1","first-page":"745","volume-title":"Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Feigenbaum J.","year":"2005","unstructured":"J. Feigenbaum , S. Kannan , A. McGregor , S. Suri , and J. Zhang . Graph distances in the streaming model: the value of space . In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 745 -- 754 , 2005 . J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, and J. Zhang. Graph distances in the streaming model: the value of space. In Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 745--754, 2005."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1208237"},{"key":"e_1_3_2_1_25_1","volume-title":"Personal communication","author":"Panconesi A.","year":"2008","unstructured":"A. Panconesi . Personal communication , 2008 . A. Panconesi. Personal communication, 2008."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"Peleg D.","year":"2000","unstructured":"D. Peleg . Distributed Computing: A Locality-Sensitive Approach . SIAM , 2000 . D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM, 2000."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2394539.2394552"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_22"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_52"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109645"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90097-4"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.45"}],"event":{"name":"PODC '08: ACM Symposium on Principles of Distributed Computing","location":"Toronto Canada","acronym":"PODC '08","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400751.1400786","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1400751.1400786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:23Z","timestamp":1750258043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1400751.1400786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,18]]},"references-count":34,"alternative-id":["10.1145\/1400751.1400786","10.1145\/1400751"],"URL":"https:\/\/doi.org\/10.1145\/1400751.1400786","relation":{},"subject":[],"published":{"date-parts":[[2008,8,18]]},"assertion":[{"value":"2008-08-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}