{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:13Z","timestamp":1759638793786},"reference-count":42,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/s0022-0000(05)80069-8","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"478-516","source":"Crossref","is-referenced-by-count":36,"title":["The probabilistic method yields deterministic parallel algorithms"],"prefix":"10.1016","volume":"49","author":[{"given":"Rajeev","family":"Motwani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"(Seffi) Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80069-8_bib1","series-title":"19th Annual Symposium on Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/S0022-0000(05)80069-8_bib2","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","article-title":"A fast and simple randomized algorithm for the maximal independent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(05)80069-8_bib3","unstructured":"R. Anderson, Set intersection problems, unpublished manuscript, 1985."},{"key":"10.1016\/S0022-0000(05)80069-8_bib4","first-page":"82","article-title":"An efficient algorithm for coloring the edges of a graph with \u0394 + 1 colors","volume":"20","author":"Arjomandi","year":"1982","journal-title":"Canad. J. Oper. Res. Inform. Process. (INFOR)"},{"key":"10.1016\/S0022-0000(05)80069-8_bib5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(88)90129-X","article-title":"Balanced two-colorings of finite sets in the cube","volume":"73","author":"Beck","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/S0022-0000(05)80069-8_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(81)90022-6","article-title":"Integer-making theorems","volume":"3","author":"Beck","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0022-0000(05)80069-8_bib7_1","doi-asserted-by":"crossref","first-page":"1026","DOI":"10.1145\/115234.115347","article-title":"Simulating (logc n)-wise independence in NC","volume":"38","author":"Berger","year":"1991","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80069-8_bib7_2","series-title":"30th Annual Symposium on the Foundations of Computer Science","first-page":"2","year":"1989"},{"key":"10.1016\/S0022-0000(05)80069-8_bib8","series-title":"30th Annual Symposium on the Foundations of Computer Science","first-page":"54","article-title":"Efficient NC algorithms for set cover with applications to learning and geometry","author":"Berger","year":"1989"},{"key":"10.1016\/S0022-0000(05)80069-8_bib9","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1214\/aoms\/1177729330","article-title":"A measure of asymptotic efficiency for tests based on the sum of observations","volume":"23","author":"Chernoff","year":"1952","journal-title":"Ann. Math. Statist."},{"key":"10.1016\/S0022-0000(05)80069-8_bib10","series-title":"29th Annual Symposium on the Foundations of Computer Science","first-page":"539","article-title":"A deterministic view of random sampling and its use in geometry","author":"Chazelle","year":"1988"},{"key":"10.1016\/S0022-0000(05)80069-8_bib11","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1137\/0217052","article-title":"A randomized algorithm for closest point queries","volume":"17","author":"Clarkson","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80069-8_bib12","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","article-title":"New applications of random sampling in computational geometry","volume":"2","author":"Clarkson","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0022-0000(05)80069-8_bib13","series-title":"Proceedings, 4th Annual ACM Symposium on Computational Geometry","first-page":"1","article-title":"Applications of random sampling in computational geometry","author":"Clarkson","year":"1988"},{"key":"10.1016\/S0022-0000(05)80069-8_bib14","series-title":"Proceedings, 4th Annual ACM Symposium on Computational Geometry","first-page":"12","article-title":"Algorithms for diametrical pairs and convex hulls that are optimal, randomized, and incremental","author":"Clarkson","year":"1988"},{"key":"10.1016\/S0022-0000(05)80069-8_bib15","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","article-title":"On a combinatorial game","volume":"14","author":"Erd\u00f6s","year":"1973","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/S0022-0000(05)80069-8_bib16","series-title":"An Introduction to the Theory of Probability and Its Applications","author":"Feller","year":"1967"},{"key":"10.1016\/S0022-0000(05)80069-8_bib17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP completeness of finding the chromatic index of regular graphs","volume":"4","author":"Galil","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(05)80069-8_bib18","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80069-8_bib19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"Epsilon-nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0022-0000(05)80069-8_bib20","article-title":"Derandomization through Approximation: An NC Algorithm for Minimum Cuts","author":"Karger","year":"1993"},{"key":"10.1016\/S0022-0000(05)80069-8_bib21","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0196-6774(87)90026-5","article-title":"Efficient parallel algorithms for edge coloring problems","volume":"8","author":"Karloff","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(05)80069-8_bib22","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a perfect matching is in random NC","volume":"6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80069-8_bib23","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(88)90027-X","article-title":"The complexity of parallel search","volume":"36","author":"Karp","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80069-8_bib24","doi-asserted-by":"crossref","first-page":"762","DOI":"10.1145\/4221.4226","article-title":"A fast parallel algorithm for the maximal independent set problem","volume":"32","author":"Karp","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80069-8_bib25","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0022-0000(05)80069-8_bib26","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e0sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/S0022-0000(05)80069-8_bib27","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","article-title":"A simple parallel algorithm for the maximal independent set","volume":"15","author":"Luby","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80069-8_bib28","series-title":"29th Annual 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\/S0022-0000(05)80069-8_bib29","series-title":"30th Annual Symposium on the Foundations of Computer Science","first-page":"8","article-title":"The probabilistic method yields deterministic parallel algorithms","author":"Motwani","year":"1989"},{"key":"10.1016\/S0022-0000(05)80069-8_bib30","series-title":"The Theory of Error Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0022-0000(05)80069-8_bib31","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","article-title":"A fast parallel algorithm to compute the rank of a matrix over an arbitrary field","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80069-8_bib32","series-title":"19th Annual ACM Symposium on the Theory of Computing","first-page":"355","article-title":"Matching is as easy as matrix inversion","author":"Mulmuley","year":"1987"},{"key":"10.1016\/S0022-0000(05)80069-8_bib33","article-title":"Constructing Ramsey Graphs from Small Probability Spaces","author":"Naor","year":"1992"},{"key":"10.1016\/S0022-0000(05)80069-8_bib34","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","article-title":"Small bias probability spaces: Efficient constructions and applications","volume":"22","author":"Naor","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80069-8_bib35","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0097-3165(78)90028-6","article-title":"Balancing families of sets","volume":"25","author":"Olson","year":"1978","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0022-0000(05)80069-8_bib36","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(88)90003-7","article-title":"Probabilistic construction of deterministic algorithms: approximation packing integer programs","volume":"37","author":"Raghavan","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80069-8_bib37","series-title":"Proceedings, 16th International Conference on Parallel Processing","article-title":"Optimal randomized parallel algorithms for computational geometry","author":"Reif","year":"1988"},{"key":"10.1016\/S0022-0000(05)80069-8_bib38","series-title":"Ten Lectures on the Probabilistic Method","author":"Spencer","year":"1987"},{"key":"10.1016\/S0022-0000(05)80069-8_bib39","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1090\/S0002-9947-1985-0784009-0","article-title":"Six standard deviations suffice","volume":"289","author":"Spencer","year":"1985","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0022-0000(05)80069-8_bib40","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF02579409","article-title":"Balancing vectors in the max norm","volume":"6","author":"Spencer","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0022-0000(05)80069-8_bib41","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Siskret. Anal."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800698?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800698?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:06Z","timestamp":1548196026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["S0022000005800698"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80069-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}