{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T01:44:22Z","timestamp":1726451062771},"reference-count":8,"publisher":"Elsevier BV","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90016-x","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"1-9","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Derivation of a distributed algorithm for finding paths in directed networks"],"prefix":"10.1016","volume":"6","author":[{"given":"Robert","family":"McCurley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred B.","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1976","series-title":"A Discipline of Programming","author":"Dijkstra","key":"10.1016\/0167-6423(86)90016-X_BIB1"},{"issue":"6","key":"10.1016\/0167-6423(86)90016-X_BIB2","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","article-title":"Resynch procedures and a fail-safe network protocol","volume":"27","author":"Finn","year":"1979","journal-title":"IEEE Trans. Comm."},{"article-title":"Communication complexity of distributed shortest path algorithms","year":"1979","author":"Friedman","key":"10.1016\/0167-6423(86)90016-X_BIB3"},{"year":"1981","series-title":"The Science of Programming","author":"Gries","key":"10.1016\/0167-6423(86)90016-X_BIB4"},{"article-title":"A distributed path algorithm and its correctness proof","year":"1980","author":"Martin","key":"10.1016\/0167-6423(86)90016-X_BIB5"},{"issue":"1","key":"10.1016\/0167-6423(86)90016-X_BIB6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TIT.1983.1056620","article-title":"Distributed network protocols","volume":"29","author":"Segall","year":"1983","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1981","series-title":"Computer Networks","author":"Tannenbaum","key":"10.1016\/0167-6423(86)90016-X_BIB7"},{"article-title":"A distributed path algorithm and its correctness proof","year":"1983","author":"Wright","key":"10.1016\/0167-6423(86)90016-X_BIB8"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238690016X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764238690016X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:50:19Z","timestamp":1553442619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764238690016X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":8,"alternative-id":["016764238690016X"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90016-x","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[1986]]}}}