{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T12:09:35Z","timestamp":1648987775716},"reference-count":42,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2004,3]]},"abstract":"<jats:p> A parenthesis string is a string of left and right parentheses. The string is well-formed when it consists of balanced pairs of left and right parentheses. This study presents a novel systolic algorithm for generating all the well-formed parenthesis strings in lexicographical order. The algorithm is cost-optimal and is run on a linear array of processors such that each well-formed parenthesis string can be generated in three time steps. The processor array is appropriate for VLSI implementation, since it has the features of modularity, regularity, and local connection. <\/jats:p>","DOI":"10.1142\/s0129626404001738","type":"journal-article","created":{"date-parts":[[2004,4,30]],"date-time":"2004-04-30T06:44:06Z","timestamp":1083307446000},"page":"83-97","source":"Crossref","is-referenced-by-count":0,"title":["DESIGNING A SYSTOLIC ALGORITHM FOR GENERATING WELL-FORMED PARENTHESIS STRINGS"],"prefix":"10.1142","volume":"14","author":[{"given":"JONG-CHUANG","family":"TSAY","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu, Taiwan, Republic of China"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"Reingold E. M.","year":"1977"},{"key":"rf2","volume-title":"Combinatorial Algorithms","author":"Nijenhuis A.","year":"1975"},{"key":"rf3","unstructured":"S. G.\u00a0Akl and I.\u00a0Stojmenovic, Parallel Computing: Paradigms and Applications, ed. A. Y.\u00a0Zomaya (International Thomson Computer Press, 1996)\u00a0pp. 639\u2013670."},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/34.5.438"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(80)90168-5"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00171-9"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00215-9"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00155-1"},{"key":"rf10","volume-title":"Fundamental of Computer Algorithms","author":"Horowitz E.","year":"1978"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90098-3"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/26.3.205"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/28.5.538"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.6.569"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90030-I"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0960"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626498000055"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90073-0"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1073"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00139-3"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/44.4.292"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1145\/359423.359434"},{"key":"rf23","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/35.3.306"},{"key":"rf24","first-page":"63","volume":"3","author":"Akl S. G.","journal-title":"Nord. J. Comput."},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00155-0"},{"key":"rf26","first-page":"445","volume":"19","author":"Akl S. G.","journal-title":"Comput. and Artif. Intell."},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000116"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934181"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.5.278"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/43.4.290"},{"key":"rf31","doi-asserted-by":"publisher","DOI":"10.1080\/00207168508803477"},{"key":"rf32","doi-asserted-by":"publisher","DOI":"10.1145\/3828.214141"},{"key":"rf33","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.2.171"},{"key":"rf34","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00149-9"},{"key":"rf35","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.5.400"},{"key":"rf36","first-page":"1245","volume":"82","author":"Xiang L.","journal-title":"IEICE Trans. Inf. Syst. E"},{"key":"rf38","doi-asserted-by":"publisher","DOI":"10.1109\/MC.1982.1653825"},{"key":"rf39","volume-title":"VLSI Array Processor","author":"Kung S. Y.","year":"1988"},{"key":"rf40","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1983.12532"},{"key":"rf41","first-page":"1121","volume":"31","author":"Moldovan D. I.","journal-title":"IEEE Trans. Comput. C"},{"key":"rf42","volume-title":"The Art of Computer Programming","volume":"3","author":"Knuth D. E.","year":"1973"},{"key":"rf43","doi-asserted-by":"publisher","DOI":"10.1109\/71.298207"},{"key":"rf44","volume-title":"Using MATLAB, Version 6","year":"2000"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001738","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T09:28:44Z","timestamp":1565170124000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001738"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,3]]},"references-count":42,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,3]]}},"alternative-id":["10.1142\/S0129626404001738"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001738","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,3]]}}}