{"id":"https://openalex.org/W2079697168","doi":"https://doi.org/10.1109/tc.1983.1676223","title":"Binary Trees and Parallel Scheduling Algorithms","display_name":"Binary Trees and Parallel Scheduling Algorithms","publication_year":1983,"publication_date":"1983-03-01","ids":{"openalex":"https://openalex.org/W2079697168","doi":"https://doi.org/10.1109/tc.1983.1676223","mag":"2079697168"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1983.1676223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1983.1676223","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5097667645","display_name":"Dekel","orcid":null},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]},{"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":"Dekel","raw_affiliation_strings":["Program in Computer Science, University of Texas","Program in Computer Science, University of Texas, Dallas, Richardson, TX, USA"],"affiliations":[{"raw_affiliation_string":"Program in Computer Science, University of Texas","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Program in Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024208895","display_name":"Sahni","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sahni","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5097667645"],"corresponding_institution_ids":["https://openalex.org/I162577319","https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":13.5195,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.98814001,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-32","issue":"3","first_page":"307","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9994000196456909,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9983999729156494,"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.9955999851226807,"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/computer-science","display_name":"Computer science","score":0.7755350470542908},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6930134296417236},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6291034817695618},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.6117095351219177},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5796107053756714},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5615426301956177},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5615308880805969},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5572888851165771},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5553398728370667},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5297319293022156},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.5176230072975159},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.49447035789489746},{"id":"https://openalex.org/keywords/analysis-of-parallel-algorithms","display_name":"Analysis of parallel algorithms","score":0.49389344453811646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4464711546897888},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4387647807598114},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.19779229164123535},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15753287076950073},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.14488735795021057},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10247355699539185},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06872522830963135}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7755350470542908},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6930134296417236},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6291034817695618},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.6117095351219177},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5796107053756714},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5615426301956177},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5615308880805969},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5572888851165771},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5553398728370667},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5297319293022156},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.5176230072975159},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.49447035789489746},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.49389344453811646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4464711546897888},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4387647807598114},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.19779229164123535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15753287076950073},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.14488735795021057},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10247355699539185},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06872522830963135}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1983.1676223","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1983.1676223","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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":37,"referenced_works":["https://openalex.org/W57138151","https://openalex.org/W230140535","https://openalex.org/W331797721","https://openalex.org/W1490289901","https://openalex.org/W1493041473","https://openalex.org/W1554451661","https://openalex.org/W1851212222","https://openalex.org/W1969370624","https://openalex.org/W1971869874","https://openalex.org/W1972897119","https://openalex.org/W1974776021","https://openalex.org/W1974784305","https://openalex.org/W1976284552","https://openalex.org/W1976479454","https://openalex.org/W1980289219","https://openalex.org/W1982291599","https://openalex.org/W1988328380","https://openalex.org/W1995782589","https://openalex.org/W2005874499","https://openalex.org/W2010484711","https://openalex.org/W2029342163","https://openalex.org/W2030829902","https://openalex.org/W2046565312","https://openalex.org/W2047528205","https://openalex.org/W2054806836","https://openalex.org/W2055869266","https://openalex.org/W2064687921","https://openalex.org/W2066104460","https://openalex.org/W2066356146","https://openalex.org/W2081568423","https://openalex.org/W2081942300","https://openalex.org/W2090533339","https://openalex.org/W2121663287","https://openalex.org/W2130566259","https://openalex.org/W2141389982","https://openalex.org/W3027900649","https://openalex.org/W6680874277"],"related_works":["https://openalex.org/W2077383771","https://openalex.org/W3023862473","https://openalex.org/W3023431502","https://openalex.org/W2151677136","https://openalex.org/W2135212710","https://openalex.org/W3013722670","https://openalex.org/W3022865202","https://openalex.org/W2949895650","https://openalex.org/W2040528856","https://openalex.org/W2079697168"],"abstract_inverted_index":{"This":[0],"paper":[1],"examines":[2],"the":[3,9,46],"use":[4],"of":[5,11],"binary":[6,16,39,47],"trees":[7,40],"in":[8,37],"design":[10,54],"efficient":[12,20],"parallel":[13,31,42,57],"algorithms.":[14,58],"Using":[15],"trees,":[17],"we":[18],"develop":[19],"algorithms":[21],"for":[22,30,41,56],"several":[23],"scheduling":[24],"problems.":[25],"The":[26],"shared":[27],"memory":[28],"model":[29],"computation":[32],"is":[33,49],"used.":[34],"Our":[35],"success":[36],"using":[38],"computations,":[43],"indicates":[44],"that":[45],"tree":[48],"an":[50],"important":[51],"and":[52],"useful":[53],"tool":[55]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}