{"id":"https://openalex.org/W2094665475","doi":"https://doi.org/10.1080/01495730108935274","title":"LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS","display_name":"LINEAR ARRAY FOR A CLASS OF NON UNIFORM RECURRENCE EQUATIONS","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2094665475","doi":"https://doi.org/10.1080/01495730108935274","mag":"2094665475"},"language":"en","primary_location":{"id":"doi:10.1080/01495730108935274","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935274","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5013306341","display_name":"Stefka Fidanova","orcid":"https://orcid.org/0000-0002-8484-5849"},"institutions":[{"id":"https://openalex.org/I24768866","display_name":"Bulgarian Academy of Sciences","ror":"https://ror.org/01x8hew03","country_code":"BG","type":"funder","lineage":["https://openalex.org/I24768866"]}],"countries":["BG"],"is_corresponding":true,"raw_author_name":"STEFKA FIDANOVA","raw_affiliation_strings":["\n                   \n               CLPP, Bulgarian Academy of Sciences, Acad. G. Bonchev str. BI.25A, Sofia, 1113, Bulgaria","CLPP, Bulgarian Academy of Sciences , Acad. G. Bonchev str. BI.25A, Sofia, 1113, Bulgaria"],"affiliations":[{"raw_affiliation_string":"\n                   \n               CLPP, Bulgarian Academy of Sciences, Acad. G. Bonchev str. BI.25A, Sofia, 1113, Bulgaria","institution_ids":["https://openalex.org/I24768866"]},{"raw_affiliation_string":"CLPP, Bulgarian Academy of Sciences , Acad. G. Bonchev str. BI.25A, Sofia, 1113, Bulgaria","institution_ids":["https://openalex.org/I24768866"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013306341"],"corresponding_institution_ids":["https://openalex.org/I24768866"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21470869,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"4","first_page":"273","last_page":"281"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9894000291824341,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9868999719619751,"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/polygon-mesh","display_name":"Polygon mesh","score":0.7175537347793579},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.581336498260498},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5078120827674866},{"id":"https://openalex.org/keywords/systolic-array","display_name":"Systolic array","score":0.501417875289917},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49055665731430054},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.47328823804855347},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4151933789253235},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3901209235191345},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35328808426856995},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0696357786655426}],"concepts":[{"id":"https://openalex.org/C31487907","wikidata":"https://www.wikidata.org/wiki/Q1154597","display_name":"Polygon mesh","level":2,"score":0.7175537347793579},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.581336498260498},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5078120827674866},{"id":"https://openalex.org/C150741067","wikidata":"https://www.wikidata.org/wiki/Q2377218","display_name":"Systolic array","level":3,"score":0.501417875289917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49055665731430054},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.47328823804855347},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4151933789253235},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3901209235191345},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35328808426856995},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0696357786655426},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01495730108935274","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935274","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1978530168","https://openalex.org/W2011039300","https://openalex.org/W2049885139","https://openalex.org/W2066671865","https://openalex.org/W2081963429","https://openalex.org/W2112971881","https://openalex.org/W2158217275","https://openalex.org/W2336259629","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W1557607869","https://openalex.org/W2366350639","https://openalex.org/W2079401649","https://openalex.org/W2028455732","https://openalex.org/W4313703117","https://openalex.org/W1993738197","https://openalex.org/W2087496541","https://openalex.org/W2108615321","https://openalex.org/W1984758362","https://openalex.org/W2085564391"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"a":[5,49],"new":[6],"scheduling":[7,50],"algorithm":[8,51],"to":[9,27],"solve":[10],"the":[11,19,29,36,41,56],"class":[12],"of":[13,35,40],"non":[14],"uniform":[15],"recurrence":[16],"equations":[17],"on":[18,55],"linear":[20,57],"systolic":[21],"array.":[22],"The":[23],"main":[24],"idea":[25],"is":[26,43],"use":[28],"fact":[30],"that":[31],"data":[32],"dependency":[33],"graph":[34],"dynamic":[37],"programming":[38],"function":[39,62],"problem":[42],"an":[44,60,64],"irregular":[45,53],"mesh.":[46],"We":[47],"propose":[48],"for":[52,67],"meshes":[54],"array":[58],"by":[59],"allocation":[61],"and":[63],"initial":[65],"time":[66],"each":[68],"node.":[69]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}