{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:09:52Z","timestamp":1725455392509},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540193661"},{"type":"electronic","value":"9783540392392"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/bfb0019797","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:25:50Z","timestamp":1131859550000},"page":"92-107","source":"Crossref","is-referenced-by-count":3,"title":["Distributed algorithms for tree pattern matching"],"prefix":"10.1007","author":[{"given":"Gurdip","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"8_CR1","unstructured":"A.V. Aho and M Ganapathy: \u201cEfficient Tree Pattern Matching: An Aid to Code Generation\u201d, Proceedings of the Eleventh ACM Symposium on Principles of Programming Languages, pp. 334\u2013340 (1984)."},{"key":"8_CR2","unstructured":"B. Awerbuch and Robert G Gallager: \u201cA Distributed BFS Algorithm\u201d, Proceedings of IEEE FOCS, pp. 250\u2013256 (1985)."},{"key":"8_CR3","unstructured":"B. Schieber and S. Moran: \u201cSlowing Sequential Algorithms to Obtain Fast Distributed and Parallel Algorithms: Maximal Matching\u201d, Proceedings of ACM PODC, pp. 282\u2013292 (1986)."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"C.M. Hoffman and M.J. O'Donnell: \u201cPattern Matching in Trees\u201d, Journal of ACM, pp 68\u201395 (Jan. 1982).","DOI":"10.1145\/322290.322295"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"C.M. Hoffman and M.J. O'Donnell: \u201cAn Interpreter Generator using Tree Pattern Matching\u201d, Proceedings of the Sixth Annual Symposium on Principles of Programming Languages, pp. 169\u2013179 (1979).","DOI":"10.1145\/567752.567768"},{"key":"8_CR6","volume-title":"Tree Templates and Subtree Transformational Grammars","author":"H. Kron","year":"1975","unstructured":"H. Kron: \u201cTree Templates and Subtree Transformational Grammars\u201d, Ph.D. Dissertation, University of California, Santa Cruz (1975)."},{"issue":"12","key":"8_CR7","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","volume":"21","author":"J. Guttag","year":"1978","unstructured":"J. Guttag, E. Horowitz and D.R. Musser: \u201cAbstract Data Types and Software Validation\u201d CACM 21, 12, pp. 1048\u20131064 (Dec. 1978).","journal-title":"CACM"},{"key":"8_CR8","series-title":"Tech. Rep.","volume-title":"Rapid Subtree Identification Revisited","author":"M.H. Overmars","year":"1979","unstructured":"M.H. Overmars and J. Van Leeuwen: \u201cRapid Subtree Identification Revisited\u201d Tech. Rep. CS-79-3, Univ. of Utrecht, Utrecht, The Netherlands (1979)."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"4","author":"R.G. Gallager","year":"1983","unstructured":"R.G. Gallager, P.A. Humblet and P.M. Spira: \u201cA Distributed Algorithm for Minimum-Weight Spanning Trees\u201d, ACM Transactions on Programming Languages and Systems, Vol. 4, No. 1, pp. 66\u201377 (January 1983).","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"R. Ramesh and I.V. Ramakrishnan: \u201cOptimal Speedups for Parallel Pattern Matching in Trees\u201d, Proceedings of 2nd Int'l Conf. on Rewriting Techniques and Applications (1987).","DOI":"10.1007\/3-540-17220-3_23"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019797","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T10:32:54Z","timestamp":1549276374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019797"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540193661","9783540392392"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0019797","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}