{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:56:04Z","timestamp":1757627764470,"version":"3.44.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,25]],"date-time":"2004-03-25T00:00:00Z","timestamp":1080172800000},"content-version":"vor","delay-in-days":4436,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1016\/0304-3975(92)90332-a","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"245-264","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal parallel algorithms for forest and term matching"],"prefix":"10.1016","volume":"93","author":[{"given":"Zvi M.","family":"Kedem","sequence":"first","affiliation":[]},{"given":"Krishna V.","family":"Palem","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(92)90332-A_BIB1","first-page":"81","article-title":"Deterministic parallel list ranking","volume":"Vol. 319","author":"Anderson","year":"1988"},{"key":"10.1016\/0304-3975(92)90332-A_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. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(92)90332-A_BIB3","first-page":"309","article-title":"Highly parallelizable problems","author":"Berkman","year":"1989","journal-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90332-A_BIB4","series-title":"Tech. Report, UMIACS-TR-88-79","article-title":"Some doubly logarithmic parallel algorithms based on finding all nearest smaller values","author":"Berkman","year":"1988"},{"key":"10.1016\/0304-3975(92)90332-A_BIB5","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(92)90332-A_BIB6","first-page":"106","article-title":"Universal classes of hash functions","author":"Carter","year":"1977","journal-title":"Proc. 9th Ann. ACM Symp. on Theory of Computing"},{"year":"1981","author":"Clocksin","series-title":"Programming in Prolog","key":"10.1016\/0304-3975(92)90332-A_BIB7"},{"key":"10.1016\/0304-3975(92)90332-A_BIB8","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(92)90332-A_BIB9","first-page":"478","article-title":"Approximate and exact parallel scheduling with application to list, tree and graph problems","author":"Cole","year":"1986","journal-title":"Proc. 27th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(92)90332-A_BIB10","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\/0304-3975(92)90332-A_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","article-title":"On the sequential nature of unification","volume":"1","author":"Dwork","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(92)90332-A_BIB12","series-title":"Proc. 8th Conference on Automated Deduction","article-title":"Parallel algorithms for term matching","author":"Dwork","year":"1986"},{"key":"10.1016\/0304-3975(92)90332-A_BIB13","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern matching in trees","volume":"29","author":"Hoffman","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90332-A_BIB14","series-title":"Formal Language Theory: Perspective and Open Problems","article-title":"Equations and rewrite rules: a survey","author":"Huet","year":"1980"},{"key":"10.1016\/0304-3975(92)90332-A_BIB15","first-page":"569","article-title":"Predicate Logic as a Programming Language","author":"Kowalski","year":"1974","journal-title":"Proc. IFIP '74"},{"key":"10.1016\/0304-3975(92)90332-A_BIB16","first-page":"348","article-title":"A theory of type of polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"JCSS"},{"key":"10.1016\/0304-3975(92)90332-A_BIB17","first-page":"158","article-title":"Linear Unification","volume":"16","author":"Paterson","year":"1978","journal-title":"JCSS"},{"key":"10.1016\/0304-3975(92)90332-A_BIB18","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","article-title":"Optimal and sublogarithmic time randomized parallel sorting algorithms","volume":"18","author":"Rajasekaran","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(92)90332-A_BIB19","article-title":"Term Matching on Parallel Computers","author":"Ramesh","year":"1987","journal-title":"Proc. 14th ICALP"},{"key":"10.1016\/0304-3975(92)90332-A_BIB20","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"year":"1988","author":"Verman","journal-title":"Tight complexity bounds for term matching problems","key":"10.1016\/0304-3975(92)90332-A_BIB21"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290332A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290332A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:24Z","timestamp":1757477904000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290332A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["030439759290332A"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90332-a","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1992,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal parallel algorithms for forest and term matching","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(92)90332-A","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}