{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:01Z","timestamp":1725663961926},"publisher-location":"Berlin, Heidelberg","reference-count":12,"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_193","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:24:48Z","timestamp":1330208688000},"page":"443-454","source":"Crossref","is-referenced-by-count":2,"title":["Some fast parallel algorithms for parentheses matching"],"prefix":"10.1007","author":[{"given":"Sajal K.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Calvin C. -Y.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gene","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"45_CR1","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1145\/3318.3478","volume":"7","author":"I. Bar-On","year":"1985","unstructured":"I. Bar-On and U. Vishkin, \u201cOptimal Generation of a Computation Tree Form,\u201d ACM Trans. Program. Lang. Syst., Vol. 7, No. 2, pp. 659\u2013663, 1985.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"N. G. de Bruijn, D. E. Knuth, and S. O. Rice, \u201cThe Average Height of Planted Plane Trees,\u201d in Graph theory and Computing (Ed. R. C. Reid), Academic Press, pp. 15\u201322, 1972.","DOI":"10.1016\/B978-1-4832-3187-7.50007-6"},{"key":"45_CR3","unstructured":"C.-Y. Chen and S. K. Das, \u201cA Cost-Optimal Parallel Algorithm for the Parentheses Matching Problem on an EREW PRAM,\u201d Tech. Rep. N-90-005, Dept. Comput. Sci., Univ. North Texas, Denton, TX, May 1990."},{"key":"45_CR4","unstructured":"C.-Y. Chen and S. K. Das, \u201cBreadth-First Traversal of Trees and Integer Sorting in Parallel,\u201d Tech. Rep. CRPDC-90-4, Center for Research in Parallel and Distributed Computing, Dept. Comput. Sci., Univ. North Texas, Denton, TX, Nov. 1990."},{"key":"45_CR5","series-title":"Tech. Rep.","volume-title":"Two EREW Algorithms for Parentheses Matching","author":"N. Deo","year":"1989","unstructured":"N. Deo and S. Prasad, \u201cTwo EREW Algorithms for Parentheses Matching,\u201d Tech. Rep. CS-TR-89-18, Comput.Sci. Dept., Univ. Central Florida, Orlando, 1989."},{"key":"45_CR6","series-title":"Tech. Rep.","volume-title":"Fast Parallel Algorithms for Parentheses Matching","author":"G. Lewis","year":"1991","unstructured":"G. Lewis, and S. K. Das, \u201cFast Parallel Algorithms for Parentheses Matching,\u201d Tech. Rep., Dept. Comput. Sci., Univ. North Texas, Denton, in preparation, 1991."},{"key":"45_CR7","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer, \u201cParallel Prefix Computation,\u201d JACM, Vol. 27, pp. 831\u2013838, 1980.","journal-title":"JACM"},{"key":"45_CR8","series-title":"Tech. Rep.","volume-title":"Matching Parentheses in Parallel","author":"C. Levcopoulos","year":"1989","unstructured":"C. Levcopoulos and P. Petersson, \u201cMatching Parentheses in Parallel,\u201d Tech. Rep. LUCS-TR:89\u201347, Dept. Comput. Sci., Lund Univ, Lund, Sweden, July 1989."},{"key":"45_CR9","unstructured":"G. A. Mago, \u201cA Network of Computers to Execute Reduction Languages,\u201d Int. J. Comput. Inform. Sci., 1979."},{"key":"45_CR10","doi-asserted-by":"crossref","unstructured":"W. Rytter and K. Diks, \u201cOn Optimal Parallel Computations for Sequences of Brackets,\u201d manuscript, 14 pages, 1990.","DOI":"10.1007\/978-1-4612-3352-7_7"},{"key":"45_CR11","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","volume":"2","author":"J. T. Schwartz","year":"1980","unstructured":"J. T. Schwartz, \u201cUltracomputers,\u201d ACM Trans. Program. Lang. Syst., Vol. 2, pp. 484\u2013521, Oct. 1980.","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"45_CR12","first-page":"185","volume":"3","author":"W. W. Tsang","year":"1989","unstructured":"W. W. Tsang, T. W. Lam, F. Chin, \u201cAn Optimal EREW Parallel Algorithm for Parentheses Matching,\u201d Proc. Int. Conf. Parallel Process., Vol. 3, pp. 185\u2013192, 1989.","journal-title":"Proc. Int. Conf. Parallel Process."}],"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_193.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:52:10Z","timestamp":1605646330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54029-6_193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540298","9783540473596"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54029-6_193","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}