{"id":"https://openalex.org/W2033438588","doi":"https://doi.org/10.1080/10637199808947386","title":"EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS","display_name":"EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2033438588","doi":"https://doi.org/10.1080/10637199808947386","mag":"2033438588"},"language":"en","primary_location":{"id":"doi:10.1080/10637199808947386","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199808947386","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"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","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","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/A5013486678","display_name":"Jean\u2010Fr\u00e9d\u00e9ric Myoupo","orcid":"https://orcid.org/0000-0003-3657-2556"},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Fr\u00e9d\u00e9ric Myoupo","raw_affiliation_strings":["LaRIA: Laboraioire de Recherche en Informatique dapos;Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, Amiens, 80000, France","Amiens, Universit\u00e9 de Picardie Jules Verne, CURI , 5 rue du Moulin Neuf, Amiens, 80000, France","LaRIA: Laboraioire de Recherche en Informatique dapos"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaRIA: Laboraioire de Recherche en Informatique dapos;Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, Amiens, 80000, France","institution_ids":["https://openalex.org/I4647051"]},{"raw_affiliation_string":"Amiens, Universit\u00e9 de Picardie Jules Verne, CURI , 5 rue du Moulin Neuf, Amiens, 80000, France","institution_ids":["https://openalex.org/I4647051"]},{"raw_affiliation_string":"LaRIA: Laboraioire de Recherche en Informatique dapos","institution_ids":["https://openalex.org/I4210144804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112811055","display_name":"David Sem\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]},{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"David Sem\u00e9","raw_affiliation_strings":["LaRIA: Laboraioire de Recherche en Informatique dapos;Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, Amiens, 80000, France","Amiens, Universit\u00e9 de Picardie Jules Verne, CURI , 5 rue du Moulin Neuf, Amiens, 80000, France","LaRIA: Laboraioire de Recherche en Informatique dapos"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LaRIA: Laboraioire de Recherche en Informatique dapos;Amiens, Universit\u00e9 de Picardie Jules Verne, CURI, 5 rue du Moulin Neuf, Amiens, 80000, France","institution_ids":["https://openalex.org/I4647051"]},{"raw_affiliation_string":"Amiens, Universit\u00e9 de Picardie Jules Verne, CURI , 5 rue du Moulin Neuf, Amiens, 80000, France","institution_ids":["https://openalex.org/I4647051"]},{"raw_affiliation_string":"LaRIA: Laboraioire de Recherche en Informatique dapos","institution_ids":["https://openalex.org/I4210144804"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5612,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78525685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"3","first_page":"187","last_page":"202"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9959999918937683,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9930999875068665,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7938284277915955},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.7265957593917847},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6712397336959839},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6400531530380249},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6060023903846741},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5751075744628906},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.554888129234314},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.5297385454177856},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49981045722961426},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.4613722562789917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4583929777145386},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4452551007270813},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.43124687671661377},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4160325527191162},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33349156379699707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24803030490875244}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7938284277915955},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.7265957593917847},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6712397336959839},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6400531530380249},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6060023903846741},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5751075744628906},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.554888129234314},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.5297385454177856},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49981045722961426},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.4613722562789917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4583929777145386},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4452551007270813},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.43124687671661377},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4160325527191162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33349156379699707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24803030490875244},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10637199808947386","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199808947386","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"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","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03238068v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03238068","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Parallel, Emergent and Distributed Systems, 2000, 14 (3), pp.187-202. ⟨10.1080/10637199808947386⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W181802644","https://openalex.org/W1487872891","https://openalex.org/W1556104144","https://openalex.org/W1562115776","https://openalex.org/W1948141881","https://openalex.org/W1966989285","https://openalex.org/W1990061958","https://openalex.org/W2004333039","https://openalex.org/W2023784545","https://openalex.org/W2023893309","https://openalex.org/W2027506564","https://openalex.org/W2045542171","https://openalex.org/W2069893028","https://openalex.org/W2080063304","https://openalex.org/W2087191404","https://openalex.org/W2096827683","https://openalex.org/W2109560070","https://openalex.org/W2147543351","https://openalex.org/W2162744351"],"related_works":["https://openalex.org/W1540010783","https://openalex.org/W3022573534","https://openalex.org/W1746697883","https://openalex.org/W4225868058","https://openalex.org/W4389489786","https://openalex.org/W2152064395","https://openalex.org/W4289596129","https://openalex.org/W2969919693","https://openalex.org/W3083981518","https://openalex.org/W3094761360"],"abstract_inverted_index":{"Recently":[0],"Akl":[1],"et":[2],"al.":[3],"introduced":[4],"a":[5,129],"new":[6],"model":[7,41],"of":[8,79,98,106,118,132,138,148],"parallel":[9,48],"computation,":[10],"called":[11],"BSR":[12,75,104,126,141],"(broadcasting":[13],"with":[14,128],"selective":[15],"reduction)":[16],"and":[17,28,50,67,93,150],"showed":[18],"that":[19],"it":[20],"is":[21,87,115,135],"more":[22,32],"powerful":[23],"than":[24,36],"any":[25],"CRCW":[26],"PRAM":[27],"yet":[29],"requires":[30],"no":[31],"resources":[33],"for":[34,143],"implementation":[35],"even":[37],"EREW":[38],"PRAM.":[39],"The":[40,77],"allows":[42],"constant":[43,58,130],"time":[44,59],"solutions":[45,124],"to":[46,61,82,153],"sorting,":[47],"prefix":[49],"other":[51],"problems.":[52],"In":[53],"this":[54],"paper,":[55],"we":[56],"describe":[57],"solution":[60,105],"the":[62,74,84,96,99,107,116,119,144],"longest":[63,68],"common":[64],"subsequence":[65,70],"(LCS)":[66],"increasing":[69],"(LIS)":[71],"problems":[72],"using":[73],"model.":[76],"number":[78,131],"processors":[80,112],"used":[81],"solve":[83],"LCS":[85,145],"problem":[86,109],"O(N":[88],"\u00d7":[89],"M)":[90],"(where":[91,113],"N":[92,114],"M":[94],"are":[95],"length":[97,117],"two":[100,123],"input":[101,120],"sequences).":[102],"Our":[103],"LIS":[108],"needs":[110],"O(N)":[111],"sequence).":[121],"These":[122],"use":[125],"instructions":[127],"selections.":[133,160],"It":[134],"an":[136],"improvement":[137],"our":[139],"former":[140],"algorithm":[142],"in":[146],"(Journal":[147],"Parallel":[149],"Distributed":[151],"Computing,":[152],"appear)":[154],"which":[155],"uses":[156],"3N":[157],"+":[158],"3":[159]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}