{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T15:40:50Z","timestamp":1681832450725},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1016\/0020-0190(94)90094-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"157-163","source":"Crossref","is-referenced-by-count":0,"title":["A processor efficient MIS algorithm on random graphs"],"prefix":"10.1016","volume":"49","author":[{"given":"S.B.","family":"Yang","sequence":"first","affiliation":[]},{"given":"S.K.","family":"Dhall","sequence":"additional","affiliation":[]},{"given":"S.","family":"Lakshmivarahan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90094-9_BIB1","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 independent set problem","volume":"7","author":"Alon","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)90094-9_BIB2","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0020-0190(94)90094-9_BIB3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/SFCS.1987.46","article-title":"Parallel graph algorithm that are efficient on average","author":"Coppersmith","year":"1987","journal-title":"Proc. 28th Ann. IEEE Symp. on Foundation of Computer Science"},{"key":"10.1016\/0020-0190(94)90094-9_BIB4","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs","volume":"6","author":"Erd\u00f6s","year":"1959","journal-title":"Publ. Math. Debrecen"},{"key":"10.1016\/0020-0190(94)90094-9_BIB5","series-title":"Random graphs '87","first-page":"41","article-title":"Parallel colouring of random graphs","author":"Frieze","year":"1990"},{"key":"10.1016\/0020-0190(94)90094-9_BIB6","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/jgt.3190060402","article-title":"A review of random graphs","volume":"6","author":"Karo\u0144ski","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/0020-0190(94)90094-9_BIB7","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. ACM"},{"issue":"4","key":"10.1016\/0020-0190(94)90094-9_BIB8","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1137\/0215074","article-title":"A simple parallel algorithm for the maximal independent set problem","volume":"15","author":"Luby","year":"1986","journal-title":"SIAM J. Comput."},{"issue":"10","key":"10.1016\/0020-0190(94)90094-9_BIB9","doi-asserted-by":"crossref","first-page":"1192","DOI":"10.1145\/63039.63042","article-title":"Random number generators: Good ones are hard to find","volume":"31","author":"Park","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(94)90094-9_BIB10","series-title":"Tech. Rept. TR-11\u201382","article-title":"The expected time complexity of parallel graph and digraph algorithms","author":"Reif","year":"1982"},{"key":"10.1016\/0020-0190(94)90094-9_BIB11","first-page":"238","article-title":"N-processors graphs distributively achieve perfect matching in O(log2N) beats","author":"Shamir","year":"1982","journal-title":"Proc. of Principles of Distributed Computing"},{"key":"10.1016\/0020-0190(94)90094-9_BIB12","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1016\/0196-6774(84)90003-8","article-title":"Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces","volume":"5","author":"Shamir","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(94)90094-9_BIB13","first-page":"230","article-title":"Randomized speed-ups in parallel computation","author":"Vishkin","year":"1984","journal-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T15:15:25Z","timestamp":1681830925000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["0020019094900949"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90094-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}