{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T04:31:34Z","timestamp":1781757094153,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"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":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384253","type":"proceedings-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T21:48:11Z","timestamp":1624916891000},"page":"1375-1388","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Distance sensitivity oracles with subcubic preprocessing time and fast query time"],"prefix":"10.1145","author":[{"given":"Shiri","family":"Chechik","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sarel","family":"Cohen","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214084"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Shiri Chechik Cyril Gavoille and David Peleg. 2010. Forbidden-set distance labels for graphs of bounded doubling dimension. In PODC. 192\u2013200.  Ittai Abraham Shiri Chechik Cyril Gavoille and David Peleg. 2010. Forbidden-set distance labels for graphs of bounded doubling dimension. In PODC. 192\u2013200.","DOI":"10.1145\/1835698.1835743"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267748"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 223\u2013232","author":"Baswana Surender","year":"2095","unstructured":"Surender Baswana , Utkarsh Lath , and Anuradha S. Mehta . 2012. Single Source Distance Oracle for Planar Digraphs Avoiding a Failed Node or Link . In Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 223\u2013232 . http:\/\/dl.acm.org\/citation.cfm?id= 2095 116.2095136 Surender Baswana, Utkarsh Lath, and Anuradha S. Mehta. 2012. Single Source Distance Oracle for Planar Digraphs Avoiding a Failed Node or Link. In Proceedings of the Twenty-third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 223\u2013232. http:\/\/dl.acm.org\/citation.cfm?id=2095116.2095136"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646388.690192"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1347082.1347087"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536431"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Panagiotis Charalampopoulos Shay Mozes and Benjamin Tebeka. 2019. Exact Distance Oracles for Planar Graphs with Failing Vertices. To appear.  Panagiotis Charalampopoulos Shay Mozes and Benjamin Tebeka. 2019. Exact Distance Oracles for Planar Graphs with Failing Vertices. To appear.","DOI":"10.1137\/1.9781611975482.127"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039782"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9543-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9211-9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705429847"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.56"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.17"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2010.2481"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_19_1","volume-title":"All Pairs Shortest Paths in Undirected Graphs with Integer Weights. In In IEEE Symposium on Foundations of Computer Science. 605\u2013614","author":"Shoshan Avi","year":"1999","unstructured":"Avi Shoshan and Uri Zwick . 1999 . All Pairs Shortest Paths in Undirected Graphs with Integer Weights. In In IEEE Symposium on Foundations of Computer Science. 605\u2013614 . Avi Shoshan and Uri Zwick. 1999. All Pairs Shortest Paths in Undirected Graphs with Integer Weights. In In IEEE Symposium on Foundations of Computer Science. 605\u2013614."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00034"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2438645.2438646"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.102"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214056"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/567112.567114"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384253","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":24,"alternative-id":["10.1145\/3357713.3384253","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384253","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}