{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:46:27Z","timestamp":1648874787265},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"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":7990,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0304-3975(91)90326-w","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"251-262","source":"Crossref","is-referenced-by-count":6,"title":["On optimal parallel computations for sequences of brackets"],"prefix":"10.1016","volume":"87","author":[{"given":"Krzysztof","family":"Diks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90326-W_BIB1","series-title":"Techn. Report 97-30","article-title":"A simple parallel tree contraction algorithm","author":"Abrahamson","year":"1987"},{"issue":"2","key":"10.1016\/0304-3975(91)90326-W_BIB2","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/3318.3478","article-title":"Optimal parallel generation of the computation tree form","volume":"7","author":"Bar-On","year":"1985","journal-title":"ACM Trans. Programming Languages Systems"},{"issue":"2","key":"10.1016\/0304-3975(91)90326-W_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90326-W_BIB4","first-page":"220","article-title":"Testing isomorphism of outerplanar graphs in parallel","volume":"Vol. 324","author":"Chlebus","year":"1988"},{"key":"10.1016\/0304-3975(91)90326-W_BIB5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01762121","article-title":"The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time","volume":"3","author":"Cole","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(91)90326-W_BIB6","first-page":"91","article-title":"Optimal parallel algorithms for expression tree evaluation and list ranking","volume":"Vol. 319","author":"Cole","year":"1988"},{"key":"10.1016\/0304-3975(91)90326-W_BIB7","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0890-5401(89)90027-8","article-title":"An optimal parallel algorithm for dynamic expression evaluation and its applications","volume":"81","author":"Gibbons","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(91)90326-W_BIB8","series-title":"Efficient Parallel Algorithms","author":"Gibbons","year":"1988"},{"key":"10.1016\/0304-3975(91)90326-W_BIB9","first-page":"101","article-title":"Optimal parallel evaluation of tree structured computations by raking","volume":"Vol. 319","author":"Kosaraju","year":"1988"},{"key":"10.1016\/0304-3975(91)90326-W_BIB10","first-page":"478","article-title":"Parallel tree contraction and its application","author":"Miller","year":"1985","journal-title":"Proc. FOCS"},{"key":"10.1016\/0304-3975(91)90326-W_BIB11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0304-3975(87)90070-3","article-title":"Optimal parallel parsing of bracket languages","volume":"53","author":"Rytter","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90326-W_BIB12","first-page":"138","article-title":"A note on parallel transformations of regular expressions to nondeterministic finite automate","volume":"Vol. 38","author":"Rytter","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190326W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190326W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:55:09Z","timestamp":1555113309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190326W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["030439759190326W"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90326-w","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}