{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:23Z","timestamp":1781259503338,"version":"3.54.1"},"reference-count":17,"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"},{"start":{"date-parts":[[2005,11,29]],"date-time":"2005-11-29T00:00:00Z","timestamp":1133222400000},"content-version":"vor","delay-in-days":6025,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0890-5401(89)90036-9","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"334-352","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":119,"title":["Faster optimal parallel prefix sums and list ranking"],"prefix":"10.1016","volume":"81","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90036-9_bib1","series-title":"3rd Aegean Workshop on Computing","first-page":"81","article-title":"Optimal parallel algorithms for list ranking, extended abstract; Deterministic parallel list ranking","volume":"Vol. 319","author":"Anderson","year":"1986"},{"key":"10.1016\/0890-5401(89)90036-9_bib2","series-title":"Proceedings, 19th ACM Symp. on Theory of Computing","first-page":"83","article-title":"Optimal bounds for decision problems on the CRCW PRAM","author":"Beame","year":"1987"},{"key":"10.1016\/0890-5401(89)90036-9_bib3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with applications to optimal parallel list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(89)90036-9_bib4","series-title":"Proceedings, 27th Symp. on Foundations of Computer Science","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\/0890-5401(89)90036-9_SB0025","author":"Cole","year":"1986"},{"key":"10.1016\/0890-5401(89)90036-9_SB0030","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01762121","volume":"3","author":"Cole","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0890-5401(89)90036-9_bib6","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Fisher","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(89)90036-9_bib7","series-title":"Proceedings, 18th ACM Symp. on Theory of Computing","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986"},{"key":"10.1016\/0890-5401(89)90036-9_bib8","series-title":"Proceedings, 26th Symp. on Foundations of Computer Science","first-page":"478","article-title":"Parallel tree contraction and its application","volume":"Vol. 5","author":"Miller","year":"1985"},{"key":"10.1016\/0890-5401(89)90036-9_bib9","series-title":"Proceedings, 26th Symp. on Foundations of Computer Science","first-page":"496","article-title":"An optimal parallel algorithm for integer sorting","author":"Reif","year":"1985"},{"key":"10.1016\/0890-5401(89)90036-9_bib10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90036-9_bib11","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(89)90036-9_bib12","author":"Vishkin","year":"1983"},{"key":"10.1016\/0890-5401(89)90036-9_SB0070","series-title":"Proceedings 16th ACM Symp. on Theory of Computing","first-page":"230","article-title":"Randomized speedups in parallel computation","author":"Vishkin","year":"1984"},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90036-9_SB0075","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-7315(87)90040-2","article-title":"Randomized speedups for list ranking","volume":"4","author":"Vishkin","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0890-5401(89)90036-9_bib14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","article-title":"On efficient parallel strong orientation","volume":"20","author":"Vishkin","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90036-9_bib15","article-title":"The Complexity of Parallel Computation","author":"Wyllie","year":"1979"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T15:09:55Z","timestamp":1757516995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0890540189900369"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90036-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Faster optimal parallel prefix sums and list ranking","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0890-5401(89)90036-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Academic Press, Inc. Published by Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}