{"id":"https://openalex.org/W4395686808","doi":"https://doi.org/10.1145/3626183.3659958","title":"Parallel and (Nearly) Work-Efficient Dynamic Programming","display_name":"Parallel and (Nearly) Work-Efficient Dynamic Programming","publication_year":2024,"publication_date":"2024-06-04","ids":{"openalex":"https://openalex.org/W4395686808","doi":"https://doi.org/10.1145/3626183.3659958"},"language":"en","primary_location":{"id":"doi:10.1145/3626183.3659958","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3626183.3659958","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 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3626183.3659958","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077337403","display_name":"Xiangyun Ding","orcid":"https://orcid.org/0009-0001-8367-8399"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiangyun Ding","raw_affiliation_strings":["University of California, Riverside, Riverside, USA"],"raw_orcid":"https://orcid.org/0009-0001-8367-8399","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100352651","display_name":"Yan Gu","orcid":"https://orcid.org/0000-0002-4392-4022"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yan Gu","raw_affiliation_strings":["University of California, Riverside, Riverside, USA"],"raw_orcid":"https://orcid.org/0000-0002-4392-4022","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004374151","display_name":"Yihan Sun","orcid":"https://orcid.org/0000-0002-3212-0934"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yihan Sun","raw_affiliation_strings":["University of California, Riverside, Riverside, USA"],"raw_orcid":"https://orcid.org/0000-0002-3212-0934","affiliations":[{"raw_affiliation_string":"University of California, Riverside, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004374151"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":0.4,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9983000159263611,"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.9972000122070312,"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/computer-science","display_name":"Computer science","score":0.7151499390602112},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5398982763290405},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.4462943971157074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4304262697696686},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4126974940299988},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18290024995803833},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08472749590873718}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7151499390602112},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5398982763290405},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.4462943971157074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4304262697696686},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4126974940299988},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18290024995803833},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08472749590873718},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3626183.3659958","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3626183.3659958","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 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2404.16314","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2404.16314","pdf_url":"https://arxiv.org/pdf/2404.16314","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3626183.3659958","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3626183.3659958","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 36th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6100000143051147,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1502965076","display_name":"CAREER: Efficient Algorithms for Modern Computer Architecture","funder_award_id":"2339310","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2184543250","display_name":null,"funder_award_id":"CCF-2103483, IIS-2227669, CCF-2238358, CCF-2339310","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"},{"id":"https://openalex.org/G3034567831","display_name":"III: Small: Rethinking the Data Organization and Lifecycle in LSM Storage Systems","funder_award_id":"2227669","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8120229700","display_name":"CAREER: Parallel Algorithms: Theory for Practice","funder_award_id":"2238358","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/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":64,"referenced_works":["https://openalex.org/W15599352","https://openalex.org/W1887778146","https://openalex.org/W1890530603","https://openalex.org/W1970171209","https://openalex.org/W1976888542","https://openalex.org/W1977304153","https://openalex.org/W1980516134","https://openalex.org/W1987042978","https://openalex.org/W1988325634","https://openalex.org/W1989402077","https://openalex.org/W1992904575","https://openalex.org/W1994172977","https://openalex.org/W1999038556","https://openalex.org/W2004985727","https://openalex.org/W2009319645","https://openalex.org/W2014497078","https://openalex.org/W2015784096","https://openalex.org/W2016559894","https://openalex.org/W2016871180","https://openalex.org/W2020600762","https://openalex.org/W2021008769","https://openalex.org/W2023417651","https://openalex.org/W2023893309","https://openalex.org/W2027506564","https://openalex.org/W2033751470","https://openalex.org/W2047162848","https://openalex.org/W2055257826","https://openalex.org/W2057640376","https://openalex.org/W2059310886","https://openalex.org/W2060108852","https://openalex.org/W2065954102","https://openalex.org/W2070320107","https://openalex.org/W2072458248","https://openalex.org/W2082378428","https://openalex.org/W2087817903","https://openalex.org/W2093803005","https://openalex.org/W2096827683","https://openalex.org/W2100398871","https://openalex.org/W2116078914","https://openalex.org/W2124115696","https://openalex.org/W2152978478","https://openalex.org/W2160169271","https://openalex.org/W2162744351","https://openalex.org/W2164498514","https://openalex.org/W2278224729","https://openalex.org/W2536320597","https://openalex.org/W2626928698","https://openalex.org/W2711285122","https://openalex.org/W2738668855","https://openalex.org/W2914766286","https://openalex.org/W2952534071","https://openalex.org/W2973204152","https://openalex.org/W2990771800","https://openalex.org/W3037464308","https://openalex.org/W3041171185","https://openalex.org/W3041215255","https://openalex.org/W3088152573","https://openalex.org/W3161374268","https://openalex.org/W4237877977","https://openalex.org/W4285005306","https://openalex.org/W4366572218","https://openalex.org/W4378895377","https://openalex.org/W4395686808","https://openalex.org/W6601375265"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052","https://openalex.org/W2382290278","https://openalex.org/W4395014643"],"abstract_inverted_index":{"The":[0],"idea":[1],"of":[2,14],"dynamic":[3],"programming":[4],"(DP),":[5],"proposed":[6],"by":[7,44],"Bellman":[8],"in":[9,21],"the":[10,15,40,51,95],"1950s,":[11],"is":[12,42],"one":[13],"most":[16,46],"important":[17],"algorithmic":[18],"techniques.":[19],"However,":[20],"parallel,":[22],"many":[23,61],"fundamental":[24],"and":[25,32,72],"sequentially":[26],"simple":[27],"problems":[28],"become":[29],"more":[30],"challenging,":[31],"open":[33],"to":[34,93],"a":[35,47,90],"(nearly)":[36],"work-efficient":[37],"solution":[38],"(i.e.,":[39],"work":[41,75,97],"off":[43],"at":[45],"polylogarithmic":[48],"factor":[49],"over":[50],"best":[52],"sequential":[53,57],"solution).":[54],"In":[55],"fact,":[56],"DP":[58],"algorithms":[59],"employ":[60],"advanced":[62],"optimizations":[63,81],"such":[64,80],"as":[65],"decision":[66],"monotonicity":[67],"or":[68],"special":[69],"data":[70],"structures,":[71],"achieve":[73,94],"better":[74],"than":[76],"straightforward":[77],"solutions.":[78],"Many":[79],"are":[82],"inherently":[83],"sequential,":[84],"which":[85],"creates":[86],"extra":[87],"challenges":[88],"for":[89],"parallel":[91],"algorithm":[92],"same":[96],"bound.":[98]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2025-10-10T00:00:00"}