{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T02:09:49Z","timestamp":1785377389465,"version":"3.55.0"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1016\/0020-0190(92)90100-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"117-119","source":"Crossref","is-referenced-by-count":4,"title":["A note on the reconstruction of a binary tree from its traversals"],"prefix":"10.1016","volume":"42","author":[{"given":"Naveen","family":"Gabrani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Priti","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(92)90100-A_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(90)90224-L","article-title":"Construction of a tree from its traversals in optimal time and space","volume":"34","author":"Andersson","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90100-A_BIB2","first-page":"309","article-title":"Highly parallelizable problems","author":"Berkman","year":"1989","journal-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(92)90100-A_BIB3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01934177","article-title":"Alternative methods for reconstruction of trees from their traversals","volume":"27","author":"Burgdorff","year":"1987","journal-title":"BIT"},{"key":"10.1016\/0020-0190(92)90100-A_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(88)90177-9","article-title":"Two algorithms for constructing a binary trees from its traversals","volume":"28","author":"Chen","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90100-A_BIB5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(83)90046-7","article-title":"Listing and counting subtrees of equal size of a binary tree","volume":"17","author":"Hikita","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90100-A_BIB6","article-title":"Optimal parallel algorithms for sorted intervals","author":"Kwon-Kim","year":"1989","journal-title":"Proc. Ann. Allerton Conf."},{"key":"10.1016\/0020-0190(92)90100-A_BIB7","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90100-A_BIB8","first-page":"484","article-title":"An optimal parallel algorithm to reconstruct a binary tree from its traversals","volume":"497","author":"Olariu","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290100A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290100A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:21:19Z","timestamp":1555118479000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290100A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290100A"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90100-a","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}