{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T12:24:27Z","timestamp":1763036667712},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167808"},{"type":"electronic","value":"9783540398615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16780-3_109","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:59:50Z","timestamp":1330196390000},"page":"416-430","source":"Crossref","is-referenced-by-count":13,"title":["Parallel algorithms for term matching"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paris","family":"Kanellakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Larry","family":"Stockmeyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, A., Chazelle, B., Guibas, L., O'Dunlaing, C., and Yap, C., \"Parallel computational geometry\", Proc. 26th IEEE FOCS, 1985, pp. 468\u2013478.","DOI":"10.1109\/SFCS.1985.42"},{"key":"35_CR2","unstructured":"Clocksin, W.F., Mellish, C.S., Programming in Prolog, Springer-Verlag, 1981."},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0211038","volume":"11","author":"D. Coppersmith","year":"1982","unstructured":"Coppersmith, D., and Winograd, S., \"On the asymptotic complexity of matrix multiplication\", SIAM J. Comput. 11 (1982), pp. 472\u2013492.","journal-title":"SIAM J. Comput."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kanellakis, P., Mitchell, J., \"On the Sequential Nature of Unification\", J. of Logic Programming 1(1), pp.35\u201350.","DOI":"10.1016\/0743-1066(84)90022-0"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Fortune, S., Wyllie, J., \"Parallelism in Random Access Machines\", Proc. 10th ACM STOC, 1978, pp. 114\u2013118.","DOI":"10.1145\/800133.804339"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Galil, Z., \"Optimal parallel algorithms for string matching\", Proc. 16th ACM STOC, 1984, pp. 240\u2013248.","DOI":"10.1145\/800057.808687"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Galil, Z., and Pan., V., \"Improved processor bounds for algebraic and combinatorial problems in RNC\", Proc. 26th IEEE FOCS, 1985, pp. 490\u2013496.","DOI":"10.1109\/SFCS.1985.33"},{"issue":"2","key":"35_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"L.M. Goldschlager","year":"1977","unstructured":"Goldschlager, L.M., \"The Monotone and Planar Circuit Value Problems are Log Space Complete for P\", SIGACT News 9(2), 1977, pp. 25\u201329.","journal-title":"SIGACT News"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"G. Huet, D. Oppen, \"Equations and Rewrite Rules: A Survey\", in: Formal Language Theory: Perspectives and Open Problems, R.V. Book (ed), Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R. M., Upfal, E., and Wigderson, A., \"Constructing a perfect matching is in random NC\", Proc. 17th ACM STOC, 1985, pp. 22\u201332.","DOI":"10.1145\/22145.22148"},{"key":"35_CR11","first-page":"569","volume":"74","author":"R. Kowalski","year":"1974","unstructured":"Kowalski, R., \"Predicate Logic as a Programming Language\". Proceedings IFIP 74, 1974, pp. 569\u2013574.","journal-title":"Proceedings IFIP"},{"key":"35_CR12","unstructured":"Maluszynski J., Komorowski H.J., \"Unification-free Execution of Horn-clause Programs\", Proc. 2nd Logic Programming Symposium, IEEE, July 1985."},{"key":"35_CR13","first-page":"348","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R., \"A Theory of Type Polymorphism in Programming\", JCSS 17, 1978, pp. 348\u2013375.","journal-title":"JCSS"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Pan, V., and Reif, J., \"Efficient parallel solution of linear systems\", Proc. 17th ACM STOC, 1985, pp. 143\u2013152.","DOI":"10.1145\/22145.22161"},{"key":"35_CR15","first-page":"158","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"Paterson, M.S., Wegman, M.N., \"Linear Unification\", JCSS 16, 1978, pp.158\u2013167.","journal-title":"JCSS"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O., \"Probabilistic algorithm for testing primality\", J. Number Theory 12 (1980), pp. 128\u2013138.","journal-title":"J. Number Theory"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Reif, J., \"Optimal parallel algorithms for integer sorting and graph connectivity\", Proc. 26th IEEE FOCS, 1985, pp.496\u2013505.","DOI":"10.1109\/SFCS.1985.9"},{"issue":"1","key":"35_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A., \"A Machine Oriented Logic Based on the Resolution Principle\", JACM 12(1), 1965, pp. 23\u201341.","journal-title":"JACM"},{"issue":"4","key":"35_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J.T. Schwartz","year":"1980","unstructured":"Schwartz, J.T., \"Fast Probabilistic Algorithms for Verification of Polynomial Identities\", JACM 27(4), 1980, pp. 701\u2013717.","journal-title":"JACM"},{"key":"35_CR20","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V., \"Gaussian elimination is not optimal\", Numerische Mathematik 13 (1969), pp. 354\u2013356.","journal-title":"Numerische Mathematik"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E., and Vishkin, U., \"Finding biconnected components and computing tree functions in logarithmic parallel time\", Proc. 25th IEEE FOCS, 1984, pp. 12\u201320.","DOI":"10.1109\/SFCS.1984.715896"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Vishkin, U., \"Randomized speed-ups in parallel computation\", Proc. 16th ACM STOC, 1984, pp. 230\u2013239.","DOI":"10.1145\/800057.808686"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Vitter, J.S., and Simons, R., \"New classes for parallel complexity: a study of unification and other complete problems for P\", IEEE Trans. on Computers, to appear.","DOI":"10.1109\/TC.1986.1676783"},{"key":"35_CR24","unstructured":"Yasuura, H., \"On the Parallel Computational Complexity of Unification\", Yajima Lab., Research Report, ER 83-01, Oct. 1983."}],"container-title":["Lecture Notes in Computer Science","8th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16780-3_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:28Z","timestamp":1605643888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16780-3_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167808","9783540398615"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-16780-3_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}