{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:41:40Z","timestamp":1757540500799},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1007\/bf01407411","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T01:14:25Z","timestamp":1112490865000},"page":"503-528","source":"Crossref","is-referenced-by-count":6,"title":["Optimal parallel algorithms for constructing and maintaining a balancedm-way search tree"],"prefix":"10.1007","volume":"15","author":[{"given":"Eliezer","family":"Dekel","sequence":"first","affiliation":[]},{"given":"Shietung","family":"Peng","sequence":"additional","affiliation":[]},{"given":"S. Sitharma","family":"Lyengar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"The Art of Computer Programming, Vol. 3, Sorting and Searching","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching. Addison-Wesley, reading, Mass. (1973)."},{"key":"CR2","volume-title":"Fundamentals of Data Structures","author":"E. Horowitz","year":"1982","unstructured":"E. Horowitz and S. Sahni,Fundamentals of Data Structures, Computer Science Press, Potomac, Md. (1982)."},{"key":"CR3","unstructured":"P. K. Armstrong, U. S. Patent 4131947 (December 26, 1978)."},{"issue":"2","key":"CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/TC.1985.1676551","volume":"34","author":"M. J. Attallah","year":"1985","unstructured":"M. J. Attallah and S. R. Kosaraju, A generalized dictionary machine for VLSI,IEEE Trans. on Comput. C-34(2):151?155 (February 1985).","journal-title":"IEEE Trans. on Comput. C-"},{"key":"CR5","unstructured":"J. L. Bentley and H. T. Kung, Two papers on tree-structured paralel computer, Dep. Comput. Sci. Carnegie Mellon University, Pittsburge, PA, Report CMU-CS-79-142 (1979)."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"M. J. Carey and C. D. Thompson, An efficient implementation of search trees on [logN+1] processors,IEEE Trans. on Comput. C-33(11):1038?1041.","DOI":"10.1109\/TC.1984.1676379"},{"key":"CR7","series-title":"Report CMU-CS-79-115","volume-title":"Systolic priority queues","author":"C. E. Leiserson","year":"1979","unstructured":"C. E. Leiserson, Systolic priority queues, Dep. Comput. Sci. Carnegie Mellon University, Pittsburge, PA, Report CMU-CS-79-115 (1979)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/TC.1982.1676104","volume":"31","author":"T. A. Ottmann","year":"1982","unstructured":"T. A. Ottmann, A. L. Rosenberg, and L. J. Stockmeyer, A dictionary machine (for VLSI),IEEE Trans. on Comput. C-31:892?897 (September 1982).","journal-title":"IEEE Trans. on Comput. C-"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A. K. Somani and V. K. Agarwal, An efficient VLSI dictionary machine,Proc. 11th Annu. ACM Intl. Symp. on Comput. Arch., pp. 142?150 (June 1984).","DOI":"10.1145\/800015.808176"},{"key":"CR10","unstructured":"Y. Tanaka, Y. Nozaka, and A. Masuyama, Pipeline searching and sorting modules as components of data flow database computer,Proc. Int. Fed. Inform. Processing, pp. 427?432 (October 1980)."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"A. L. Fisher, Dictionary Machines with a small number of processors,Proc. 11th Annu. ACM Int. Symp. on Comput. Arch., pp. 151?156 (June 1984).","DOI":"10.1145\/800015.808177"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1145\/358105.358191","volume":"27","author":"H. Chang","year":"1984","unstructured":"H. Chang and S. S. Iyengar, Efficient algorithms to globally balance a binary search tree,Com. ACM 27:695?702 (1984).","journal-title":"Com. ACM"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"A. Moitra and S. S. Iyengar, A maximally parallel balancing algorithm for obtaining complete balanced binary trees,IEEE-T-SE, pp. 442?449 (1986).","DOI":"10.1109\/TSE.1986.6312885"},{"key":"CR14","unstructured":"Q. F. Stout and B. L. Warren, Tree rebalancing in optimal time and space, U. of Michigan Computing Research Laboratory, Ann Arbor, MI, CRL-TR-42-84."},{"issue":"6","key":"CR15","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1109\/TSE.1984.5010306","volume":"10","author":"U. Manber","year":"1984","unstructured":"U. Manber, Concurrent Maintenance of Binary Search Trees,IEEE Trans. on Soft. Engineering SE-10(6):777?784 (November 1984).","journal-title":"IEEE Trans. on Soft. Engineering SE-"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan and U. Vishkin, Finding biconnected components and computing tree functions in logarithmic parallel timeFOCS (1984).","DOI":"10.1109\/SFCS.1984.715896"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407411.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01407411\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01407411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:59:12Z","timestamp":1586192352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01407411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF01407411"],"URL":"https:\/\/doi.org\/10.1007\/bf01407411","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}