{"id":"https://openalex.org/W77087835","doi":"https://doi.org/10.1007/3-540-54029-6_198","title":"An optimal parallel algorithm to reconstruct a binary tree from its traversals","display_name":"An optimal parallel algorithm to reconstruct a binary tree from its traversals","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W77087835","doi":"https://doi.org/10.1007/3-540-54029-6_198","mag":"77087835"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-54029-6_198","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54029-6_198","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":"conference-paper","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/A5086528192","display_name":"Stephan Olariu","orcid":"https://orcid.org/0000-0002-3776-216X"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephan Olariu","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA, USA","Old Dominion University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Old Dominion University,","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001860021","display_name":"Michael Overstreet","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Overstreet","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA, USA","Old Dominion University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Old Dominion University,","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111465174","display_name":"Zhaofang Wen","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zhaofang Wen","raw_affiliation_strings":["Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA, USA","Old Dominion University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, 23529-0162, Norfolk, VA, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Old Dominion University,","institution_ids":["https://openalex.org/I81365321"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I81365321"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"484","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/tree-traversal","display_name":"Tree traversal","score":0.9441208839416504},{"id":"https://openalex.org/keywords/preorder","display_name":"Preorder","score":0.8976098895072937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7578192353248596},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.7086278200149536},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.632262647151947},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6029518842697144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5958965420722961},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5439649820327759},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5371108651161194},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5245304703712463},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.5043066740036011},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4511061906814575},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44822460412979126},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4229852259159088},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4153740108013153},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4119224548339844},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34837234020233154},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3285195827484131},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.27878111600875854},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.251933753490448},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23257625102996826},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12637931108474731}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9441208839416504},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.8976098895072937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7578192353248596},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7086278200149536},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.632262647151947},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6029518842697144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5958965420722961},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5439649820327759},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5371108651161194},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5245304703712463},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.5043066740036011},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4511061906814575},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44822460412979126},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4229852259159088},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4153740108013153},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4119224548339844},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34837234020233154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3285195827484131},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.27878111600875854},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.251933753490448},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23257625102996826},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12637931108474731},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-54029-6_198","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54029-6_198","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W6968995","https://openalex.org/W1589721142","https://openalex.org/W1965333879","https://openalex.org/W1988727224","https://openalex.org/W1998478920","https://openalex.org/W2010148138","https://openalex.org/W2027679733","https://openalex.org/W2074456731","https://openalex.org/W2134008688","https://openalex.org/W2156372444","https://openalex.org/W2752853835","https://openalex.org/W2989713547"],"related_works":["https://openalex.org/W2949895650","https://openalex.org/W2026697457","https://openalex.org/W1624114741","https://openalex.org/W2501849745","https://openalex.org/W3022865202","https://openalex.org/W1510719821","https://openalex.org/W2181425632","https://openalex.org/W2010148138","https://openalex.org/W2366139181","https://openalex.org/W151008969"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}