{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:35Z","timestamp":1759638155319,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0743-7315(91)90050-j","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"257-261","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Cost-optimal parallel algorithms for constructing 2\u20133 trees"],"prefix":"10.1016","volume":"11","author":[{"given":"Bing-Feng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0743-7315(91)90050-J_BIB1"},{"issue":"3","key":"10.1016\/0743-7315(91)90050-J_BIB2","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0209045","article-title":"Design and analysis of data structures for representing sorted lists","volume":"9","author":"Brown","year":"1980","journal-title":"SIAM J. Comput."},{"issue":"7","key":"10.1016\/0743-7315(91)90050-J_BIB3","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1145\/358105.358191","article-title":"Efficient algorithm to globally balanced binary search trees","volume":"27","author":"Chang","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(91)90050-J_BIB4","first-page":"360","article-title":"Balancing a binary tree","volume":"19","author":"Day","year":"1976","journal-title":"Comput. J."},{"issue":"6","key":"10.1016\/0743-7315(91)90050-J_BIB5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/BF01407411","article-title":"Optimal parallel algorithms for constructing and maintaining a balanced m-way search tree","volume":"15","author":"Dekel","year":"1986","journal-title":"Int. J. Parallel Programming"},{"year":"1973","author":"Knuth","key":"10.1016\/0743-7315(91)90050-J_BIB6"},{"issue":"6","key":"10.1016\/0743-7315(91)90050-J_BIB7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TC.1985.5009411","article-title":"A maximally parallel balancing algorithm for obtaining complete balanced binary trees","volume":"C-34","author":"Moitra","year":"1985","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/0743-7315(91)90050-J_BIB8","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TSE.1986.6312885","article-title":"Derivation of a parallel algorithm for balanced binary trees","volume":"SE-12","author":"Moitra","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0743-7315(91)90050-J_BIB9","unstructured":"Wang, B. F., and Chen, G. H. Efficient parallel algorithms for constructing B-trees, in preparation."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190050J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190050J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:21Z","timestamp":1757514501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190050J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["074373159190050J"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90050-j","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Cost-optimal parallel algorithms for constructing 2\u20133 trees","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90050-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}