{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:58Z","timestamp":1759638238447,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T00:00:00Z","timestamp":1532304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1320675"],"award-info":[{"award-number":["CCF-1320675"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,23]]},"DOI":"10.1145\/3212734.3212773","type":"proceedings-article","created":{"date-parts":[[2018,7,31]],"date-time":"2018-07-31T16:28:33Z","timestamp":1533054513000},"page":"199-205","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in \u00d5(n 3\/2 ) Rounds"],"prefix":"10.1145","author":[{"given":"Udit","family":"Agarwal","sequence":"first","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[{"name":"University of Texas at Austin, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[{"name":"University of Victoria, Victoria, BC, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matteo","family":"Pontecorvi","sequence":"additional","affiliation":[{"name":"Nokia Bell Labs, Nozay, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Udit Agarwal and Vijaya Ramachandran . 2018. A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. (2018). Manuscript.  Udit Agarwal and Vijaya Ramachandran . 2018. A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining. (2018). Manuscript."},{"key":"e_1_3_2_1_2_1","volume-title":"On a routing problem. Quarterly of applied mathematics","author":"Richard Bellman","year":"1958","unstructured":"Richard Bellman . 1958. On a routing problem. Quarterly of applied mathematics Vol. 16 , 1 ( 1958 ), 87--90. Richard Bellman . 1958. On a routing problem. Quarterly of applied mathematics Vol. 16, 1 (1958), 87--90."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055452"},{"volume-title":"Hopsets with constant hopbound, and applications to approximate shortest paths Proc","author":"Elkin Michael","key":"e_1_3_2_1_4_1","unstructured":"Michael Elkin and Ofer Neiman . 2016. Hopsets with constant hopbound, and applications to approximate shortest paths Proc . FOCS. IEEE , 128--137. Michael Elkin and Ofer Neiman . 2016. Hopsets with constant hopbound, and applications to approximate shortest paths Proc. FOCS. IEEE, 128--137."},{"key":"e_1_3_2_1_6_1","volume-title":"Networks Cannot Compute Their Diameter in Sublinear Time SODA '12","author":"Frischknecht Silvio","year":"2012","unstructured":"Silvio Frischknecht , Stephan Holzer , and Roger Wattenhofer . 2012 . Networks Cannot Compute Their Diameter in Sublinear Time SODA '12 . 1150--1162. Silvio Frischknecht, Stephan Holzer, and Roger Wattenhofer . 2012. Networks Cannot Compute Their Diameter in Sublinear Time SODA '12. 1150--1162."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767417"},{"key":"e_1_3_2_1_10_1","volume-title":"Improved Distributed Algorithms for Exact Shortest Paths. arXiv preprint arXiv:1712.09121","author":"Ghaffari Mohsen","year":"2017","unstructured":"Mohsen Ghaffari and Jason Li . 2017. Improved Distributed Algorithms for Exact Shortest Paths. arXiv preprint arXiv:1712.09121 ( 2017 ). Mohsen Ghaffari and Jason Li . 2017. Improved Distributed Algorithms for Exact Shortest Paths. arXiv preprint arXiv:1712.09121 (2017)."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_1_13_1","volume-title":"Danupon Na Nongkai, and Thatchaphol Saranurak","author":"Huang Chien-Chung","year":"2017","unstructured":"Chien-Chung Huang , Danupon Na Nongkai, and Thatchaphol Saranurak . 2017 . Distributed Exact Weighted All-Pairs Shortest Paths in \u00d5(n^5\/4) Rounds Proc. FOCS. IEEE , 168--179. Chien-Chung Huang, Danupon Na Nongkai, and Thatchaphol Saranurak . 2017. Distributed Exact Weighted All-Pairs Shortest Paths in \u00d5(n^5\/4) Rounds Proc. FOCS. IEEE, 168--179."},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. FOCS. IEEE, 81--89","author":"Valerie King","year":"1999","unstructured":"Valerie King . 1999 . Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs . In Proc. FOCS. IEEE, 81--89 . Valerie King . 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proc. FOCS. IEEE, 81--89."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767398"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484262"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_19_1","series-title":"SIAM Monographs on discrete mathematics and applications","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed computing: A Locality-sensitive Approach","author":"David Peleg","year":"2000","unstructured":"David Peleg . 2000. Distributed computing: A Locality-sensitive Approach . SIAM Monographs on discrete mathematics and applications Vol. 5 ( 2000 ). David Peleg . 2000. Distributed computing: A Locality-sensitive Approach. SIAM Monographs on discrete mathematics and applications Vol. 5 (2000)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_58"},{"volume-title":"A near-tight lower bound on the time complexity of distributed mst construction Proc","author":"Peleg David","key":"e_1_3_2_1_21_1","unstructured":"David Peleg and Vitaly Rubinovich . 1999. A near-tight lower bound on the time complexity of distributed mst construction Proc . FOCS. IEEE , 253--261. David Peleg and Vitaly Rubinovich . 1999. A near-tight lower bound on the time complexity of distributed mst construction Proc. FOCS. IEEE, 253--261."},{"key":"e_1_3_2_1_22_1","volume-title":"Distributed algorithms for directed betweenness centrality and all pairs shortest paths. arXiv preprint arXiv:1805.08124","author":"Pontecorvi Matteo","year":"2018","unstructured":"Matteo Pontecorvi and Vijaya Ramachandran . 2018. Distributed algorithms for directed betweenness centrality and all pairs shortest paths. arXiv preprint arXiv:1805.08124 ( 2018 ). Matteo Pontecorvi and Vijaya Ramachandran . 2018. Distributed algorithms for directed betweenness centrality and all pairs shortest paths. arXiv preprint arXiv:1805.08124 (2018)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"}],"event":{"name":"PODC '18: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Egham United Kingdom","acronym":"PODC '18"},"container-title":["Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212773","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212773","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3212734.3212773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:44Z","timestamp":1750212464000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3212734.3212773"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,23]]},"references-count":22,"alternative-id":["10.1145\/3212734.3212773","10.1145\/3212734"],"URL":"https:\/\/doi.org\/10.1145\/3212734.3212773","relation":{},"subject":[],"published":{"date-parts":[[2018,7,23]]},"assertion":[{"value":"2018-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}