{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:20:27Z","timestamp":1648819227639},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1016\/0020-0190(91)90236-b","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"143-148","source":"Crossref","is-referenced-by-count":1,"title":["A new optimal distributed algorithm for the set intersection problem"],"prefix":"10.1016","volume":"38","author":[{"given":"Subbiah","family":"Rajanarayanan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sitharama S.","family":"Iyengar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/0020-0190(91)90236-B_BIB1","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1145\/358690.358717","article-title":"Distributed computation on graphs: Shortest path algorithms","volume":"25","author":"Chandy","year":"1982","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(91)90236-B_BIB2","series-title":"Tech. Rept.","article-title":"Optimal distributed algorithm for determining the model of distribution","author":"Iyengar","year":"1990"},{"key":"10.1016\/0020-0190(91)90236-B_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0020-0190(88)90021-X","article-title":"Message complexity of the set intersection problem","volume":"27","author":"Ramarao","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(91)90236-B_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","article-title":"Distributed network protocols","volume":"29","author":"Segall","year":"1983","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190236B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190236B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:01Z","timestamp":1555129441000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190236B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["002001909190236B"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90236-b","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}