{"id":"https://openalex.org/W4376639569","doi":"https://doi.org/10.1145/3564246.3585104","title":"Approximating Binary Longest Common Subsequence in Almost-Linear Time","display_name":"Approximating Binary Longest Common Subsequence in Almost-Linear Time","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639569","doi":"https://doi.org/10.1145/3564246.3585104"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585104","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585104","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585104","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585104","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017456930","display_name":"Xiaoyu He","orcid":"https://orcid.org/0000-0003-2958-6845"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaoyu He","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077120267","display_name":"Ray Li","orcid":"https://orcid.org/0000-0003-3441-2364"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ray Li","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1145","last_page":"1158"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.9873999953269958,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9847000241279602,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.881200909614563},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.7817357182502747},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6716996431350708},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6076343059539795},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.599800169467926},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5911824107170105},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5792906880378723},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.5751248002052307},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5626674890518188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5204696655273438},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4878654479980469},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4671442210674286},{"id":"https://openalex.org/keywords/similarity","display_name":"Similarity (geometry)","score":0.4278939366340637},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41966211795806885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3777529299259186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23545774817466736},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08639264106750488}],"concepts":[{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.881200909614563},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.7817357182502747},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6716996431350708},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6076343059539795},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.599800169467926},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5911824107170105},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5792906880378723},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.5751248002052307},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5626674890518188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5204696655273438},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4878654479980469},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4671442210674286},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.4278939366340637},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41966211795806885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3777529299259186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23545774817466736},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08639264106750488},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585104","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585104","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585104","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585104","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585104","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585104","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 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1250591470","display_name":"PostDoctoral Research Fellowship","funder_award_id":"2203067","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2235716741","display_name":null,"funder_award_id":"DMS-2103154","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3407039343","display_name":null,"funder_award_id":"2203067","funder_id":"https://openalex.org/F4320337380","funder_display_name":"Division of Mathematical Sciences"},{"id":"https://openalex.org/G6631846822","display_name":"PostDoctoral Research Fellowship","funder_award_id":"2103154","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639569.pdf"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1647671624","https://openalex.org/W1764956874","https://openalex.org/W2003920341","https://openalex.org/W2012010763","https://openalex.org/W2019972981","https://openalex.org/W2032869782","https://openalex.org/W2055693471","https://openalex.org/W2162663580","https://openalex.org/W2178011018","https://openalex.org/W2207058206","https://openalex.org/W2264676752","https://openalex.org/W2775068415","https://openalex.org/W2782583418","https://openalex.org/W2801961161","https://openalex.org/W2888157438","https://openalex.org/W2903274221","https://openalex.org/W2971374205","https://openalex.org/W3002517191","https://openalex.org/W3034399032","https://openalex.org/W3034952850","https://openalex.org/W3035231910","https://openalex.org/W3097495782","https://openalex.org/W3126626577","https://openalex.org/W3184887344","https://openalex.org/W3186611761","https://openalex.org/W4213214442","https://openalex.org/W4221094290","https://openalex.org/W4313227177"],"related_works":["https://openalex.org/W4225349735","https://openalex.org/W4285255549","https://openalex.org/W48421712","https://openalex.org/W2354750595","https://openalex.org/W4376639569","https://openalex.org/W4226078789","https://openalex.org/W2066688636","https://openalex.org/W1825667403","https://openalex.org/W2949858879","https://openalex.org/W3186611761"],"abstract_inverted_index":{"The":[0],"Longest":[1],"Common":[2],"Subsequence":[3],"(LCS)":[4],"is":[5,18,37,50,64,87,101],"a":[6,19,47,65,84,134,146,152,163],"fundamental":[7],"string":[8],"similarity":[9],"measure,":[10],"and":[11,35,95,133,151,156],"computing":[12],"the":[13,57,72,99,104,107,116],"LCS":[14,139,166],"of":[15,148,154],"two":[16,60,108],"strings":[17,110,169],"classic":[20],"algorithms":[21],"question.":[22],"A":[23],"textbook":[24],"dynamic":[25],"programming":[26],"algorithm":[27,31,136],"gives":[28],"an":[29],"exact":[30],"in":[32,68,90,142,170],"quadratic":[33],"time,":[34],"this":[36],"essentially":[38],"best":[39],"possible":[40,88],"under":[41,103],"plausible":[42],"fine-grained":[43],"complexity":[44],"assumptions,":[45],"so":[46],"natural":[48],"problem":[49],"to":[51,121],"find":[52],"faster":[53],"approximation":[54,86],"algorithms.":[55],"When":[56],"inputs":[58],"are":[59],"binary":[61,138],"strings,":[62,124],"there":[63,130,161],"simple":[66],"1/2-approximation":[67],"linear":[69],"time:":[70],"compute":[71],"longest":[73],"common":[74],"all-0s":[75],"or":[76],"all-1s":[77],"subsequence.":[78],"It":[79],"has":[80],"been":[81],"open":[82],"whether":[83],"better":[85],"even":[89],"truly":[91],"subquadratic":[92],"time.":[93,144,172],"Rubinstein":[94],"Song":[96],"showed":[97],"that":[98,106,140],"answer":[100],"yes":[102],"assumption":[105],"input":[109],"have":[111],"equal":[112],"lengths.":[113],"We":[114],"settle":[115],"question,":[117],"generalizing":[118],"their":[119],"result":[120,150,153],"unequal":[122],"length":[123],"proving":[125],"that,":[126],"for":[127,137,158,165],"any":[128,159],"\u03b5>0,":[129,160],"exists":[131,162],"\u03b4>0":[132],"(1/2+\u03b4)-approximation":[135],"runs":[141],"n1+\u03b5":[143,171],"As":[145],"consequence":[147],"our":[149],"Akmal":[155],"Vassilevska-Williams,":[157],"(1/q+\u03b4)-approximation":[164],"over":[167],"q-ary":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}