{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:03Z","timestamp":1755880803753,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Science Foundation","award":["CNS-2131538"],"award-info":[{"award-number":["CNS-2131538"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659954","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"383-393","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Sparse Spanners with Small Distance and Congestion Stretches"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4381-4333","authenticated-orcid":false,"given":"Costas","family":"Busch","sequence":"first","affiliation":[{"name":"School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1316-7788","authenticated-orcid":false,"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[{"name":"School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7442-7002","authenticated-orcid":false,"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[{"name":"School of Computer & Cyber Sciences, Augusta University, Augusta, Georgia, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1016\/0012-365X(88)90189-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1017\/S0013091500003709"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/77600.77618"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1002\/rsa.20130"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1137\/1.9781611975994.80"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1016\/0095-8956(74)90052-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2213977.2214064"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1536414.1536475"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1145\/1060590.1060698"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3583668.3594599"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing","author":"Chlebus Bogdan S.","year":"2004","unstructured":"Bogdan S. Chlebus, Dariusz R. Kowalski, and Alexander A. Shvartsman. 2004. Collective asynchronous reading with polylogarithmic worst-case overhead. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13--16, 2004, L\u00e1 szl\u00f3 Babai (Ed.). ACM, 321--330."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1016\/J.TCS.2022.03.038"},{"key":"e_1_3_2_1_13_1","volume-title":"Extremal problems in graph theory. Publ","author":"Erd\u00f6s Paul","year":"1964","unstructured":"Paul Erd\u00f6s. 1964. Extremal problems in graph theory. Publ. House Cszechoslovak Acad. Sci., Prague (1964), 29--36."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/s00453-022-01068-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1090\/S0273-0979-06-01126-8"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1145\/2948062"},{"key":"e_1_3_2_1_17_1","volume-title":"Supervised Average Consensus in Anonymous Dynamic Networks. In SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","author":"Dariusz","year":"2021","unstructured":"Dariusz R. Kowalski and Miguel A. Mosteiro. 2021. Supervised Average Consensus in Anonymous Dynamic Networks. In SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, 6--8 July, 2021, Kunal Agrawal and Yossi Azar (Eds.). ACM, 307--317."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/s00446-018-0326-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/BF02126799"},{"key":"e_1_3_2_1_20_1","volume-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii","author":"Margulis Grigorii Aleksandrovich","year":"1988","unstructured":"Grigorii Aleksandrovich Margulis. 1988. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problemy peredachi informatsii, Vol. 24, 1 (1988), 51--60."},{"volume-title":"Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis","author":"Mitzenmacher Michael","unstructured":"Michael Mitzenmacher and Eli Upfal. 2017. Probability and computing: Randomization and probabilistic techniques in algorithms and data analysis. Cambridge university press.","key":"e_1_3_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/3519935.3520047"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1002\/jgt.3190130114"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/65950.65953"},{"volume-title":"Universal routing strategies for interconnection networks","author":"Scheideler Christian","unstructured":"Christian Scheideler. 2006. Universal routing strategies for interconnection networks. Vol. 1390. Springer.","key":"e_1_3_2_1_25_1"}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"acronym":"SPAA '24","name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:14Z","timestamp":1755879794000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":25,"alternative-id":["10.1145\/3626183.3659954","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659954","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}