{"id":"https://openalex.org/W3134889255","doi":"https://doi.org/10.1145/3491003.3491019","title":"A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems","display_name":"A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems","publication_year":2022,"publication_date":"2022-01-04","ids":{"openalex":"https://openalex.org/W3134889255","doi":"https://doi.org/10.1145/3491003.3491019","mag":"3134889255"},"language":"en","primary_location":{"id":"doi:10.1145/3491003.3491019","doi":"https://doi.org/10.1145/3491003.3491019","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3491003.3491019","pdf_url":null,"source":{"id":"https://openalex.org/S7407088154","display_name":"International Conference on Distributed Computing and Networking (ICDCN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2103.06264","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061474994","display_name":"Vijay K. Garg","orcid":"https://orcid.org/0000-0002-5797-4389","observed_orcids":["https://orcid.org/0000-0002-5797-4389"]},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Vijay Garg","raw_affiliation_strings":["The University of Texas at Austin, United States","University of Texas at Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Texas at Austin, United States","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061474994"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":1.8949,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.83872951,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"72","last_page":"76"},"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.9208999872207642,"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.9208999872207642,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.03920000046491623,"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.004600000102072954,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.8259999752044678},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9570000171661377},{"id":"https://openalex.org/keywords/optimal-binary-search-trees","display_name":"optimal binary search trees","score":0.9729999899864197},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"knapsack problem","score":1.0},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":0.7630000114440918},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"distributed computing","score":0.5929999947547913},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8849999904632568},{"id":"https://openalex.org/keywords/stable-marriage-problem","display_name":"stable marriage problem","score":0.9079999923706055}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.6934964656829834},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5648306608200073},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5379458665847778},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5290718674659729},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.500028133392334},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4712897837162018},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46364107728004456},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.46003612875938416},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.44267719984054565},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4167183041572571},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4136742353439331},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.41148242354393005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33481985330581665},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.30342572927474976},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.25328630208969116},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.20109325647354126},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.1579391360282898},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3491003.3491019","doi":"https://doi.org/10.1145/3491003.3491019","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3491003.3491019","pdf_url":null,"source":{"id":"https://openalex.org/S7407088154","display_name":"International Conference on Distributed Computing and Networking (ICDCN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 23rd International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2103.06264","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2103.06264","pdf_url":"https://arxiv.org/pdf/2103.06264","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,"listed_in":[],"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"},{"id":"mag:3134889255","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2103.06264.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,"listed_in":[],"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.2103.06264","doi":"https://doi.org/10.48550/arxiv.2103.06264","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2103.06264","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,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2103.06264","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2103.06264","pdf_url":"https://arxiv.org/pdf/2103.06264","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,"listed_in":[],"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"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G168647506","display_name":null,"funder_award_id":"CNS-1812349","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/W3134889255.pdf","grobid_xml":"https://content.openalex.org/works/W3134889255.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W73149113","https://openalex.org/W1480679046","https://openalex.org/W1870908483","https://openalex.org/W1899379166","https://openalex.org/W1978651921","https://openalex.org/W2026891055","https://openalex.org/W2045492613","https://openalex.org/W2052995544","https://openalex.org/W2056653303","https://openalex.org/W2068373264","https://openalex.org/W2093397547","https://openalex.org/W2116078914","https://openalex.org/W2611804663","https://openalex.org/W3041066081","https://openalex.org/W4300550233","https://openalex.org/W4300885858"],"related_works":["https://openalex.org/W7204112033","https://openalex.org/W3041066081","https://openalex.org/W7136154251","https://openalex.org/W2155210577","https://openalex.org/W3211732596","https://openalex.org/W1953003771","https://openalex.org/W4247697132","https://openalex.org/W2906305178","https://openalex.org/W2047162848","https://openalex.org/W7098978619"],"abstract_inverted_index":{"It":[0],"has":[1],"been":[2],"shown":[3],"that":[4,51],"the":[5,19,23,28,38,52,56,60,67,71,78,87],"parallel":[6,39,93],"Lattice":[7],"Linear":[8],"Predicate":[9],"(LLP)":[10],"algorithm":[11,41,54,72,95],"solves":[12,55],"many":[13,43],"combinatorial":[14],"optimization":[15],"problems":[16,83],"such":[17],"as":[18,86],"shortest":[20],"path":[21],"problem,":[22,59,65],"stable":[24],"marriage":[25],"problem":[26],"and":[27,66],"market":[29],"clearing":[30],"price":[31],"problem.":[32,69],"In":[33,47],"this":[34],"paper,":[35],"we":[36,49],"give":[37],"LLP":[40,53,94],"for":[42],"dynamic":[44],"programming":[45],"problems.":[46],"particular,":[48],"show":[50],"longest":[57],"subsequence":[58],"optimal":[61],"binary":[62],"search":[63],"tree":[64],"knapsack":[68],"Furthermore,":[70],"can":[73],"be":[74],"used":[75],"to":[76],"solve":[77],"constrained":[79],"versions":[80],"of":[81,111],"these":[82],"so":[84],"long":[85],"constraints":[88],"are":[89],"lattice":[90],"linear.":[91],"The":[92],"works":[96],"correctly":[97],"in":[98],"a":[99,104,112,116],"distributed":[100],"system":[101],"setting":[102],"where":[103],"processor":[105],"may":[106],"use":[107],"an":[108],"older":[109],"value":[110],"variable":[113],"stored":[114],"at":[115],"different":[117],"processor.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2021-03-15T00:00:00"}