{"id":"https://openalex.org/W2153955128","doi":"https://doi.org/10.1007/bfb0105139","title":"Binary trees and parallel scheduling algorithms","display_name":"Binary trees and parallel scheduling algorithms","publication_year":2007,"publication_date":"2007-06-12","ids":{"openalex":"https://openalex.org/W2153955128","doi":"https://doi.org/10.1007/bfb0105139","mag":"2153955128"},"language":"en","primary_location":{"id":"doi:10.1007/bfb0105139","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0105139","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5050148567","display_name":"Eliezer Dekel","orcid":"https://orcid.org/0000-0002-7265-2353"},"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":true,"raw_author_name":"Eliezer Dekel","raw_affiliation_strings":["University of Minnesota, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070824596","display_name":"Sartaj Sahni","orcid":"https://orcid.org/0000-0002-8129-1676"},"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":"Sartaj Sahni","raw_affiliation_strings":["University of Minnesota, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050148567"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.15379686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"480","last_page":"492"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9991999864578247,"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.9991999864578247,"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.9950000047683716,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9934999942779541,"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.7442072629928589},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.7063993215560913},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6076070070266724},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5944627523422241},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5538458228111267},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5379700064659119},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5301055908203125},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5201871395111084},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.498676061630249},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.48814496397972107},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.42768731713294983},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.42555999755859375},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.42020687460899353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3991076946258545},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.17629998922348022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16966864466667175},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.13019832968711853},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11340734362602234},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07037487626075745}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7442072629928589},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7063993215560913},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6076070070266724},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5944627523422241},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5538458228111267},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5379700064659119},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5301055908203125},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5201871395111084},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.498676061630249},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.48814496397972107},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.42768731713294983},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.42555999755859375},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.42020687460899353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3991076946258545},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.17629998922348022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16966864466667175},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.13019832968711853},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11340734362602234},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07037487626075745}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bfb0105139","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bfb0105139","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:ADA091572","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=ADA091572","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W57138151","https://openalex.org/W230140535","https://openalex.org/W250249669","https://openalex.org/W331797721","https://openalex.org/W1490289901","https://openalex.org/W1493041473","https://openalex.org/W1554451661","https://openalex.org/W1589616492","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/W1988328380","https://openalex.org/W1995782589","https://openalex.org/W2005874499","https://openalex.org/W2010484711","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/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/W2401610261","https://openalex.org/W3027900649","https://openalex.org/W3215372663","https://openalex.org/W6629292572","https://openalex.org/W6629652333","https://openalex.org/W6633204241","https://openalex.org/W6635362994","https://openalex.org/W6644040475","https://openalex.org/W6657665604","https://openalex.org/W6664127019","https://openalex.org/W6666975820"],"related_works":["https://openalex.org/W3169685561","https://openalex.org/W2077383771","https://openalex.org/W2501849745","https://openalex.org/W3023431502","https://openalex.org/W1979520615","https://openalex.org/W2135212710","https://openalex.org/W1510719821","https://openalex.org/W3022865202","https://openalex.org/W3013722670","https://openalex.org/W1973074590"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}