{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:13Z","timestamp":1781077693452,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001742","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2015813"],"award-info":[{"award-number":["2015813"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003973","name":"Israel Academy of Sciences and Humanities","doi-asserted-by":"publisher","award":["724\/15 and 1817\/17"],"award-info":[{"award-number":["724\/15 and 1817\/17"]}],"id":[{"id":"10.13039\/501100003973","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,17]]},"DOI":"10.1145\/3323165.3323177","type":"proceedings-article","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T12:14:30Z","timestamp":1560860070000},"page":"333-341","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Linear-Size Hopsets with Small Hopbound, and Constant-Hopbound Hopsets in RNC"],"prefix":"10.1145","author":[{"given":"Michael","family":"Elkin","sequence":"first","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ofer","family":"Neiman","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039722"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366823"},{"key":"e_1_3_2_1_3_1","volume-title":"Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In 31st International Symposium on Distributed Computing, DISC 2017","author":"Becker Ruben","year":"2017"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1747597.1748002"},{"key":"e_1_3_2_1_5_1","unstructured":"Pranay Chaudhuri. 1992. Parallel algorithms - designs and analysis .Prentice Hall.   Pranay Chaudhuri. 1992. Parallel algorithms - designs and analysis .Prentice Hall."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366822"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0813"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/331605.331610"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.383983"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055452"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.22"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933098"},{"key":"e_1_3_2_1_13_1","unstructured":"Michael Elkin and Ofer Neiman. 2017. Linear-Size Hopsets with Small Hopbound and Distributed Routing with Low Memory. CoRR Vol. abs\/1704.08468 (2017). http:\/\/arxiv.org\/abs\/1704.08468  Michael Elkin and Ofer Neiman. 2017. Linear-Size Hopsets with Small Hopbound and Distributed Routing with Low Memory. CoRR Vol. abs\/1704.08468 (2017). http:\/\/arxiv.org\/abs\/1704.08468"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212761"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701393384"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0147-2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935777"},{"key":"e_1_3_2_1_18_1","volume-title":"Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014","author":"Henzinger Monika","year":"2014"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_20_1","unstructured":"Shang-En Huang and Seth Pettie. 2017. Thorup-Zwick Emulators are Universally Optimal Hopsets. CoRR Vol. abs\/1705.00327 (2017). http:\/\/arxiv.org\/abs\/1705.00327  Shang-En Huang and Seth Pettie. 2017. Thorup-Zwick Emulators are Universally Optimal Hopsets. CoRR Vol. abs\/1705.00327 (2017). http:\/\/arxiv.org\/abs\/1705.00327"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0888"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90093-X"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767398"},{"key":"e_1_3_2_1_24_1","unstructured":"Christoph Lenzen Boaz Patt-Shamir and David Peleg. 2016. Distributed Distance Computation and Routing with Small Messages. manuscript.  Christoph Lenzen Boaz Patt-Shamir and David Peleg. 2016. Distributed Distance Computation and Routing with Small Messages. manuscript."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755574"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0968"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(81)90010-9"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380798"},{"key":"e_1_3_2_1_30_1","volume-title":"Proc. of Symp. on Discr. Algorithms. 802--809","author":"Thorup M."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"}],"event":{"name":"SPAA '19: 31st ACM Symposium on Parallelism in Algorithms and Architectures","location":"Phoenix AZ USA","acronym":"SPAA '19","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"]},"container-title":["The 31st ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323177","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3323165.3323177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:23:16Z","timestamp":1750202596000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3323165.3323177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":31,"alternative-id":["10.1145\/3323165.3323177","10.1145\/3323165"],"URL":"https:\/\/doi.org\/10.1145\/3323165.3323177","relation":{},"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"2019-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}