{"id":"https://openalex.org/W2559098419","doi":"https://doi.org/10.4018/ijghpc.2016100104","title":"High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem","display_name":"High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2559098419","doi":"https://doi.org/10.4018/ijghpc.2016100104","mag":"2559098419"},"language":"en","primary_location":{"id":"doi:10.4018/ijghpc.2016100104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijghpc.2016100104","pdf_url":null,"source":{"id":"https://openalex.org/S43307632","display_name":"International Journal of Grid and High Performance Computing","issn_l":"1938-0259","issn":["1938-0259","1938-0267"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Grid and High Performance Computing","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/A5039803287","display_name":"Vianney Kengne Tchendji","orcid":"https://orcid.org/0000-0003-3836-1859"},"institutions":[{"id":"https://openalex.org/I178331978","display_name":"Universit\u00e9 de Dschang","ror":"https://ror.org/0566t4z20","country_code":"CM","type":"education","lineage":["https://openalex.org/I178331978"]}],"countries":["CM"],"is_corresponding":false,"raw_author_name":"Vianney Kengne Tchendji","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Dschang, Dschang, Cameroon"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Dschang, Dschang, Cameroon","institution_ids":["https://openalex.org/I178331978"]}]},{"author_position":"middle","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/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 Frederic Myoupo","raw_affiliation_strings":["University of Picardie Jules Verne, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Picardie Jules Verne, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001957846","display_name":"Gilles Dequen","orcid":"https://orcid.org/0000-0001-7497-1182"},"institutions":[{"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":"Gilles Dequen","raw_affiliation_strings":["University of Picardie Jules Verne, Amiens, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Picardie Jules Verne, Amiens, France","institution_ids":["https://openalex.org/I4647051"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2993,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.87571817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"4","first_page":"55","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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":0.9994999766349792,"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.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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/computer-science","display_name":"Computer science","score":0.7584137916564941},{"id":"https://openalex.org/keywords/granularity","display_name":"Granularity","score":0.7077111601829529},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6212743520736694},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5380138754844666},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4952310621738434},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49073994159698486},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4688495397567749},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.46314311027526855},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44709792733192444},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43922606110572815},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"Depth-first search","score":0.42693841457366943},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.42047688364982605},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.4132137596607208},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.26081526279449463},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.22550854086875916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1883009672164917}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7584137916564941},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.7077111601829529},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6212743520736694},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5380138754844666},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4952310621738434},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49073994159698486},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4688495397567749},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.46314311027526855},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44709792733192444},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43922606110572815},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.42693841457366943},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.42047688364982605},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4132137596607208},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.26081526279449463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.22550854086875916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1883009672164917},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/ijghpc.2016100104","is_oa":false,"landing_page_url":"https://doi.org/10.4018/ijghpc.2016100104","pdf_url":null,"source":{"id":"https://openalex.org/S43307632","display_name":"International Journal of Grid and High Performance Computing","issn_l":"1938-0259","issn":["1938-0259","1938-0267"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Grid and High Performance Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03237645v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03237645","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 Grid and High Performance Computing, 2016, 8 (4), pp.55-77. ⟨10.4018/IJGHPC.2016100104⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W34110429","https://openalex.org/W150130412","https://openalex.org/W186906173","https://openalex.org/W580366031","https://openalex.org/W1522694128","https://openalex.org/W1560467792","https://openalex.org/W1590304071","https://openalex.org/W1655990431","https://openalex.org/W1973463167","https://openalex.org/W2001548961","https://openalex.org/W2005983231","https://openalex.org/W2014656875","https://openalex.org/W2033751470","https://openalex.org/W2045271686","https://openalex.org/W2047162848","https://openalex.org/W2060883739","https://openalex.org/W2068373264","https://openalex.org/W2070320107","https://openalex.org/W2086207029","https://openalex.org/W2091597871","https://openalex.org/W2094217008","https://openalex.org/W2099831495","https://openalex.org/W2117489852","https://openalex.org/W2121653690","https://openalex.org/W2123553577","https://openalex.org/W2144663105","https://openalex.org/W2146311202","https://openalex.org/W2147602940","https://openalex.org/W2164498514","https://openalex.org/W2752885492"],"related_works":["https://openalex.org/W2390861104","https://openalex.org/W245081068","https://openalex.org/W2949377111","https://openalex.org/W2133393318","https://openalex.org/W151008969","https://openalex.org/W77087835","https://openalex.org/W1998170879","https://openalex.org/W2049713017","https://openalex.org/W2116714544","https://openalex.org/W1997323498"],"abstract_inverted_index":{"In":[0,36,85],"this":[1,37,193],"paper,":[2],"the":[3,6,12,29,70,73,87,99,142,154,161,168,175,181,188,195,209],"authors":[4,88,158],"highlight":[5],"existence":[7],"of":[8,18,24,48,72,101,116,144,183,190,203],"close":[9],"relations":[10],"between":[11],"execution":[13,127,138],"time,":[14,139],"efficiency":[15],"and":[16,65,104,111,126,147,179],"number":[17],"communication":[19,124,148],"rounds":[20,125],"in":[21,63,94,167],"a":[22,106,118,164,201],"family":[23,47],"CGM-based":[25,120,205],"parallel":[26,121,206],"algorithms":[27,53,77,92,207],"for":[28,208],"optimal":[30],"binary":[31],"search":[32],"tree":[33],"problem":[34,176],"(OBST).":[35],"case,":[38],"these":[39],"three":[40],"parameters":[41],"cannot":[42],"be":[43],"simultaneously":[44],"improved.":[45],"The":[46,113,157],"CGM":[49,76],"(Coarse":[50],"Grained":[51],"Multicomputer)":[52],"they":[54,132,171],"derive":[55,200],"is":[56,69,98,105,194],"based":[57],"on":[58,110],"Knuth's":[59],"sequential":[60],"solution":[61],"running":[62],"time":[64],"space,":[66],"where":[67],"n":[68],"size":[71],"problem.":[74,211],"These":[75],"use":[78,172],"p":[79],"processors,":[80],"each":[81,91,184],"with":[82,95,123,136],"local":[83],"memory.":[84],"general,":[86],"show":[89,159],"that":[90,108,160],"runs":[93],"communications":[96],"rounds.":[97],"granularity":[100,162],"their":[102,191],"model,":[103],"parameter":[107],"depends":[109],".":[112],"special":[114],"case":[115],"yields":[117],"load-balanced":[119],"algorithm":[122,135],"steps.":[128],"Alternately,":[129],"if":[130],",":[131,141],"obtain":[133],"another":[134],"better":[137,152],"say":[140],"absence":[143],"any":[145],"load-balancing":[146],"rounds,":[149],"i.e.,":[150],"not":[151],"than":[153],"first":[155,196],"algorithm.":[156,186],"has":[163],"crucial":[165],"role":[166],"different":[169],"techniques":[170],"to":[173,177,199],"partition":[174],"solve":[178],"study":[180],"impact":[182],"scheduling":[185],"To":[187],"best":[189],"knowledge,":[192],"unified":[197],"method":[198],"set":[202],"parameter-dependent":[204],"OBST":[210]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-11T06:19:23.411458","created_date":"2025-10-10T00:00:00"}