{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:58Z","timestamp":1783576858576,"version":"3.55.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":9879,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1986,7]]},"DOI":"10.1016\/s0019-9958(86)80023-7","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T20:43:56Z","timestamp":1115412236000},"page":"32-53","source":"Crossref","is-referenced-by-count":291,"title":["Deterministic coin tossing with applications to optimal parallel list ranking"],"prefix":"10.1016","volume":"70","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\/S0019-9958(86)80023-7_bib1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0019-9958(86)80023-7_bib2","series-title":"Proceedings, 1981 International Conference on Parallel Processing","first-page":"170","article-title":"Optimal parallel algorithms for the connected component problems","author":"Chin","year":"1981"},{"key":"10.1016\/S0019-9958(86)80023-7_bib3","series-title":"Proceedings, 18th Annual ACM Symposium on Theory of Computing","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986"},{"key":"10.1016\/S0019-9958(86)80023-7_bib4","series-title":"Proceedings, 17th Annual ACM Symposium on Theory of Computing","first-page":"48","article-title":"One, two, three\u2026 infinity: lower bound for parallel computation","author":"Fich","year":"1985"},{"issue":"4","key":"10.1016\/S0019-9958(86)80023-7_bib5","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\/S0019-9958(86)80023-7_bib6","series-title":"Proceedings, 1985 International Conference on Parallel Processing","first-page":"180","article-title":"Efficient parallel algorithms for graph problems","author":"Kruskal","year":"1985"},{"key":"10.1016\/S0019-9958(86)80023-7_bib7","series-title":"Proceedings, 26th IEEE Annual Conference on Foundations of Computer Science","first-page":"532","article-title":"The complexity of parallel sorting","author":"Meyer auf der Heide","year":"1985"},{"key":"10.1016\/S0019-9958(86)80023-7_bib8","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\/S0019-9958(86)80023-7_bib9","series-title":"Synchronous Parallel Computation\u2014a Survey","author":"Vishkin","year":"1983"},{"key":"10.1016\/S0019-9958(86)80023-7_bib10","series-title":"An optimal parallel algorithm for selection, manuscript","author":"Vishkin","year":"1983"},{"key":"10.1016\/S0019-9958(86)80023-7_bib11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0166-218X(84)90019-2","article-title":"An optimal parallel connectivity algorithm","volume":"9","author":"Vishkin","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0019-9958(86)80023-7_bib12","series-title":"Proceedings, 16th Annual ACM Symposium on Theory of Computing","first-page":"230","article-title":"Randomized speed-ups in parallel computation","author":"Vishkin","year":"1984"},{"key":"10.1016\/S0019-9958(86)80023-7_bib13","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\/S0019-9958(86)80023-7_bib14","series-title":"The Complexity of Parallel Computation","author":"Wyllie","year":"1979"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995886800237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T17:54:28Z","timestamp":1548525268000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995886800237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,7]]}},"alternative-id":["S0019995886800237"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(86)80023-7","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}