{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T11:01:12Z","timestamp":1757588472204},"reference-count":7,"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)90099-h","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"113-115","source":"Crossref","is-referenced-by-count":8,"title":["An optimal algorithm for reconstructing a binary tree"],"prefix":"10.1016","volume":"42","author":[{"given":"V.","family":"Kamakoti","sequence":"first","affiliation":[]},{"given":"C.","family":"Pandu Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90099-H_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(90)90224-L","article-title":"Constructing a tree from its traversal in optimal time and space","volume":"34","author":"Andersson","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90099-H_BIB2","article-title":"Highly parallelizable problems","author":"Berkman","year":"1989","journal-title":"Proc. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(92)90099-H_BIB3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01934177","article-title":"Alternative methods for the reconstruction of trees from their traversals","volume":"27","author":"Burgdorff","year":"1987","journal-title":"BIT"},{"key":"10.1016\/0020-0190(92)90099-H_BIB4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(88)90177-9","article-title":"Two algorithms for constructing binary trees from their traversals","volume":"28","author":"Chen","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90099-H_BIB5","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1007\/BF02219241","article-title":"Constructing a binary tree from its traversals","volume":"29","author":"Makinen","year":"1989","journal-title":"BIT"},{"key":"10.1016\/0020-0190(92)90099-H_BIB6","first-page":"484","article-title":"An optimal parallel algorithm to reconstruct a binary tree from its traversals","volume":"497","author":"Olariu","year":"1991"},{"key":"10.1016\/0020-0190(92)90099-H_BIB7","first-page":"424","article-title":"Parallel general prefix computations with geometric, algebraic, and other applications","volume":"380","author":"Springsteel","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290099H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290099H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:09Z","timestamp":1555144029000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290099H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["002001909290099H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90099-h","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}