{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T07:57:28Z","timestamp":1672646248284},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"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":[[2000,7]]},"DOI":"10.1016\/s0304-3975(98)00205-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:59:25Z","timestamp":1027605565000},"page":"125-142","source":"Crossref","is-referenced-by-count":10,"title":["A new algorithm for linear regular tree pattern matching"],"prefix":"10.1016","volume":"242","author":[{"given":"Priti","family":"Shankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitranjan","family":"Gantait","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.R.","family":"Yuvaraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maya","family":"Madhavan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00205-9_BIB1","doi-asserted-by":"crossref","unstructured":"A.V. Aho, M. Ganapathi, Efficient tree pattern matching: an aid to code generation, in: Proc. 12th ACM Symp. on Priciples of Programming Languages, 1985, pp. 334\u2013340.","DOI":"10.1145\/318593.318663"},{"issue":"15","key":"10.1016\/S0304-3975(98)00205-9_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0096-0551(90)90006-B","article-title":"Efficient retargetable code generation using bottom up tree pattern matching","volume":"3","author":"Balachandran","year":"1990","journal-title":"Comput. Lang."},{"key":"10.1016\/S0304-3975(98)00205-9_BIB3","doi-asserted-by":"crossref","unstructured":"D. Chase, An improvement to bottom up tree pattern matching, in: Proc. 14th Ann. ACM Symp. on Principles of Programming Languages, 1987, pp. 168\u2013177.","DOI":"10.1145\/41625.41640"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB4","doi-asserted-by":"crossref","unstructured":"M. Dubiner, Z. Galil, E. Magen, Faster tree pattern matching, in: Proc. 31st IEEE FOCS \u201990, 1990.","DOI":"10.1109\/FSCS.1990.89533"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB5","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/BF01178733","article-title":"Tree automata for code selection","volume":"31","author":"Ferdinand","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(98)00205-9_BIB6","unstructured":"A. Gantait, A new algorithm for tree pattern matching and its application to retargetable code generation, M.E. Project Report, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, December 1996."},{"key":"10.1016\/S0304-3975(98)00205-9_BIB7","doi-asserted-by":"crossref","unstructured":"R.S. Glanville, S.L. Graham, A new method for compiler code generation, in: Proc. 5th Ann. ACM Symp. on Principles of Programming Languages, 1978, pp. 231\u2013240.","DOI":"10.1145\/512760.512785"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB8","doi-asserted-by":"crossref","unstructured":"P.Hatcher, T. Christopher, High-quality code generation via bottom-up tree pattern matching, in: Proc. 13th ACM Symp. on Principles of Programming Languages, 1986, pp. 119\u2013130.","DOI":"10.1145\/512644.512655"},{"issue":"1","key":"10.1016\/S0304-3975(98)00205-9_BIB9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern matching in trees","volume":"29","author":"Hoffmann","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB10","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB11","doi-asserted-by":"crossref","unstructured":"Maya Madhavan, Optimal regular tree pattern matching using pushdown automata, MSc(Engineering) Thesis, Dept. of Computer Science and Automation. Indian Institute of Science, Bangalore, 1998.","DOI":"10.1007\/978-3-540-49382-2_11"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB12","doi-asserted-by":"crossref","unstructured":"E. Pelegri Llopart, S. Graham, Optimal code generation for expression trees: An application of BURS theory, in: Proc. 15th Annual ACM Symp. on Principles of Programming Languages, 1988, pp. 294\u2013308.","DOI":"10.1145\/73560.73586"},{"key":"10.1016\/S0304-3975(98)00205-9_BIB13","unstructured":"S. Ravi Kumar, Retargettable code generation using bottom up tree pattern matching, M.E Project Report, Department of Computer Science and Automation, Indian Institute of Science, Bangalore, 1992."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002059?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598002059?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T22:06:55Z","timestamp":1578521215000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598002059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397598002059"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00205-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}