{"id":"https://openalex.org/W2013601089","doi":"https://doi.org/10.1080/00207169208804035","title":"Systolic algorithms for the dynamic programming problem","display_name":"Systolic algorithms for the dynamic programming problem","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2013601089","doi":"https://doi.org/10.1080/00207169208804035","mag":"2013601089"},"language":"en","primary_location":{"id":"doi:10.1080/00207169208804035","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169208804035","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041509287","display_name":"Hassen Dhrif","orcid":"https://orcid.org/0000-0002-3842-1762"},"institutions":[{"id":"https://openalex.org/I145608581","display_name":"University of Miami","ror":"https://ror.org/02dgjyy92","country_code":"US","type":"education","lineage":["https://openalex.org/I145608581"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hassen Dhrif","raw_affiliation_strings":["Department of Mathematics and Computer Science , University of Miami , Coral Gables, FL, 33124"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , University of Miami , Coral Gables, FL, 33124","institution_ids":["https://openalex.org/I145608581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101425689","display_name":"Dilip Sarkar","orcid":"https://orcid.org/0000-0001-9102-4291"},"institutions":[{"id":"https://openalex.org/I145608581","display_name":"University of Miami","ror":"https://ror.org/02dgjyy92","country_code":"US","type":"education","lineage":["https://openalex.org/I145608581"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dilip Sarkar","raw_affiliation_strings":["Department of Mathematics and Computer Science , University of Miami , Coral Gables, FL, 33124"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , University of Miami , Coral Gables, FL, 33124","institution_ids":["https://openalex.org/I145608581"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041509287"],"corresponding_institution_ids":["https://openalex.org/I145608581"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.18243513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"41","issue":"3-4","first_page":"151","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9902999997138977,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9902999997138977,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9835000038146973,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9688000082969666,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.772972822189331},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6996854543685913},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.543246865272522},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4467311203479767},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42095500230789185},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41201555728912354},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37775182723999023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3523593544960022}],"concepts":[{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.772972822189331},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6996854543685913},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.543246865272522},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4467311203479767},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42095500230789185},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41201555728912354},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37775182723999023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3523593544960022}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169208804035","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169208804035","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W260960547","https://openalex.org/W1589943916","https://openalex.org/W1975558464","https://openalex.org/W2017369466","https://openalex.org/W2047162848","https://openalex.org/W2079914542","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W2921847140","https://openalex.org/W4252450337"],"related_works":["https://openalex.org/W2115140794","https://openalex.org/W2041120224","https://openalex.org/W2070865675","https://openalex.org/W4212854884","https://openalex.org/W1970073092","https://openalex.org/W2107423006","https://openalex.org/W1657646819","https://openalex.org/W338671845","https://openalex.org/W2054653010","https://openalex.org/W2070426974"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"parallel":[3],"algorithms":[4,68],"for":[5],"the":[6],"dynamic":[7,14],"programming":[8,15],"problem":[9,16],"on":[10,32,51],"systolic":[11],"arrays.":[12],"The":[13],"when":[17],"implemented":[18],"sequentially":[19],"takes":[20],"O(n":[21,38,61],"3)":[22],"time":[23,58,74],"steps.":[24],"In":[25],"this":[26],"paper,":[27],"an":[28,47],"algorithm":[29,48],"that":[30,49],"runs":[31,50],"a":[33,52],"linear":[34],"array":[35],"machine":[36],"in":[37,56,71],"2)":[39,62],"time,":[40],"using":[41,60],"O(n)":[42,57],"processors":[43,63],"is":[44,64],"presented.":[45],"Also":[46],"mesh":[53],"connected":[54],"computer":[55],"steps,":[59],"being":[65],"studied.":[66],"Both":[67],"are":[69],"optimal":[70],"terms":[72],"of":[73],"and":[75],"cost.":[76]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}