{"id":"https://openalex.org/W3041396523","doi":"https://doi.org/10.1145/3350755.3400229","title":"Reconstructing Binary Trees in Parallel","display_name":"Reconstructing Binary Trees in Parallel","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3041396523","doi":"https://doi.org/10.1145/3350755.3400229","mag":"3041396523"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400229","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400229","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400229","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400229","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001144174","display_name":"Ramtin Afshar","orcid":"https://orcid.org/0000-0003-4740-1234"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ramtin Afshar","raw_affiliation_strings":["University of California, Irvine, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034971300","display_name":"Michael T. Goodrich","orcid":"https://orcid.org/0000-0002-8943-191X"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael T. Goodrich","raw_affiliation_strings":["University of California, Irvine, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027078057","display_name":"Pedro Matias","orcid":"https://orcid.org/0000-0003-0664-9145"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pedro Matias","raw_affiliation_strings":["University of California, Irvine, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016046102","display_name":"Martha C. Osegueda","orcid":"https://orcid.org/0000-0002-1077-1074"},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martha C. Osegueda","raw_affiliation_strings":["University of California, Irvine, Irvine, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Irvine, Irvine, CA, USA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5001144174"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":0.4222,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67866598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"491","last_page":"492"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9919999837875366,"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/binary-tree","display_name":"Binary tree","score":0.7754842638969421},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6995868682861328},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6574404835700989},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6007978320121765},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.5630204081535339},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5629448890686035},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5393697023391724},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5187925696372986},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5119927525520325},{"id":"https://openalex.org/keywords/binary-expression-tree","display_name":"Binary expression tree","score":0.4805067777633667},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46549782156944275},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.461635559797287},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4435507655143738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2963055968284607},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.29005348682403564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28636622428894043},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.21123278141021729},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.15566757321357727},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.07314938306808472}],"concepts":[{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7754842638969421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6995868682861328},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6574404835700989},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6007978320121765},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.5630204081535339},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5629448890686035},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5393697023391724},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5187925696372986},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5119927525520325},{"id":"https://openalex.org/C166055160","wikidata":"https://www.wikidata.org/wiki/Q4913895","display_name":"Binary expression tree","level":3,"score":0.4805067777633667},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46549782156944275},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.461635559797287},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4435507655143738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2963055968284607},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.29005348682403564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28636622428894043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.21123278141021729},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.15566757321357727},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.07314938306808472},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3350755.3400229","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400229","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400229","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3350755.3400229","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3350755.3400229","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3350755.3400229","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6355202881","display_name":null,"funder_award_id":"1815073","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3041396523.pdf","grobid_xml":"https://content.openalex.org/works/W3041396523.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W2079970266","https://openalex.org/W2992953826"],"related_works":["https://openalex.org/W2077383771","https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2072924299","https://openalex.org/W1973074590","https://openalex.org/W2039536624","https://openalex.org/W1510719821","https://openalex.org/W2003946312","https://openalex.org/W3022865202","https://openalex.org/W1979520615"],"abstract_inverted_index":{"We":[0,16],"study":[1],"the":[2],"parallel":[3],"query":[4],"complexity":[5],"of":[6,31,36,44],"reconstructing":[7],"binary":[8,25],"trees":[9],"from":[10],"simple":[11],"queries":[12],"involving":[13],"their":[14],"nodes.":[15],"show":[17],"that":[18],"a":[19,24,28],"querier":[20],"can":[21],"efficiently":[22],"reconstruct":[23],"tree":[26],"with":[27,38],"logarithmic":[29],"number":[30,35],"rounds":[32],"and":[33],"quasilinear":[34],"queries,":[37],"high":[39],"probability,":[40],"for":[41],"various":[42],"types":[43],"queries.":[45]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}