{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:48:59Z","timestamp":1672220939209},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":[[1996,1]]},"DOI":"10.1016\/0020-0190(95)00179-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:09:59Z","timestamp":1027613399000},"page":"83-87","source":"Crossref","is-referenced-by-count":1,"title":["A simple randomized parallel algorithm for maximal \u0192-matchings"],"prefix":"10.1016","volume":"57","author":[{"given":"Oscar","family":"Garrido","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Jarominek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Lingas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00179-4_BIB1","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\/0020-0190(95)00179-4_BIB2","doi-asserted-by":"crossref","unstructured":"K. Diks, O. Garrido and A. Lingas, Parallel algorithms for finding maximal k-dependent sets and maximal \u0192-matchings, Internat. J. Found. Comput. Sci.4, pp. 179\u2013192.","DOI":"10.1142\/S0129054193000122"},{"key":"10.1016\/0020-0190(95)00179-4_BIB3","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/0020-0190(95)00179-4_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","article-title":"A guided tour of Chernoff bounds","volume":"33","author":"Hagerup","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00179-4_BIB5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","article-title":"A fast and simple randomized parallel algorithm for maximal matching","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00179-4_BIB6","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\/0020-0190(95)00179-4_BIB7","first-page":"869","article-title":"Parallel algorithms for shared memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"key":"10.1016\/0020-0190(95)00179-4_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0020-0190(94)90130-9","article-title":"An optimal parallel algorithm for maximal matching","volume":"52","author":"Kelsen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(95)00179-4_BIB9","series-title":"Proc. 4th. Ann. IEEE Conf.on Structure in Complexity Theory","first-page":"114","article-title":"The complexity of circuit value and network stability","author":"Mayr","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019095001794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:26:38Z","timestamp":1556274398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019095001794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["0020019095001794"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00179-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}