{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:37:51Z","timestamp":1648971471721},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7533,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0166-218x(92)90011-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"423-431","source":"Crossref","is-referenced-by-count":4,"title":["Matching parentheses in parallel"],"prefix":"10.1016","volume":"40","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90011-X_BIB1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","article-title":"A simple parallel tree contraction algorithm","volume":"10","author":"Abrahamson","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)90011-X_BIB2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/0890-5401(89)90003-5","article-title":"Parallel approximation algorithms for bin packing","volume":"82","author":"Anderson","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0166-218X(92)90011-X_BIB3","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/3318.3478","article-title":"Optimal parallel generation of a computation tree form","volume":"7","author":"Bar-On","year":"1985","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0166-218X(92)90011-X_BIB4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the crcw pram","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90011-X_BIB5","first-page":"309","article-title":"Highly parallelizable problems","author":"Berkman","year":"1989","journal-title":"Proceedings 21th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(92)90011-X_BIB6","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/SFCS.1989.63478","article-title":"Recursive \u2217-tree parallel data structure","author":"Berkman","year":"1989","journal-title":"Proceedings 30th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(92)90011-X_BIB7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90011-X_BIB8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower bounds for parallel random access machines without concurrent writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90011-X_BIB9","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/2166.357211","article-title":"Parallel generation of postfix and tree forms","volume":"5","author":"Dekel","year":"1983","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0166-218X(92)90011-X_BIB10","author":"Diks","year":"1990","journal-title":"On optimal parallel computations for sequences of brackets"},{"key":"10.1016\/0166-218X(92)90011-X_BIB11_1","series-title":"Rept. UCB\/CSD 88\/408","article-title":"A survey of parallel algorithms for shared memory machines","author":"Karp","year":"1988"},{"key":"10.1016\/0166-218X(92)90011-X_BIB11_2","series-title":"Handbook of Theoretical Computer Science","author":"Karp","year":"1990"},{"key":"10.1016\/0166-218X(92)90011-X_BIB12","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","article-title":"The power of parallel prefix","volume":"34","author":"Kruskal","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90011-X_BIB13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90011-X_BIB14","first-page":"585","article-title":"An optimal parallel parsing algorithm for a class of block-structured languages","author":"Sarkar","year":"1987","journal-title":"Proceedings 1987 International Conference on Parallel Processing"},{"key":"10.1016\/0166-218X(92)90011-X_BIB15","author":"Sarkar","year":"1989","journal-title":"A parallel algorithm for parenthesis matching"},{"key":"10.1016\/0166-218X(92)90011-X_BIB16","first-page":"185","article-title":"An optimal erew parallel algorithm for parenthesis matching","author":"Tsang","year":"1989","journal-title":"Proceedings 1989 International Conference on Parallel Processing III"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290011X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290011X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:24:28Z","timestamp":1555136668000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290011X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0166218X9290011X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90011-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}