{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:42:13Z","timestamp":1648813333465},"reference-count":4,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":["Computer Communications"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/s0140-3664(96)01143-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:03:07Z","timestamp":1027623787000},"page":"1014-1019","source":"Crossref","is-referenced-by-count":0,"title":["Efficient nearer-ancestor algorithm for network routing"],"prefix":"10.1016","volume":"19","author":[{"given":"Kwok-Yan","family":"Lam","sequence":"first","affiliation":[]},{"given":"Lucas C.K.","family":"Hui","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0140-3664(96)01143-7_BIB1","series-title":"Telecommunications: Protocols and Design","author":"Spragins","year":"1991"},{"key":"10.1016\/S0140-3664(96)01143-7_BIB2","series-title":"Proc. 30th Annual Symposium on the Foundation of Computer Science","first-page":"196","article-title":"Recursive \u2217-tree parallel data-structure","author":"Berkman","year":"1989"},{"key":"10.1016\/S0140-3664(96)01143-7_BIB3","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Computing"},{"key":"10.1016\/S0140-3664(96)01143-7_BIB4","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1980.1094721","article-title":"The new routing algorithm for the ARPANET","author":"McQuillan","year":"1980","journal-title":"IEEE Trans. Comm. COM-28"}],"container-title":["Computer Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366496011437?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0140366496011437?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T21:30:24Z","timestamp":1583962224000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0140366496011437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":4,"journal-issue":{"issue":"12","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["S0140366496011437"],"URL":"https:\/\/doi.org\/10.1016\/s0140-3664(96)01143-7","relation":{},"ISSN":["0140-3664"],"issn-type":[{"value":"0140-3664","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}