{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T10:32:45Z","timestamp":1648636365328},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00131-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:01:16Z","timestamp":1027612876000},"page":"187-223","source":"Crossref","is-referenced-by-count":2,"title":["Automata-driven efficient subterm unification"],"prefix":"10.1016","volume":"254","author":[{"given":"R.","family":"Ramesh","sequence":"first","affiliation":[]},{"given":"I.V.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"R.C.","family":"Sekar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0304-3975(99)00131-0_BIB1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"CACM"},{"issue":"4","key":"10.1016\/S0304-3975(99)00131-0_BIB2","first-page":"758","article-title":"Variations on the common subexpression problem","volume":"24","author":"Downey","year":"1980","journal-title":"J. Appl. Comput. Math."},{"issue":"1","key":"10.1016\/S0304-3975(99)00131-0_BIB3","first-page":"68","article-title":"Pattern matching in trees","volume":"29","author":"Hoffmann","year":"1982","journal-title":"J. Appl. Comput. Math."},{"key":"10.1016\/S0304-3975(99)00131-0_BIB4","series-title":"Essays in Computational Logic (in honor of Alan Robinson)","article-title":"Computations in orthogonal rewriting systems","author":"Huet","year":"1991"},{"key":"10.1016\/S0304-3975(99)00131-0_BIB5","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple word problems in universal algebras","author":"Knuth","year":"1970"},{"issue":"2","key":"10.1016\/S0304-3975(99)00131-0_BIB6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/S0304-3975(99)00131-0_BIB7","unstructured":"A. Martelli, U. Montanari, Unification in linear time and space: a structured presentation, internal report #B76-16, Instituto di Elaborazione della Informazione, Consiglio Nazionale delle Ricerche, Pisa, Italy, July 1976."},{"issue":"2","key":"10.1016\/S0304-3975(99)00131-0_BIB8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0304-3975(99)00131-0_BIB9","first-page":"295","article-title":"Nonlinear pattern matching in trees","volume":"39","author":"Ramesh","year":"1992","journal-title":"J. Appl. Comput. Math."},{"key":"10.1016\/S0304-3975(99)00131-0_BIB10","unstructured":"R. Ramesh, I.V. Ramakrishnan, Automata-driven indexing of prolog clauses, Technical Report UTDCS2092, Department of Computer Science, University of Texas at Dallas, (To appear in J. Logic programm.), Also available through anonymous ftp as ftp.utdallas.edu:\/pub\/cs\/ramesh\/jlp.dvi."},{"issue":"2","key":"10.1016\/S0304-3975(99)00131-0_BIB11","first-page":"215","article-title":"On the efficiency of a good but not linear set merging algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. Appl. Comput. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001310?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001310?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T20:59:56Z","timestamp":1555880396000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001310"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001310"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00131-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}