{"id":"https://openalex.org/W2057524940","doi":"https://doi.org/10.1109/tse.1986.6312885","title":"Derivation of a parallel algorithm for balancing binary trees","display_name":"Derivation of a parallel algorithm for balancing binary trees","publication_year":1986,"publication_date":"1986-03-01","ids":{"openalex":"https://openalex.org/W2057524940","doi":"https://doi.org/10.1109/tse.1986.6312885","mag":"2057524940"},"language":"en","primary_location":{"id":"doi:10.1109/tse.1986.6312885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tse.1986.6312885","pdf_url":null,"source":{"id":"https://openalex.org/S8351582","display_name":"IEEE Transactions on Software Engineering","issn_l":"0098-5589","issn":["0098-5589","1939-3520","2326-3881"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Software Engineering","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/A5082779936","display_name":"Abha Moitra","orcid":"https://orcid.org/0000-0002-7027-2082"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Abha Moitra","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY, USA","[Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"[Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA]","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107914936","display_name":"S. Sitharama Iyengar","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Sitharama Iyengar","raw_affiliation_strings":["Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA","Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, Baton Rouge, LA, USA","institution_ids":["https://openalex.org/I121820613"]},{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, Baton Rouge, LA 70803","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4173,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.84023049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"SE-12","issue":"3","first_page":"442","last_page":"449"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9980000257492065,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9923999905586243,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8373275995254517},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7108129858970642},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5979124307632446},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.577913224697113},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5404495000839233},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5173903703689575},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4643934369087219},{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.4413287341594696},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4228886365890503},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.38048601150512695},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13659319281578064}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8373275995254517},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7108129858970642},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5979124307632446},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.577913224697113},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5404495000839233},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5173903703689575},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4643934369087219},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.4413287341594696},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4228886365890503},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.38048601150512695},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13659319281578064},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tse.1986.6312885","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tse.1986.6312885","pdf_url":null,"source":{"id":"https://openalex.org/S8351582","display_name":"IEEE Transactions on Software Engineering","issn_l":"0098-5589","issn":["0098-5589","1939-3520","2326-3881"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","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 Software Engineering","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2462910436","https://openalex.org/W2056975861","https://openalex.org/W2363556447","https://openalex.org/W2089900921","https://openalex.org/W2501849745","https://openalex.org/W2539085113","https://openalex.org/W1510719821","https://openalex.org/W2011933350","https://openalex.org/W3169685561","https://openalex.org/W1978536651"],"abstract_inverted_index":{"A":[0],"recent":[1],"trend":[2],"in":[3,102],"program":[4],"methodologies":[5],"is":[6],"to":[7],"derive":[8,53,78],"efficient":[9,27],"parallel":[10,28,43,80],"programs":[11],"from":[12],"sequential":[13,23],"programs.":[14],"This":[15,94],"study":[16],"explores":[17],"the":[18,32,42,61,69,72,96],"question":[19],"of":[20,34,41,47,63,99],"transforming":[21],"a":[22,54,79,103],"algorithm":[24,29,44,58,81],"into":[25],"an":[26,88],"by":[30],"considering":[31],"problem":[33],"balancing":[35,57],"binary":[36],"search":[37],"trees.":[38],"The":[39,50],"derivation":[40],"makes":[45],"use":[46],"stepwise":[48],"refinement.":[49],"authors":[51],"first":[52],"new":[55],"iterative":[56],"that":[59,82],"exploits":[60],"similarity":[62],"point":[64],"restructuring":[65],"required":[66],"at":[67,71],"all":[68],"nodes":[70],"same":[73],"level.":[74],"From":[75],"this":[76],"they":[77],"has":[83],"time":[84],"complexity":[85],"O(1)":[86],"on":[87],"<i":[89],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[90],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">N</i>":[91],"-processor":[92],"configuration.":[93,105],"achieves":[95],"theoretical":[97],"limit":[98],"speedup":[100],"possible":[101],"multiprocessor":[104]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}