{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:14Z","timestamp":1725663974172},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540298"},{"type":"electronic","value":"9783540473596"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54029-6_198","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:25:04Z","timestamp":1330208704000},"page":"484-495","source":"Crossref","is-referenced-by-count":1,"title":["An optimal parallel algorithm to reconstruct a binary tree from its traversals"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Olariu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Overstreet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaofang","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(90)90224-L","volume":"34","author":"A. Anderson","year":"1990","unstructured":"A. Anderson, S. Carlsson, \u201cConstruction of a tree from its traversals in optimal time and space,\u201d Information Processing Letters, 34 (1990) pp. 21\u201325","journal-title":"Information Processing Letters"},{"key":"50_CR2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0890-5401(89)90003-5","volume":"82","author":"R. J. Anderson","year":"1989","unstructured":"R. J. Anderson, E. W. Mayr and M. K. Warmuth, \u201cParallel approximation algorithms for bin packing,\u201d Information and Computation, 82, October, 1989, pp. 262\u2013277.","journal-title":"Information and Computation"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"O. Berkman, Z. Galil, B. Schieber and U. Vishkin, \u201cHighly Parallelizable Problems,\u201d in Proceedings of the IEEE Symposium on Foundation of Computer Science, 1989.","DOI":"10.1145\/73007.73036"},{"key":"50_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(88)90177-9","volume":"28","author":"G. H. Chen","year":"1988","unstructured":"G. H. Chen, M. S. Yu and L. T. Liu, \u201cTwo algorithms for constructing a binary tree from its traversals,\u201d Information Processing Letters, 28 (1988) pp. 297\u2013299.","journal-title":"Information Processing Letters"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"R. Cole, \u201cParallel Merge sort,\u201d in Proceedings of the 27th Annual IEEE Symposium on the Foundations of Computer Science, 1986, pp. 511\u2013516.","DOI":"10.1109\/SFCS.1986.41"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, \u201cApproximate and exact parallel scheduling with applications to list, tree and graph,\u201d Proc. 27th Annual Symp. on Foundations of Computer Science, 1986, pp. 487\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"C. Kruskal, \u201cSearching, merging and sorting in parallel computation,\u201d IEEE Transactions on Computers C-32, 10 (October), pp.942\u2013946.","DOI":"10.1109\/TC.1983.1676138"},{"key":"50_CR8","volume-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms, Second Edition, Addison-Wesley, Reading, Mass., 1973.","edition":"Second Edition"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"F. Springsteel, I. Stojmenovic, \u201cParallel general prefix computations with geometric, algebraic and other applications,\u201d In Proceedings of International Conference on Fundamentals of Computation Theory, Szeged, Hungary, August 1989, 424\u2013433, Springer-Verlag.","DOI":"10.1007\/3-540-51498-8_41"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan and U. Vishkin, \u201cFinding biconnected and computing tree functions in logarithmic parallel time,\u201d in Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984, pp. 12\u201322.","DOI":"10.1109\/SFCS.1984.715896"},{"key":"50_CR11","unstructured":"U. Vishkin, \u201cSynchronous parallel computation,\u201d a Survey, TR 71, Dept. of Computer Science, Courant Institute, NYU, 1983."}],"container-title":["Lecture Notes in Computer Science","Advances in Computing and Information \u2014 ICCI '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54029-6_198.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:52:11Z","timestamp":1605646331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54029-6_198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540298","9783540473596"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-54029-6_198","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}