{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T16:59:01Z","timestamp":1649005141725},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,2,1]],"date-time":"1995-02-01T00:00:00Z","timestamp":791596800000},"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":6741,"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":[[1995,2]]},"DOI":"10.1016\/0166-218x(93)e0137-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:14:35Z","timestamp":1027635275000},"page":"11-28","source":"Crossref","is-referenced-by-count":0,"title":["Almost fully-parallel parentheses matching"],"prefix":"10.1016","volume":"57","author":[{"given":"Omer","family":"Berkman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0137-N_BIB1","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(93)E0137-N_BIB2","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. Prog. Languages Systems"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB3","series-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","first-page":"83","article-title":"Optimal bounds for decision problems on the CRCW PRAM","author":"Beame","year":"1987"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB4","series-title":"Proceedings of the 3rd Workshop on Algorithms and Data Structures","article-title":"Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs","author":"Berkman","year":"1993"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB5","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1006\/jagm.1993.1018","article-title":"Optimal doubly logarithmic parallel algorithms based on finding all nearest smaller values","volume":"14","author":"Berkman","year":"1993","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB6","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0222017","article-title":"Recursive star-tree parallel data-structure","volume":"22","author":"Berkman","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0137-N_BIB7","series-title":"Proceedings of the 15th Annual ACM Symposium on Theory of Computing","first-page":"52","article-title":"Unbounded fan-in circuits and associative functions","author":"Chandra","year":"1983"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB8","article-title":"Parentheses matching revisited: three parallel algorithms","author":"Chen","year":"1990"},{"key":"10.1016\/0166-218X(93)E0137-N_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. Prog. Languages Systems"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB10","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between concurrent-write models of parallel computation","volume":"1","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0137-N_BIB11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithms for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0137-N_BIB12","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02579170","article-title":"Non linearity of Davenport-Schinzel sequences and generalized path compression schemes","volume":"6","author":"Hart","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(93)E0137-N_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(93)E0137-N_BIB14","series-title":"Proceedings of the 20th Allerton Conference on Communication, Control and Computing","first-page":"272","article-title":"Parsing Dyck languages on parallel machines","author":"Mattheyses","year":"1982"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB15","series-title":"Proceedings of the 26th IEEE Annual Symposium on Foundation of Computer Science","first-page":"532","article-title":"The complexity of parallel sorting","author":"der Heide","year":"1985"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB16","series-title":"Proceedings of the 17th International Colloquium on Automata, Languages and Programming","first-page":"744","article-title":"The parallel simplicity of compaction and chaining","author":"Ragde","year":"1990"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB17","first-page":"970","article-title":"Parallel algorithms for parentheses matching and generation of random balanced sequences of parentheses","volume":"297","author":"Sarkar","year":"1988"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB18","article-title":"Design and analysis of some parallel algorithms","author":"Schieber","year":"1987"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting in a parallel computation model","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)E0137-N_BIB20","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0167-8191(87)90028-7","article-title":"A new parallel algorithm for parsing arithmetic infix expressions","volume":"4","author":"Srikant","year":"1987","journal-title":"Parallel Comput."},{"key":"10.1016\/0166-218X(93)E0137-N_BIB21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0255(87)90031-4","article-title":"Parallel parsing of programming languages","volume":"43","author":"Srikant","year":"1987","journal-title":"Inform. Sci."},{"key":"10.1016\/0166-218X(93)E0137-N_BIB22","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0137-N_BIB23","series-title":"Proceedings of the 18th International Colloquium on Automata, Languages and Programming","first-page":"363","article-title":"Structural parallel algorithmics","author":"Vishkin","year":"1991"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0137N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0137N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T17:54:40Z","timestamp":1555264480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0137N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,2]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,2]]}},"alternative-id":["0166218X93E0137N"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0137-n","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,2]]}}}