{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T17:50:02Z","timestamp":1694627402760},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[1994]]},"DOI":"10.1109\/71.308536","type":"journal-article","created":{"date-parts":[[2002,8,24]],"date-time":"2002-08-24T19:16:32Z","timestamp":1030216592000},"page":"995-1008","source":"Crossref","is-referenced-by-count":6,"title":["Efficient EREW PRAM algorithms for parentheses-matching"],"prefix":"10.1109","volume":"5","author":[{"given":"S.K.","family":"Prasad","sequence":"first","affiliation":[]},{"given":"S.K.","family":"Das","sequence":"additional","affiliation":[]},{"given":"C.C.-Y.","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"185","article-title":"An optimal EREW parallel algorithm for parentheses matching","volume":"3","author":"tsang","year":"1989","journal-title":"Proc Int Conf Parallel Processing"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/12.46288"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18991-2_57"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178563"},{"key":"ref34","first-page":"924","article-title":"Parallel algorithms for bucket sorting and the data dependent prefix problem","author":"wagner","year":"1986","journal-title":"Proc Int Conf Parallel Processing"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0217049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0217009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55599-4_85"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54029-6_193"},{"key":"ref15","author":"das","year":"1991","journal-title":"A divide-and-conquer algorithm for parentheses matching"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2166.357211"},{"key":"ref17","author":"deo","year":"1989","journal-title":"Two EREW algorithms for parentheses matching"},{"key":"ref18","first-page":"126","article-title":"Two EREW algorithms for parentheses matching","author":"deo","year":"1991","journal-title":"Proc 5th Int Parallel Processing Symp"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90326-W"},{"key":"ref28","author":"lewis","year":"1993","journal-title":"Fast Parallel Algorithms for Parentheses Matching"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3318.3478"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90011-X"},{"key":"ref3","first-page":"267","author":"baccelli","year":"1982","journal-title":"Acta Informatica"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-4832-3187-7.50007-6"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/140901.140913"},{"key":"ref5","author":"berkman","year":"1988","journal-title":"Some doubly logarithmic optimal parallel algorithms based on finding all nearest smaller values"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IPPS.1991.153768"},{"key":"ref7","author":"chen","year":"1991","journal-title":"Efficient parallel algorithms and data structures related to trees"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90003-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90078-A"},{"key":"ref1","author":"akker","year":"1989","journal-title":"An annotated bibliography on parallel parsing"},{"key":"ref20","author":"gibbons","year":"1988","journal-title":"Efficient Parallel Algorithms"},{"key":"ref22","author":"harrison","year":"1978","journal-title":"Introduction to Formal Language Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90097-H"},{"key":"ref24","first-page":"766","article-title":"Optimal parallel algorithms on sorted intervals","author":"kim","year":"1989","journal-title":"Proc 27th Annual Allerton Conf on Communication Control and Computing"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90047-6"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"ref25","author":"kim","year":"1990","journal-title":"Parallel algorithms for geometric intersection graphs"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx4\/71\/7511\/00308536.pdf?arnumber=308536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:13:40Z","timestamp":1638216820000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/308536\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":34,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/71.308536","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[1994]]}}}