{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:48:32Z","timestamp":1649015312321},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2002,9]]},"abstract":"<jats:p> Time optimal algorithms on an n-processor BSR PRAM for many n-size problems can be found in the literature. They outpace those on EREW, CREW or CRCW PRAM for the same problems. When only p (1 &lt; p &lt; n) processors are available, efficient algorithms on a p-processor BSR for some n-size problems can not be obtained from those on an n-processor BSR, and they have to be reconsidered. In this paper, we discuss and give two algorithms on a p-processor BSR for the two n-size problems of matching parentheses and decoding a binary tree from its bit-string, respectively, and show that they are time optimal. <\/jats:p>","DOI":"10.1142\/s0129626402001051","type":"journal-article","created":{"date-parts":[[2002,12,11]],"date-time":"2002-12-11T11:18:01Z","timestamp":1039605481000},"page":"365-374","source":"Crossref","is-referenced-by-count":4,"title":["TIME OPTIMAL n-SIZE MATCHING PARENTHESES AND BINARY TREE DECODING ALGORITHMS ON A p-PROCESSOR BSR"],"prefix":"10.1142","volume":"12","author":[{"given":"LIMIN","family":"XIANG","sequence":"first","affiliation":[{"name":"Department of Information Science, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, Fukuoka 812-8581, Japan"}]},{"given":"KAZUO","family":"USHIJIMA","sequence":"additional","affiliation":[{"name":"Department of Information Science, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, Fukuoka 812-8581, Japan"}]},{"given":"JIANJUN","family":"ZHAO","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Fukuoka Institute of Technology, 3-10-1 Wajiro-Higashi, Higasi-ku, Fukuoka 811-0295, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"p_4","first-page":"126","volume":"1997","author":"Bergogne L.","journal-title":"International"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1572"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626494000107"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1109\/71.210809"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1999.1534"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1109\/71.485530"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1109\/71.790602"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1109\/71.954621"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626402001051","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:18:52Z","timestamp":1565108332000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626402001051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":8,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2002,9]]}},"alternative-id":["10.1142\/S0129626402001051"],"URL":"https:\/\/doi.org\/10.1142\/s0129626402001051","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}