{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:18:45Z","timestamp":1773796725302,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,10,1]],"date-time":"1993-10-01T00:00:00Z","timestamp":749433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7229,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,10]]},"DOI":"10.1016\/0022-0000(93)90033-s","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"250-286","source":"Crossref","is-referenced-by-count":80,"title":["Removing randomness in parallel computation without a processor penalty"],"prefix":"10.1016","volume":"47","author":[{"given":"Michael","family":"Luby","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90033-S_BIB1","series-title":"Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science","first-page":"364","article-title":"Network decomposition and locality in distributed computation","author":"Awerbuch","year":"1989"},{"key":"10.1016\/0022-0000(93)90033-S_BIB2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast and simple randomized parallel algorithm for the maximal indepedent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(93)90033-S_BIB3","series-title":"Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science","first-page":"1","article-title":"Simulating (logc n)-wise independence in NC","author":"Berger","year":"1989"},{"key":"10.1016\/0022-0000(93)90033-S_BIB4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(93)90033-S_BIB5","series-title":"Proceedings, 10th ACM Symposium on Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/0022-0000(93)90033-S_BIB6","doi-asserted-by":"crossref","unstructured":"H. Gazit and G. Miller, personal communication, 1988.","DOI":"10.1016\/0020-0190(88)90164-0"},{"key":"10.1016\/0022-0000(93)90033-S_BIB7","series-title":"Proceedings, 28th Annual Symposium on Foundations of Computer Science","first-page":"161","article-title":"A new parallel algorithm for the maximal independent set problem, preliminary version","author":"Goldberg","year":"1987"},{"key":"10.1016\/0022-0000(93)90033-S_BIB8","series-title":"A Fast and Simple Randomized Parallel Algorithm for Maximal Matching","author":"Israeli","year":"1984"},{"key":"10.1016\/0022-0000(93)90033-S_BIB9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","article-title":"An improved parallel algorithm for maximal matching","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/0022-0000(93)90033-S_BIB10","series-title":"Proceedings, 16th ACM Symposium on Theory of Computing","first-page":"266","article-title":"A fast parallel algorithm for the maximal independent set problem","author":"Karp","year":"1984"},{"key":"10.1016\/0022-0000(93)90033-S_BIB11","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90033-S_BIB12","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0022-0000(93)90033-S_BIB13_1","series-title":"Proceedings, 17th Annual Symposium on Theory of Computing","first-page":"1","article-title":"A simple parallel algorithm for the maximal independent set problem, preliminary version","author":"Lubyt","year":"1985"},{"key":"10.1016\/0022-0000(93)90033-S_BIB13_2","series-title":"Proceedings, 17th Annual Symposium on Theory of Computing","first-page":"1036","article-title":"A simple parallel algorithm for the maximal independent set problem, preliminary version","volume":"15","author":"Lubyt","year":"1986"},{"key":"10.1016\/0022-0000(93)90033-S_BIB14","series-title":"Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"162","article-title":"Removing randomness in parallel computation without a processor penalty","author":"Luby","year":"1988"},{"key":"10.1016\/0022-0000(93)90033-S_BIB15","series-title":"Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science","first-page":"8","article-title":"The probabilistic method yields deterministic parallel algorithms","author":"Motwani","year":"1989"},{"key":"10.1016\/0022-0000(93)90033-S_BIB16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: Approximating packing integer programs","volume":"37","author":"Raohavan","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90033-S_BIB17","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","article-title":"Ten Lectures on the Probabilistic Method","author":"Spencer","year":"1987"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390033S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390033S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:58:09Z","timestamp":1550325489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390033S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,10]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,10]]}},"alternative-id":["002200009390033S"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90033-s","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,10]]}}}