{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:46:29Z","timestamp":1773704789734,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986,1]]},"DOI":"10.1016\/0020-0190(86)90144-4","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T15:53:30Z","timestamp":1048607610000},"page":"77-80","source":"Crossref","is-referenced-by-count":137,"title":["A fast and simple randomized parallel algorithm for maximal matching"],"prefix":"10.1016","volume":"22","author":[{"given":"Amos","family":"Israeli","sequence":"first","affiliation":[]},{"given":"A.","family":"Itai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90144-4_BIB1","series-title":"4th ACM Symp. on Principles of Distributed Computing","article-title":"Arithmetic with concurrent writes","author":"Itai","year":"1985"},{"key":"10.1016\/0020-0190(86)90144-4_BIB2","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(86)90144-4_BIB3","series-title":"Proc. 16th Ann. ACM Symp. 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\/0020-0190(86)90144-4_BIB4","series-title":"Tech. Rept. CST-8-80","article-title":"Size bounds and parallel algorithms for networks","author":"Lev","year":"1980"},{"key":"10.1016\/0020-0190(86)90144-4_BIB5","series-title":"Symp. on Algorithms and Complexity, New Directions","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901444?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086901444?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:29:43Z","timestamp":1553448583000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086901444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0020019086901444"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90144-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,1]]}}}