{"id":"https://openalex.org/W4378895377","doi":"https://doi.org/10.1145/3558481.3591078","title":"Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence","display_name":"Nearly Optimal Parallel Algorithms for Longest Increasing Subsequence","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4378895377","doi":"https://doi.org/10.1145/3558481.3591078"},"language":"en","primary_location":{"id":"doi:10.1145/3558481.3591078","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3558481.3591078","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591078","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 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591078","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Boston College, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-4961-763X","affiliations":[{"raw_affiliation_string":"Boston College, Boston, USA","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086319053","display_name":"Shang-En Huang","orcid":"https://orcid.org/0000-0002-9799-0981"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shang-En Huang","raw_affiliation_strings":["Boston College, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-9799-0981","affiliations":[{"raw_affiliation_string":"Boston College, Boston, USA","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["Boston College, Boston, USA"],"raw_orcid":"https://orcid.org/0009-0002-7970-9604","affiliations":[{"raw_affiliation_string":"Boston College, Boston, USA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4895,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6967491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9993000030517578,"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.9951000213623047,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9945999979972839,"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.6925028562545776},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6480088233947754},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.557989239692688},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.511506199836731},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4961465299129486},{"id":"https://openalex.org/keywords/unit","display_name":"Unit (ring theory)","score":0.46475234627723694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46367689967155457},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.4375399649143219},{"id":"https://openalex.org/keywords/span","display_name":"Span (engineering)","score":0.43484798073768616},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.4233511686325073},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.41379034519195557},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.41362541913986206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4100118577480316},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3534419536590576}],"concepts":[{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6925028562545776},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6480088233947754},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.557989239692688},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.511506199836731},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4961465299129486},{"id":"https://openalex.org/C122637931","wikidata":"https://www.wikidata.org/wiki/Q118084","display_name":"Unit (ring theory)","level":2,"score":0.46475234627723694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46367689967155457},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4375399649143219},{"id":"https://openalex.org/C2778753569","wikidata":"https://www.wikidata.org/wiki/Q1960395","display_name":"Span (engineering)","level":2,"score":0.43484798073768616},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.4233511686325073},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.41379034519195557},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.41362541913986206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4100118577480316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3534419536590576},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"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/C147176958","wikidata":"https://www.wikidata.org/wiki/Q77590","display_name":"Civil engineering","level":1,"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/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3558481.3591078","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3558481.3591078","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591078","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 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3558481.3591078","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3558481.3591078","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3558481.3591078","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 35th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7995651076","display_name":"AF: Small: Combinatorial Optimization Problems in Vertex Centric Computation","funder_award_id":"2008422","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4378895377.pdf","grobid_xml":"https://content.openalex.org/works/W4378895377.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1521188358","https://openalex.org/W1691157804","https://openalex.org/W1846289970","https://openalex.org/W1889224378","https://openalex.org/W1971194700","https://openalex.org/W1992982349","https://openalex.org/W2008803097","https://openalex.org/W2009853785","https://openalex.org/W2023893309","https://openalex.org/W2038268267","https://openalex.org/W2049774319","https://openalex.org/W2059310886","https://openalex.org/W2064570679","https://openalex.org/W2066688636","https://openalex.org/W2069893028","https://openalex.org/W2072458248","https://openalex.org/W2076458424","https://openalex.org/W2090747326","https://openalex.org/W2104592606","https://openalex.org/W2142827025","https://openalex.org/W2152290683","https://openalex.org/W2152506638","https://openalex.org/W2167592280","https://openalex.org/W2531762745","https://openalex.org/W2626928698","https://openalex.org/W2750865092","https://openalex.org/W2885849839","https://openalex.org/W3137678020","https://openalex.org/W4254302415","https://openalex.org/W4282050459","https://openalex.org/W4289815558","https://openalex.org/W4292955852","https://openalex.org/W4400064739"],"related_works":["https://openalex.org/W3122601395","https://openalex.org/W2969919693","https://openalex.org/W2125120904","https://openalex.org/W4225868058","https://openalex.org/W2035123411","https://openalex.org/W4289703385","https://openalex.org/W2950275960","https://openalex.org/W3177225655","https://openalex.org/W2886272114","https://openalex.org/W2036758175"],"abstract_inverted_index":{"The":[0],"paper":[1],"presents":[2],"parallel":[3],"algorithms":[4],"for":[5],"multiplying":[6,97],"implicit":[7,28],"simple":[8,29,99],"unit-Monge":[9,30,100],"matrices":[10,31,101],"(Krusche":[11,150],"and":[12,56,85,93,110,126,151,155,162],"Tiskin,":[13,152],"PPAM":[14],"2009)":[15],"of":[16,33],"size":[17,34],"n":[18,20,35,37,50,80],"x":[19,36],"in":[21,77,123],"the":[22,71,133,136,146,170],"EREW":[23,44,67,118],"PRAM":[24,45,68,119],"model.":[25],"We":[26],"show":[27],"multiplication":[32],"can":[38,102],"be":[39,103],"achieved":[40],"by":[41],"a":[42,65,116],"deterministic":[43,66],"algorithm":[46,69,120],"with":[47,91,129],"O(n":[48,78,106],"log":[49,51,52,81,82,107],"n)":[53,58,83,88,108,157,168],"total":[54,171],"work":[55,84,109,125,172],"O(log3":[57],"span.":[59,89],"This":[60],"implies":[61],"that":[62],"there":[63],"is":[64],"solving":[70],"longest":[72],"increasing":[73],"subsequence":[74],"(LIS)":[75],"problem":[76],"log2":[79],"O(log":[86],"4":[87],"Furthermore,":[90],"randomization":[92],"bitwise":[94],"operations,":[95],"implicitly":[96],"two":[98],"improved":[104],"to":[105,115,166],"O(log3n)":[111],"span,":[112],"which":[113],"leads":[114],"randomized":[117],"obtaining":[121],"LIS":[122,137],"O(nlog2n)":[124],"O(log4n)":[127],"span":[128,147],"high":[130],"probability.":[131],"In":[132],"regime":[134],"where":[135],"has":[138],"length":[139],"k":[140],"=":[141],"\u03a8(log3n),":[142],"our":[143],"results":[144],"improve":[145],"from":[148],"\u00d5(n2/3)":[149],"SPAA":[153,164],"2010)":[154],"O(klog":[156],"(Gu,":[158],"Men,":[159],"Shen,":[160],"Sun,":[161],"Wan,":[163],"2023)":[165],"O(log4":[167],"while":[169],"remains":[173],"near":[174],"optimal":[175],"\u00d5":[176],"(n).":[177]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}