{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:44Z","timestamp":1772164004633,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,2,27]],"date-time":"2017-02-27T00:00:00Z","timestamp":1488153600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1115733"],"award-info":[{"award-number":["CNS-1115733"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,2,27]]},"DOI":"10.1145\/2851141.2851173","type":"proceedings-article","created":{"date-parts":[[2016,2,22]],"date-time":"2016-02-22T08:18:49Z","timestamp":1456129129000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Improving efficacy of internal binary search trees using local recovery"],"prefix":"10.1145","author":[{"given":"Arunmoezhi","family":"Ramachandran","sequence":"first","affiliation":[{"name":"The University of Texas at Dallas"}]},{"given":"Neeraj","family":"Mittal","sequence":"additional","affiliation":[{"name":"The University of Texas at Dallas"}]}],"member":"320","published-online":{"date-parts":[[2016,2,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611471"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555269"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312036"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688551"},{"key":"e_1_3_2_1_5_1","unstructured":"A. Ramachandran and N. Mittal. Improving Efficacy of Internal Binary Search Trees using Local Recovery. Technical Report UTDCS-13-15 Department of Computer Science The University of Texas at Dallas Dec. 2015."}],"event":{"name":"PPoPP '16: 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","location":"Barcelona Spain","acronym":"PPoPP '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851141.2851173","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851141.2851173","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851141.2851173","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:18:21Z","timestamp":1763457501000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851141.2851173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,27]]},"references-count":5,"alternative-id":["10.1145\/2851141.2851173","10.1145\/2851141"],"URL":"https:\/\/doi.org\/10.1145\/2851141.2851173","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3016078.2851173","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,2,27]]},"assertion":[{"value":"2016-02-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}