{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T15:51:48Z","timestamp":1732031508049},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1016\/0167-8191(85)90026-2","type":"journal-article","created":{"date-parts":[[2004,8,26]],"date-time":"2004-08-26T23:00:20Z","timestamp":1093561220000},"page":"163-171","source":"Crossref","is-referenced-by-count":10,"title":["Parallel algorithms for tree traversals"],"prefix":"10.1016","volume":"2","author":[{"given":"N.C.","family":"Kalra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.C.P.","family":"Bhatt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(85)90026-2_BIB1","volume":"Vol. 1","author":"Knuth","year":"1973"},{"key":"10.1016\/0167-8191(85)90026-2_BIB2","series-title":"Fundamentals of Data Structure","author":"Horowitz","year":"1977"},{"key":"10.1016\/0167-8191(85)90026-2_BIB3","series-title":"Data Structure Techniques","author":"Standish","year":"1980"},{"key":"10.1016\/0167-8191(85)90026-2_BIB4","article-title":"The Complexity of Parallel Computations","author":"Wyllie","year":"1979"},{"issue":"1","key":"10.1016\/0167-8191(85)90026-2_BIB5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(82)90131-4","article-title":"Parallel algorithms for the connected components and minimal spanning tree problems","volume":"14","author":"Nath","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8191(85)90026-2_BIB6","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819185900262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819185900262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T16:58:01Z","timestamp":1549299481000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819185900262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0167819185900262"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(85)90026-2","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}