{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:17Z","timestamp":1725664457704},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_132","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:42:16Z","timestamp":1330274536000},"page":"288-299","source":"Crossref","is-referenced-by-count":1,"title":["Automata-driven efficient subterm unification"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"No.6","key":"24_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"A.V. Aho and M.J. Corasick, Efficient String Matching: An Aid to Bibliographic Search, CACM, Vol. 18 No. 6, 1975, pp. 333\u2013340.","journal-title":"CACM"},{"issue":"No.1","key":"24_CR2","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.H. Hoffmann","year":"1982","unstructured":"C.H. Hoffmann and M.J. O'Donnell, Tree Pattern Matching, JACM, Vol. 29 No. 1, 1982, pp. 68\u201395.","journal-title":"JACM"},{"key":"24_CR3","unstructured":"G. Heut and J.-J. Levy, Computations in Orthogonal Rewriting Systems, In Essays in Computational Logic (in honor of Alan Robinson), J.-L. Lassez and G. Plotkin, ed., MIT Press, 1991."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"D. E. Knuth and P. Bendix, Simple word problems in Universal Algebras, In Computational Problems in Abstract Algebra, J. Leech, ed., Pergammon Press, 1970, pp. 263\u2013297.","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"issue":"No.2","key":"24_CR5","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari, An Efficient Unification Algorithm, ACM TOPLAS, Vol. 4 No. 2, 1982, pp. 258\u2013282.","journal-title":"ACM TOPLAS"},{"key":"24_CR6","unstructured":"A. Martelli and 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."},{"issue":"No.2","key":"24_CR7","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"M.S. Paterson and M.N. Wegman, Linear Unification, Journal of Computer System and Science, Vol. 16 No. 2, 1978, pp. 158\u2013167","journal-title":"Journal of Computer System and Science"},{"issue":"No.2","key":"24_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/128749.128752","volume":"39","author":"R. Ramesh","year":"1992","unstructured":"R. Ramesh and I.V. Ramakrishnan, Nonlinear Pattern Matching in Trees, JACM, Vol. 39 No. 2, 1992, pp. 295\u2013316.","journal-title":"JACM"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"R. Ramesh and I.V. Ramakrishnan, Automata-Driven Indexing of Prolog Clauses, in POPL 1990, pp. 281\u2013291 (to appear in Journal of Logic Programming).","DOI":"10.1145\/96709.96738"},{"issue":"No.2","key":"24_CR10","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan, On the Efficiency of a Good but not Linear Set Merging Algorithm, JACM, Vol. 22 No. 2, 1975, pp 215\u2013225.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_132.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:45Z","timestamp":1605648225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_132","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}