{"id":"https://openalex.org/W3109308265","doi":"https://doi.org/10.1145/3406325.3451026","title":"Improved dynamic algorithms for longest increasing subsequence","display_name":"Improved dynamic algorithms for longest increasing subsequence","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3109308265","doi":"https://doi.org/10.1145/3406325.3451026","mag":"3109308265"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451026","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451026","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086467798","display_name":"Tomasz Kociumaka","orcid":"https://orcid.org/0000-0002-2477-1702"},"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":"Tomasz Kociumaka","raw_affiliation_strings":["University of California at Berkeley, USA","University of California\u2013Berkeley"],"raw_orcid":"https://orcid.org/0000-0002-2477-1702","affiliations":[{"raw_affiliation_string":"University of California at Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California\u2013Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087093711","display_name":"Saeed Seddighin","orcid":"https://orcid.org/0000-0002-3951-7096"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Saeed Seddighin","raw_affiliation_strings":["Toyota Technological Institute at Chicago, USA","[Toyota Technological Institute at Chicago, USA]"],"raw_orcid":"https://orcid.org/0000-0002-3951-7096","affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, USA","institution_ids":["https://openalex.org/I160992636"]},{"raw_affiliation_string":"[Toyota Technological Institute at Chicago, USA]","institution_ids":["https://openalex.org/I160992636"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4405,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.58399363,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"640","last_page":"653"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/subsequence","display_name":"Subsequence","score":0.7736483812332153},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.706255316734314},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6883386969566345},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6772259473800659},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6612337827682495},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6238317489624023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6153885722160339},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5932084321975708},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5315485000610352},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5007138252258301},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.48122453689575195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.470800518989563},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.4419037401676178},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37389928102493286},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.24841508269309998},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0836460292339325}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.7736483812332153},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.706255316734314},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6883386969566345},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6772259473800659},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6612337827682495},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6238317489624023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6153885722160339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5932084321975708},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5315485000610352},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5007138252258301},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.48122453689575195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.470800518989563},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.4419037401676178},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37389928102493286},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.24841508269309998},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0836460292339325},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3406325.3451026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451026","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2011.10874","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2011.10874","pdf_url":"https://arxiv.org/pdf/2011.10874","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3109308265","is_oa":true,"landing_page_url":"http://arxiv.org/pdf/2011.10874.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2011.10874","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2011.10874","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451026","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451026","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451026","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 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3109196640","display_name":"HDR TRIPODS: Institute for Integrated Data Science: A Transdisciplinary Approach to Understanding Fundamental Trade-offs and Theoretical Foundations","funder_award_id":"1934846","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3385483125","display_name":"CIF: Small: New Directions in Clustering: Interactive Algorithms and Statistical Models","funder_award_id":"1909046","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G665357574","display_name":"CAREER: Efficient Fine-grained Algorithms","funder_award_id":"1652303","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/F4320307786","display_name":"Adobe Systems","ror":"https://ror.org/059tvcg64"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3109308265.pdf","grobid_xml":"https://content.openalex.org/works/W3109308265.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W104148001","https://openalex.org/W199049232","https://openalex.org/W1528180898","https://openalex.org/W1586809440","https://openalex.org/W1998730018","https://openalex.org/W2018407082","https://openalex.org/W2018543684","https://openalex.org/W2061448976","https://openalex.org/W2069893028","https://openalex.org/W2093101813","https://openalex.org/W2104592606","https://openalex.org/W2131191265","https://openalex.org/W2143594377","https://openalex.org/W2153715991","https://openalex.org/W2571471359","https://openalex.org/W2606114621","https://openalex.org/W2626928698","https://openalex.org/W2768149714","https://openalex.org/W2780293396","https://openalex.org/W2788475759","https://openalex.org/W2902944068","https://openalex.org/W2903274221","https://openalex.org/W2962710088","https://openalex.org/W2963645943","https://openalex.org/W2964082996","https://openalex.org/W2964264613","https://openalex.org/W2971374205","https://openalex.org/W2971957671","https://openalex.org/W2972259791","https://openalex.org/W3023302315","https://openalex.org/W3034398078","https://openalex.org/W3037236243","https://openalex.org/W3037365099","https://openalex.org/W3120293505","https://openalex.org/W3167872191","https://openalex.org/W3169904088","https://openalex.org/W4235082106"],"related_works":["https://openalex.org/W3122367310","https://openalex.org/W3167872191","https://openalex.org/W3132750127","https://openalex.org/W3093292228","https://openalex.org/W1596674180","https://openalex.org/W2068462176","https://openalex.org/W3183408448","https://openalex.org/W3006753662","https://openalex.org/W3174411800","https://openalex.org/W2985285859","https://openalex.org/W2800468465","https://openalex.org/W2952817443","https://openalex.org/W2797010454","https://openalex.org/W3186611761","https://openalex.org/W1758934104","https://openalex.org/W2951922466","https://openalex.org/W2975802287","https://openalex.org/W2902944068","https://openalex.org/W2133476289","https://openalex.org/W1921009182"],"abstract_inverted_index":{"We":[0],"study":[1],"dynamic":[2,12],"algorithms":[3],"for":[4,39],"the":[5,22,44,48,51,56],"longest":[6,52],"increasing":[7,53],"subsequence":[8,54],"(LIS)":[9],"problem.":[10],"A":[11],"LIS":[13],"algorithm":[14,45],"maintains":[15],"a":[16],"sequence":[17],"subject":[18],"to":[19],"operations":[20],"of":[21,50,55],"following":[23],"form":[24],"arriving":[25],"one":[26],"by":[27],"one:":[28],"insert":[29],"an":[30,33,37],"element,":[31,34],"delete":[32],"or":[35],"substitute":[36],"element":[38],"another.":[40],"After":[41],"each":[42],"update,":[43],"must":[46],"report":[47],"length":[49],"current":[57],"sequence.":[58]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}