{"id":"https://openalex.org/W7164055914","doi":"https://doi.org/10.1145/3798129.3800789","title":"Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time","display_name":"Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164055914","doi":"https://doi.org/10.1145/3798129.3800789"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800789","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800789","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800789","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5138221172","display_name":"Xiao Mao","orcid":"https://orcid.org/0000-0002-1224-9730"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiao Mao","raw_affiliation_strings":["Stanford University, STANFORD, USA"],"raw_orcid":"https://orcid.org/0000-0002-1224-9730","affiliations":[{"raw_affiliation_string":"Stanford University, STANFORD, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035432679","display_name":"Aviad Rubinstein","orcid":"https://orcid.org/0000-0002-6900-8612"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aviad Rubinstein","raw_affiliation_strings":["Stanford University, STANFORD, USA"],"raw_orcid":"https://orcid.org/0000-0002-6900-8612","affiliations":[{"raw_affiliation_string":"Stanford University, STANFORD, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9543615,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"744","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5583000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5583000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.1324000060558319,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.05389999970793724,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.36250001192092896},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.2833999991416931},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.26409998536109924},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.2558000087738037}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45719999074935913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3962000012397766},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3856000006198883},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3522000014781952},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35199999809265137},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800789","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800789","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800789","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800789","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W1482862754","https://openalex.org/W1764956874","https://openalex.org/W1968570655","https://openalex.org/W2012010763","https://openalex.org/W2019972981","https://openalex.org/W2032869782","https://openalex.org/W2074353216","https://openalex.org/W2076238476","https://openalex.org/W2091399525","https://openalex.org/W2121770144","https://openalex.org/W2133601898","https://openalex.org/W2162663580","https://openalex.org/W2169838205","https://openalex.org/W2178011018","https://openalex.org/W2179404110","https://openalex.org/W2207058206","https://openalex.org/W2264676752","https://openalex.org/W2345605959","https://openalex.org/W2416529140","https://openalex.org/W2775068415","https://openalex.org/W2782583418","https://openalex.org/W2801961161","https://openalex.org/W2810672408","https://openalex.org/W2888157438","https://openalex.org/W2898166636","https://openalex.org/W2898839814","https://openalex.org/W2903274221","https://openalex.org/W2952972528","https://openalex.org/W2953362850","https://openalex.org/W2963944443","https://openalex.org/W2971787908","https://openalex.org/W2978214882","https://openalex.org/W2998685384","https://openalex.org/W3002517191","https://openalex.org/W3034399032","https://openalex.org/W3034952850","https://openalex.org/W3035231910","https://openalex.org/W3045093866","https://openalex.org/W3126626577","https://openalex.org/W3158705442","https://openalex.org/W3162057152","https://openalex.org/W3172736027","https://openalex.org/W3183408448","https://openalex.org/W3184887344","https://openalex.org/W3185436803","https://openalex.org/W3217016244","https://openalex.org/W4214887037","https://openalex.org/W4232943531","https://openalex.org/W4233413206","https://openalex.org/W4240117647","https://openalex.org/W4249036581","https://openalex.org/W4281704174","https://openalex.org/W4316652269","https://openalex.org/W4376639569","https://openalex.org/W4388775762","https://openalex.org/W4390098194","https://openalex.org/W4390575865","https://openalex.org/W4399521736","https://openalex.org/W4399523059","https://openalex.org/W4399523294","https://openalex.org/W4411319841","https://openalex.org/W4411319921","https://openalex.org/W6891716433"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}