{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:31Z","timestamp":1781077711120,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718116","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"2167-2178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7028-2595","authenticated-orcid":false,"given":"Jakob","family":"Nogler","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4925-774X","authenticated-orcid":false,"given":"Adam","family":"Polak","sequence":"additional","affiliation":[{"name":"Bocconi University, Milan, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6494-3839","authenticated-orcid":false,"given":"Barna","family":"Saha","sequence":"additional","affiliation":[{"name":"University of California at San Diego, La Jolla, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4844-2863","authenticated-orcid":false,"given":"Virginia","family":"Vassilevska Williams","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, La Jolla, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6809-2514","authenticated-orcid":false,"given":"Yinzhan","family":"Xu","sequence":"additional","affiliation":[{"name":"University of California at San Diego, La Jolla, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0528-5639","authenticated-orcid":false,"given":"Christopher","family":"Ye","sequence":"additional","affiliation":[{"name":"University of California at San Diego, La Jolla, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897653"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201022"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.12"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009898029639"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.63"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.DAM.2007.05.056"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2007.0062"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICIAP.1999.797676"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316388"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3381878"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M112720X"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00135"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CPM.2020.9"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/645925.671669"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1170"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520057"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585178"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00071"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2022.49"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644015.1644017"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP).","author":"Duan Ran","year":"2019","unstructured":"Ran Duan, Ce Jin, and Hongxun Wu. 2019. Faster Algorithms for All Pairs Non-Decreasing Paths Problem. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.43"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44888-8_7"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.018"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2023.106358"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1613676.1613680"},{"key":"e_1_3_2_1_30_1","volume-title":"Proceedings of the 12th Annual Symposium on Switching and Automata Theory (SWAT). 129\u2013131","author":"Michael","unstructured":"Michael J. Fischer and Albert R. Meyer. 1971. Boolean Matrix Multiplication and Transitive Closure. In Proceedings of the 12th Annual Symposium on Switching and Automata Theory (SWAT). 129\u2013131."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627539"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.118"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00070"},{"key":"e_1_3_2_1_34_1","unstructured":"Egor Gorbachev and Tomasz Kociumaka. 2024. Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights. arxiv:2404.06401. arxiv:2404.06401"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ICALP.2021.75"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSB.2003.1227315"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68530-8_8"},{"key":"e_1_3_2_1_40_1","volume-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 146\u2013155","author":"Klein Philip N.","year":"2005","unstructured":"Philip N. Klein. 2005. Multiple-source shortest paths in planar graphs. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 146\u2013155. isbn:0898715857"},{"key":"e_1_3_2_1_41_1","volume-title":"Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA). 781\u2013790","author":"Klein Philip N.","unstructured":"Philip N. Klein, Thomas B. Sebastian, and Benjamin B. Kimia. 2001. Shape matching using edit-distance: an implementation. In Proceedings of the 12th Annual Symposium on Discrete Algorithms (SODA). 781\u2013790. http:\/\/dl.acm.org\/citation.cfm?id=365411.365779"},{"key":"e_1_3_2_1_42_1","volume-title":"Kimia","author":"Klein Philip N.","year":"2000","unstructured":"Philip N. Klein, Srikanta Tirthapura, Daniel Sharvit, and Benjamin B. Kimia. 2000. A tree-edit-distance algorithm for comparing simple, closed shapes. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 696\u2013704. http:\/\/dl.acm.org\/citation.cfm?id=338219.338628"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649604"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90045-1"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00082"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.011"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.77.11.6309"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.71"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.35"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.170"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTCS.1995.377044"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68474-1_11"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1273924"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.115"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90064-3"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218082"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322143"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/11753728_36"},{"key":"e_1_3_2_1_60_1","volume-title":"A Linear Tree Edit Distance Algorithm for Similar Ordered Trees","author":"Touzet H\u00e9l\u00e8ne","unstructured":"H\u00e9l\u00e8ne Touzet. 2005. A Linear Tree Edit Distance Algorithm for Similar Ordered Trees. In Combinatorial Pattern Matching, Alberto Apostolico, Maxime Crochemore, and Kunsoo Park (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg. 334\u2013345. isbn:978-3-540-31562-9"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a009"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824790"},{"key":"e_1_3_2_1_63_1","first-page":"3431","article-title":"On some fine-grained questions in algorithms and complexity","volume":"3","author":"Williams Virginia Vassilevska","year":"2018","unstructured":"Virginia Vassilevska Williams. 2018. On some fine-grained questions in algorithms and complexity. In Proceedings of the ICM. 3, 3431\u20133472.","journal-title":"Proceedings of the ICM."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186893"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.2"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-9-5"},{"key":"e_1_3_2_1_67_1","volume-title":"Introduction to computational biology: maps, sequences and genomes","author":"Waterman Michael S.","unstructured":"Michael S. Waterman. 1995. Introduction to computational biology: maps, sequences and genomes. CRC Press."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1024524"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1186\/1748-7188-6-20"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218082"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718116","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:39:00Z","timestamp":1750693140000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718116"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":70,"alternative-id":["10.1145\/3717823.3718116","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718116","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}