{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T01:59:10Z","timestamp":1778291950970,"version":"3.51.4"},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"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":[[1989,6]]},"DOI":"10.1016\/0743-7315(89)90005-1","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"537-557","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"title":["Parallel algorithms for computing linked list prefix"],"prefix":"10.1016","volume":"6","author":[{"given":"Yijie","family":"Han","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90005-1_BIB1","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"key":"10.1016\/0743-7315(89)90005-1_BIB2","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"338","article-title":"Routing, merging and sorting on parallel models of computation","author":"Borodin","year":"1982"},{"key":"10.1016\/0743-7315(89)90005-1_BIB3","series-title":"Proc. 18th ACM Symp. on Theory of Computing","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascade: Micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986"},{"key":"10.1016\/0743-7315(89)90005-1_BIB4","series-title":"27th Symp. on Foundations of Comput. Sci., IEEE","first-page":"478","article-title":"Approximate and exact parallel scheduling with applications to list, tree and graph problems","author":"Cole","year":"1986"},{"key":"10.1016\/0743-7315(89)90005-1_BIB5","article-title":"Designing fast and efficient parallel algorithms","author":"Han","year":"1987"},{"key":"10.1016\/0743-7315(89)90005-1_BIB6","unstructured":"Kruskal, C.P., Madej, T., and Rudolph, L. Parallel prefix on fully connected direct connection machine. Proc. 1986 Int. Conf. on Parallel Processing, pp. 278\u2013284."},{"issue":"10","key":"10.1016\/0743-7315(89)90005-1_BIB7","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"C-34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90005-1_BIB8","unstructured":"Kruskal, C.P., Rudolph, L., and Snir, M. Efficient parallel algorithms for graph problems. Proc. of 1986 Int. Conf. on Parallel Processing, pp. 869\u2013876."},{"key":"10.1016\/0743-7315(89)90005-1_BIB9","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","article-title":"Tight bounds on the complexity of parallel sorting","volume":"C-34","author":"Leighton","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90005-1_BIB10","series-title":"26th Symp. on Foundations of Computer Sci., IEEE","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985"},{"issue":"10","key":"10.1016\/0743-7315(89)90005-1_BIB11","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/TC.1985.6312198","article-title":"\u201cHot spot\u201d contention and combining in multistage interconnection networks","volume":"C-34","author":"Pfister","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(89)90005-1_BIB12","series-title":"26th Symp. on Foundations of Computer Sci., IEEE","first-page":"291","article-title":"An optimal parallel algorithm for integer sorting","author":"Reif","year":"1985"},{"key":"10.1016\/0743-7315(89)90005-1_BIB13","series-title":"Proc. 1984 Int. Conf. on Parallel Processing","first-page":"423","article-title":"Probabilistic parallel prefix computation","author":"Reif","year":"1984"},{"issue":"3","key":"10.1016\/0743-7315(89)90005-1_BIB14","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","article-title":"On parallel searching","volume":"14","author":"Snir","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(89)90005-1_BIB15","series-title":"25th Symp. on Foundations of Computer Sci. IEEE","first-page":"12","article-title":"Finding biconnected components and computing tree functions in logarithmic parallel time","author":"Tarjan","year":"1984"},{"key":"10.1016\/0743-7315(89)90005-1_BIB16","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"key":"10.1016\/0743-7315(89)90005-1_BIB17","series-title":"25th Symp. on Foundations of Computer Sci., IEEE","first-page":"171","article-title":"How to share memory in a distributed system","author":"Upfal","year":"1984"},{"key":"10.1016\/0743-7315(89)90005-1_BIB18","unstructured":"Wagner, R.A., and Han, Y. Parallel algorithms for bucket sorting and the data dependent prefix problem. Proc. 1986 Int. Conf. on Parallel Processing, pp. 924\u2013930."},{"key":"10.1016\/0743-7315(89)90005-1_BIB19","article-title":"The complexity of parallel computation","author":"Wyllie","year":"1979"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900051?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:19Z","timestamp":1757514499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0743731589900051"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90005-1","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel algorithms for computing linked list prefix","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(89)90005-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}