{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:31:47Z","timestamp":1736314307433,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540619949"},{"type":"electronic","value":"9783540495888"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0037425","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:15:55Z","timestamp":1138202155000},"page":"417-424","source":"Crossref","is-referenced-by-count":0,"title":["Efficient tree pattern unification"],"prefix":"10.1007","author":[{"given":"Peter","family":"Ru\u017ei\u010dka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,26]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","volume":"16","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V.-Corasick, M.J.: Efficient string matching: an aid to bibliographic search. CACM 16, 1975, pp. 333\u2013340.","journal-title":"CACM"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Apostolico, A.-Iliopoulos, C.-Landau, C.M.-Schieber, B.-Vishkin, U.: Parallel Construction of a Suffix Tree with Applications. Algorithmica, 1988. pp. 347\u2013365.","DOI":"10.1007\/BF01762122"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Cai, J.-Paige, R.-Tarjan, R.: More efficient bottom-up pattern matching. In Proc. of the CAAP, LNCS 577, Springer-Verlag, 1992, pp. 72\u201386.","DOI":"10.21236\/ADA608560"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Dubiner, M.-Galil, Z.-Magen, M.: Faster tree pattern matching. In Proc. of the 31-st FOCS, 1991, pp. 145\u2013150.","DOI":"10.1109\/FSCS.1990.89533"},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C.M. Hoffmann","year":"1982","unstructured":"Hoffmann, C.M.-O'Donnell, M.J.: Pattern matching in trees. JACM 29, 1982, pp. 68\u201395.","journal-title":"JACM"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Efficient tree pattern matching. In Proc. of the 30-th FOCS, 1989, pp. 178\u2013183.","DOI":"10.1109\/SFCS.1989.63475"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"O'Donnell, M.J.: Equational logic as a programming language. MIT Press. 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/128749.128752","volume":"39","author":"R. Ramesh","year":"1992","unstructured":"Ramesh, R.-Ramakrishnan, I.V.: Nonlinear pattern matching in trees. JACM 39, 1992, pp. 295\u2013316.","journal-title":"JACM"},{"key":"33_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF00263501","volume":"27","author":"P. Ru\u017ei\u010dka","year":"1989","unstructured":"Ru\u017ei\u010dka, P.-Pr\u00edvara, I.: An almost linear Robinson unification algorithm. Acta Informatica 27, 1989, pp. 61\u201371.","journal-title":"Acta Informatica"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ru\u017ei\u010dka, P.-Pr\u00edvara, I.: On tree pattern unification problems. In Proc. of the 9-th FCT, LNCS 710, Springer-Verlag, 1993, pp. 418\u2013429.","DOI":"10.1007\/3-540-57163-9_36"},{"key":"33_CR11","unstructured":"Vittek, M.: Many-to-one unification for linear terms (in Slovak). In Proc. of the 2-nd LOP, 1989, pp. 47\u201356."},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear Pattern Matching Algorithm. In Proc. of the 14-th IEEE SWAT (FOCS), 1973, pp. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","SOFSEM'96: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0037425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:46:52Z","timestamp":1736250412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0037425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619949","9783540495888"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0037425","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}