{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:39:20Z","timestamp":1756463960176,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040376","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"81-90","source":"Crossref","is-referenced-by-count":53,"title":["Deterministic parallel list ranking"],"prefix":"10.1007","author":[{"given":"Richard J.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary L.","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin. Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms. In Proceedings of the 18th ACM Symposium on Theory of Computation, pages 206\u2013219, 1985.","DOI":"10.1145\/12130.12151"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin. Approximate scheduling, exact scheduling, and applications to parallel algorithms. In 27th Symposium on Foundations of Computer Science, pages 478\u2013491, 1986. Part I to appear in SIAM Journal of Computing.","DOI":"10.1109\/SFCS.1986.10"},{"key":"9_CR3","unstructured":"R. Cole and U. Vishkin. Faster Optimal Parallel Prefix Sums and List Ranking. Technical Report 56\/86, Tel Aviv University, December 1986."},{"key":"9_CR4","unstructured":"H. Gazit, G. L. Miller, and S. H. Teng. Optimal tree contraction in the EREW model. 1986. Extended abstract."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"A. V. Goldberg, S. A. Plotkin, and G. E. Shannon. Parallel symmetry-breaking in sparse graphs. In Proceedings of the 19th ACM Symposium on Theory of Computation, pages 315\u2013324, 1987.","DOI":"10.1145\/28395.28429"},{"key":"9_CR6","unstructured":"Y. Han. Designing Fast and Efficient Parallel Algorithms. PhD thesis, Duke University, 1987."},{"key":"9_CR7","unstructured":"C. Kruskal, L. Rudolf, and M. Snir. The power of parallel prefix computation. In International Conference on Parallel Processing, pages 180\u2013185, 1985."},{"key":"9_CR8","unstructured":"B. D. Lubachevsky and A. G. Greenberg. Simple, efficient asynchronous parallel prefix algorithms. In International Conference on Parallel Processing, pages 66\u201369, 1987."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. In 26th Symposium on Foundations of Computer Science, pages 478\u2013489, 1985.","DOI":"10.1109\/SFCS.1985.43"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"J. H. Reif. An optimal parallel algorithm for integer sorting. In 26th Symposium on Foundations of Computer Science, pages 496\u2013503, 1985.","DOI":"10.1109\/SFCS.1985.9"},{"issue":"4","key":"9_CR11","doi-asserted-by":"publisher","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(4):862\u2013874, 1985.","journal-title":"SIAM Journal on Computing"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"U. Vishkin. Randomized speed-ups in parallel computation. In Proceedings of the 16th ACM Symposium on Theory of Computation, pages 230\u2013239 1984.","DOI":"10.1145\/800057.808686"},{"key":"9_CR13","unstructured":"R. A. Wagner and Y. Han. Parallel algorithms for bucket sorting and the data dependent prefix problem. In International Conference on Paralle Processing, pages 924\u2013930, 1986."},{"key":"9_CR14","unstructured":"J. C. Wyllie. The Complexity of Parallel Computation. PhD thesis, De partment of Computer Science, Cornell University, 1979."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040376.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:17:32Z","timestamp":1736500652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0040376","relation":{},"subject":[]}}