{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:05:45Z","timestamp":1648929945424},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1992,3]]},"abstract":"<jats:p> Encoding the shape of a binary tree is a basic step in a number of algorithms in integrated circuit design, automated theorem proving, and game playing. We propose cost-optimal parallel algorithms to solve the binary tree encoding\/decoding problem. Specifically, we encode the relevant shape information of an n-node binary tree in a 2n bitstring. Conversely, given an arbitrary 2n bitstring we reconstruct the shape of the corresponding binary tree, if such a tree exists. All our algorithms run in O (log n) time using O (n\/log n) processors in the EREW-PRAM model of computation. <\/jats:p>","DOI":"10.1142\/s0129054192000024","type":"journal-article","created":{"date-parts":[[2004,11,25]],"date-time":"2004-11-25T00:50:24Z","timestamp":1101343824000},"page":"1-10","source":"Crossref","is-referenced-by-count":5,"title":["OPTIMAL PARALLEL ENCODING AND DECODING ALGORITHMS FOR TREES"],"prefix":"10.1142","volume":"03","author":[{"given":"STEPHAN","family":"OLARIU","sequence":"first","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAMES L.","family":"SCHWING","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JINGYUAN","family":"ZHANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Old Dominion University, Norfolk, VA 23529\u20130162, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054192000024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:51:47Z","timestamp":1565139107000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054192000024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1992,3]]}},"alternative-id":["10.1142\/S0129054192000024"],"URL":"https:\/\/doi.org\/10.1142\/s0129054192000024","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}