{"id":"https://openalex.org/W2908910732","doi":"https://doi.org/10.1145/3288599.3288615","title":"Improving efficacy of concurrent internal binary search trees using local recovery","display_name":"Improving efficacy of concurrent internal binary search trees using local recovery","publication_year":2019,"publication_date":"2019-01-04","ids":{"openalex":"https://openalex.org/W2908910732","doi":"https://doi.org/10.1145/3288599.3288615","mag":"2908910732"},"language":"en","primary_location":{"id":"doi:10.1145/3288599.3288615","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3288599.3288615","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3288599.3288615","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","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/3288599.3288615","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051628289","display_name":"Arunmoezhi Ramachandran","orcid":"https://orcid.org/0000-0001-7532-8383"},"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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arunmoezhi Ramachandran","raw_affiliation_strings":["The University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas","institution_ids":["https://openalex.org/I162577319"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103161933","display_name":"Neeraj Mittal","orcid":"https://orcid.org/0000-0002-8734-1400"},"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"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neeraj Mittal","raw_affiliation_strings":["The University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"The University of Texas at Dallas","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051628289"],"corresponding_institution_ids":["https://openalex.org/I162577319"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01105709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"61","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9933000206947327,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9843999743461609,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7492620944976807},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7180436849594116},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.665233850479126},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.530419647693634},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5293120741844177},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5229609608650208},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5028662085533142},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4713434875011444},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46645301580429077},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.39956772327423096},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38315635919570923},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3298555612564087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21803069114685059},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14919427037239075}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7492620944976807},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7180436849594116},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.665233850479126},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.530419647693634},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5293120741844177},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5229609608650208},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5028662085533142},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4713434875011444},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46645301580429077},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.39956772327423096},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38315635919570923},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3298555612564087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21803069114685059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14919427037239075},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3288599.3288615","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3288599.3288615","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3288599.3288615","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3288599.3288615","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3288599.3288615","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3288599.3288615","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3544964299","display_name":null,"funder_award_id":"CNS-1619197","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5312014006","display_name":null,"funder_award_id":"CNS-1115733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6045225125","display_name":"CSR: Small: Design and Optimization of Scalable Concurrent Data Structures for Multi-Core Systems","funder_award_id":"1619197","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7236704352","display_name":"CSR: Small: Collaborative Research: Improving Dependability of Multithreaded Distributed Programs","funder_award_id":"1115733","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G740478354","display_name":null,"funder_award_id":"CNS-1619197, CNS-1115733","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2908910732.pdf","grobid_xml":"https://content.openalex.org/works/W2908910732.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1495007564","https://openalex.org/W1536852470","https://openalex.org/W2008182922","https://openalex.org/W2018031750","https://openalex.org/W2043676248","https://openalex.org/W2053990855","https://openalex.org/W2069398819","https://openalex.org/W2072721374","https://openalex.org/W2096100005","https://openalex.org/W2096181137","https://openalex.org/W2101939036","https://openalex.org/W2112053513","https://openalex.org/W2115873870","https://openalex.org/W2117572751","https://openalex.org/W2128896110","https://openalex.org/W2139559481","https://openalex.org/W2170146741"],"related_works":["https://openalex.org/W2026697457","https://openalex.org/W2022598760","https://openalex.org/W2501849745","https://openalex.org/W2361906991","https://openalex.org/W2364382882","https://openalex.org/W3169685561","https://openalex.org/W2061004850","https://openalex.org/W2072157347","https://openalex.org/W2004985727","https://openalex.org/W1979520615"],"abstract_inverted_index":{"Binary":[0],"Search":[1],"Tree":[2],"(BST)":[3],"is":[4],"an":[5,27],"important":[6],"data":[7],"structure":[8],"for":[9,18],"managing":[10],"ordered":[11],"data.":[12],"Many":[13],"algorithms":[14],"have":[15],"been":[16],"proposed":[17],"concurrent":[19],"manipulation":[20],"of":[21,46],"a":[22,47],"binary":[23],"search":[24,48],"tree":[25],"in":[26],"asynchronous":[28],"shared":[29],"memory":[30],"system":[31],"that":[32],"supports":[33],"search,":[34],"insert":[35],"and":[36,43],"delete":[37],"operations":[38],"based":[39],"on":[40],"both":[41],"external":[42],"internal":[44],"representations":[45],"tree.":[49]},"counts_by_year":[],"updated_date":"2026-03-15T09:29:46.208133","created_date":"2025-10-10T00:00:00"}