{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:24:58Z","timestamp":1775031898197,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-6","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1991,6]]},"DOI":"10.1007\/bf01759076","type":"journal-article","created":{"date-parts":[[2005,6,16]],"date-time":"2005-06-16T10:43:56Z","timestamp":1118918636000},"page":"859-868","source":"Crossref","is-referenced-by-count":50,"title":["Deterministic parallel list ranking"],"prefix":"10.1007","volume":"6","author":[{"given":"Richard J.","family":"Anderson","sequence":"first","affiliation":[]},{"given":"Gary L.","family":"Miller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01759076_CR1","first-page":"32","volume":"70","author":"R. Cole","year":"1986","unstructured":"R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking.Information and Computation,70:32\u201353, 1986.","journal-title":"Information and Computation"},{"key":"BF01759076_CR2","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01762121","volume":"3","author":"R. Cole","year":"1988","unstructured":"R. Cole and U. Vishkin. The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time.Algorithmica,3:329\u2013346, 1988.","journal-title":"Algorithmica"},{"key":"BF01759076_CR3","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole and U. Vishkin. Approximate parallel scheduling, part I: The basic technique with applications to optimal parallel list ranking on logarithmic time.SIAM Journal on Computing,17:128\u2013142, 1988.","journal-title":"SIAM Journal on Computing"},{"key":"BF01759076_CR4","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","volume":"81","author":"R. Cole","year":"1989","unstructured":"R. Cole and U. Vishkin. Faster optimal parallel prefix sums and list ranking.Information and Computation,81:334\u2013352, 1989.","journal-title":"Information and Computation"},{"key":"BF01759076_CR5","unstructured":"H. Gazit, G. L. Miller, and S. H. Teng. Optimal tree contraction in the EREW model. Extended abstract, 1986."},{"key":"BF01759076_CR6","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. InProceedings of the 19th ACM Symposium on Theory of Computation, pages 315\u2013324, 1987.","DOI":"10.1145\/28395.28429"},{"key":"BF01759076_CR7","unstructured":"Y. Han. Designing Fast and Efficient Parallel Algorithms. Ph.D. thesis, Duke University, 1987."},{"key":"BF01759076_CR8","doi-asserted-by":"crossref","unstructured":"S. R. Kosaraju and A. L. Delcher. Optimal parallel evaluation of tree-structured computations by raking. InAegean Workshop on Computing, pages 101\u2013110, 1988.","DOI":"10.1007\/BFb0040378"},{"key":"BF01759076_CR9","unstructured":"C. Kruskal, L., Rudolf, and M. Snir. The power of parallel prefix computation. InInternational Conference on Parallel Processing, pages 180\u2013185, 1985."},{"key":"BF01759076_CR10","doi-asserted-by":"crossref","unstructured":"G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In26th Symposium on Foundations of Computer Science, pages 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"BF01759076_CR11","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","volume":"18","author":"S. Rajasekaran","year":"1989","unstructured":"S. Rajasekaran and J. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms.SIAM Journal on Computing,18:594\u2013607, 1989.","journal-title":"SIAM Journal on Computing"},{"key":"BF01759076_CR12","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan and U. Vishkin. An efficient parallel biconnectivity algorithm.SIAM Journal on Computing,14:862\u2013874, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"BF01759076_CR13","doi-asserted-by":"crossref","unstructured":"U. Vishkin. Randomized speed-ups in parallel computation. InProceedings of the 16th ACM Symposium on Theory of Computation, pages 230\u2013239, 1984.","DOI":"10.1145\/800057.808686"},{"key":"BF01759076_CR14","unstructured":"R. A. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. InInternational Conference on Parallel Processing, pages 924\u2013930, 1986."},{"key":"BF01759076_CR15","unstructured":"J. C. Wyllie. The Complexity of Parallel Computation. Ph.D. thesis, Department of Computer Science, Cornell University, 1979."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759076.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01759076\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01759076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T19:27:06Z","timestamp":1586287626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01759076"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":15,"journal-issue":{"issue":"1-6","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["BF01759076"],"URL":"https:\/\/doi.org\/10.1007\/bf01759076","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}