{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:13Z","timestamp":1725663793174},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540525905"},{"type":"electronic","value":"9783540470427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52590-4_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:38:33Z","timestamp":1330187913000},"page":"72-86","source":"Crossref","is-referenced-by-count":6,"title":["More efficient bottom-up tree pattern matching"],"prefix":"10.1007","author":[{"given":"J.","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Paige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","unstructured":"Aho, A., Hopcroft, J., and Ullman, J., Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"5_CR2","unstructured":"Borstler, J., Moncke, U., and Wilhelm, R., Table Compression for Tree Automata, Lehrstuhl fur Informatik III, Universitat des Saarlandes, 1987."},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0026092","volume":"299","author":"J. Burghardt","year":"1988","unstructured":"Burghardt, J., \u201cA Tree Pattern Matching Algorithm with Reasonable Space Requirements,\u201d in Proc. CAAP '88, ed. M. Daudet and M. Nivat, Lecture Notes in Computer Science, vol. 299, pp. 1\u201315, Springer-Verlag, 1988.","journal-title":"Lecture Notes in Computer Science"},{"key":"5_CR4","unstructured":"Cai, J. and Paige, R., \u201cThe RAPTS Transformational System \u2014 A Proposal For Demonstration,\u201d in ESOP '90 Systems Exhibition, May 1990."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Chase, D., \u201cAn improvement to bottom-up tree pattern matching,\u201d in Proc. Fourteenth Annual ACM Symposium on Principles of Programming Languages, pp. 168\u2013177, January, 1987.","DOI":"10.1145\/41625.41640"},{"key":"5_CR6","unstructured":"Donzeau-Gouge, V., Huet, G., Kahn, G., and Lang, B., \u201cProgramming environments based on structured Editors: the Mentor Experience,\u201d in Interactive Programming Environments, ed. D. Barstow, H. Shrobe, and E. Sandewall, McGraw-Hill, 1984."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Givler, J. and Kieburtz, R., \u201cSchema Recognition for Program Transformations,\u201d in ACM Symposium on LISP and Functional Programming, pp. 74\u201385, Aug, 1984.","DOI":"10.1145\/800055.802023"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L. and Sedgewick, R., \u201cA dichromatic framework for balanced trees,\u201d in Proc. 19th IEEE FOCS, pp. 157\u2013184, 1978.","DOI":"10.1109\/SFCS.1978.3"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Hatcher, P. and Christopher, T., \u201cHigh-Quality Code Generation Via Bottom-Up Tree Pattern Matching,\u201d in Proceedings 13th ACM Symposium on Principles of Programming Languages, pp. 119\u2013130, Jan, 1986.","DOI":"10.1145\/512644.512655"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. Hoffmann","year":"1982","unstructured":"Hoffmann, C. and O'Donnell, J., \u201cPattern Matching in Trees,\u201d JACM, vol. 29, no. 1, pp. 68\u201395, Jan, 1982.","journal-title":"JACM"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/357153.357158","volume":"4","author":"C. Hoffmann","year":"1982","unstructured":"Hoffmann, C. and O'Donnell, M., \u201cProgramming with Equations,\u201d ACM TOPLAS, vol. 4, no. 1, pp. 83\u2013112, Jan., 1982.","journal-title":"ACM TOPLAS"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/72551.72554","volume":"21","author":"P. Hudak","year":"1989","unstructured":"Hudak, P., \u201cConception, Evolution, and Application of Functional Programming Languages,\u201d ACM Computing Survey, vol. 21, no. 3, pp. 359\u2013411, Sep. 1989.","journal-title":"ACM Computing Survey"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF00264598","volume":"11","author":"G. Huet","year":"1978","unstructured":"Huet, G. and Lang, B., \u201cProving and Applying Program Transformations Expressed with Second-Order Patterns,\u201d Acta Informatica, vol. 11, pp. 31\u201355, 1978.","journal-title":"Acta Informatica"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Knuth, D. and Bendix, P., \u201cSimple Word Problems in Universal Algebras,\u201d in Computational Problems in Abstract Algebra, ed. Leech, J., pp. 263\u2013297, Pergamon Press, 1970.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Kosaraju, S., \u201cEfficient Tree Pattern Matching,\u201d in Proc. FOCS '89, Oct., 1989.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"5_CR16","unstructured":"Maluszynski, J. and Komorowski, H. J., \u201cUnification-free execution of logic programs,\u201d IEEE Proceedings of symposium on logic programming, Boston, 1985."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Pelegri-Llopart, E. and Graham, S., \u201cOptimal Code Generation for Expression Trees: An Application of BURS Theory,\u201d in Proceedings 15th ACM Symposium on Principles of Programming Languages, pp. 294\u2013308, Jan, 1988.","DOI":"10.1145\/73560.73586"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Pfenning, F. and Elliott, C., \u201cHigher-Order Abstract Syntax,\u201d in Proceedings SIGPLAN '88 Conf. on Prog. Lang. Design and Implementation, pp. 199\u2013208, June, 1988.","DOI":"10.1145\/960116.54010"},{"key":"5_CR19","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/3-540-15976-2_21","volume":"202","author":"P. Purdom","year":"1985","unstructured":"Purdom, P. and Brown, C., \u201cFast Many-to-one Matching Algorithm,\u201d in Proc. RTA '85, ed. J.-P. Jouannaud, Lecture Notes in Computer Science, vol. 202, pp. 407\u2013416, Springer-Verlag, 1985.","journal-title":"Lecture Notes in Computer Science"},{"issue":"7","key":"5_CR20","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N. and Tarjan, R., \u201cPlanar Point Location Using Persistent Search Trees,\u201d CACM, vol. 29, no. 7, pp. 669\u2013679, July, 1986.","journal-title":"CACM"},{"key":"5_CR21","unstructured":"Sethi, R., Programming Languages: Concepts and Constructs, Addison-Wesley, 1989."},{"key":"5_CR22","unstructured":"Standish, T., Kibler, D., and Neighbors, J., \u201cThe Irvine Program Transformation Catalogue,\u201d Univ. of Cal. at Irvine, Dept. of Information and Computer Science, Jan, 1976."},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Tarjan, R., Data Structures and Network Algorithms, SIAM, 1984.","DOI":"10.1137\/1.9781611970265"},{"key":"5_CR24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas Van","year":"1977","unstructured":"Van Emde Boas, P., \u201cPreserving Order in a Forest in Less Than Logarithmic Time and Linear Space,\u201d IPL, vol. 6, pp. 80\u201382, 1977.","journal-title":"IPL"},{"key":"5_CR25","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D. Willard","year":"1983","unstructured":"Willard, D., \u201cLog-Logarithmic Worst-Case Range Queries are Possible in Space O(N),\u201d IPL, vol. 17, pp. 81\u201389, 1983.","journal-title":"IPL"}],"container-title":["Lecture Notes in Computer Science","CAAP '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52590-4_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:24:45Z","timestamp":1605630285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52590-4_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525905","9783540470427"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-52590-4_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}