{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:27Z","timestamp":1725456207630},"publisher-location":"Berlin\/Heidelberg","reference-count":12,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012867","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:12:39Z","timestamp":1132726359000},"page":"694-703","source":"Crossref","is-referenced-by-count":2,"title":["Optimal time bounds for parallel term matching"],"prefix":"10.1007","author":[{"given":"Rakesh M.","family":"Verma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Paul Beame and John Hastad, Optimal bounds for decision problems on the CRCW PRAM, In Proceedings of the ACM Symposium on Theory of Computing, pages 83\u201393, 1987.","DOI":"10.1145\/28395.28405"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0213028","volume":"13","author":"A. K. Chandra","year":"1984","unstructured":"Ashok K. Chandra, L. Stockmeyer, and U. Vishkin, Constant depth reducibility, SIAM Journal of Computing, 13:423\u2013439 (1984).","journal-title":"SIAM Journal of Computing"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Richard Cole and Uzi Vishkin, Approximate and exact parallel scheduling with applications to list, tree and graph problems, In Proceedings of the IEEE Conference on Foundations of Computer Science, pages 478\u2013491, 1986.","DOI":"10.1109\/SFCS.1986.10"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"Stephen Cook and Cynthia Dwork, Bounds on the time for parallel RAM's to compute simple functions, In Proceedings of the ACM Symposium on Theory of Computing, pages 231\u2013233, 1982.","DOI":"10.1145\/800070.802196"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"1","author":"C. Dwork","year":"1984","unstructured":"C. Dwork, P. Kanellakis, and J.C. Mitchell, On the sequential nature of unification, Journal of Logic Programming, 1:35\u201350 (1984).","journal-title":"Journal of Logic Programming"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"C. Dwork, P. Kanellakis, and L. Stockmeyer, Parallel algorithms for term matching, In Eighth CADE, Springer-Verlag LNCS vol. 230, 1986.","DOI":"10.1007\/3-540-16780-3_109"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Steven Fortune and James Wyllie, Parallelism in random access machines, In Proceedings of the ACM Symposium on Theory of Computing, pages 114\u2013118, 1978.","DOI":"10.1145\/800133.804339"},{"key":"48_CR8","unstructured":"C.P. Kruskal, L. Rudolph, and M. Snir, Efficient parallel algorithms for graph problems, In Proceedings of International Conference on Parallel Processing, pages 180\u2013185, 1985."},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"R. Ramesh and I.V. Ramakrishnan, Optimal speedups for parallel pattern matching in trees, In Second RTA, Springer-Verlag LNCS vol. 256, 1987.","DOI":"10.1007\/3-540-17220-3_23"},{"key":"48_CR10","doi-asserted-by":"crossref","unstructured":"R. Ramesh, R.M. Verma, T. Krishanprasad, and I.V. Ramakrishnan, Term matching on parallel computers, In Fourteenth ICALP, Springer-Verlag LNCS vol. 267, 1987.","DOI":"10.1007\/3-540-18088-5_28"},{"key":"48_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the maximum, merging and sorting in a parallel computation model, Journal of Algorithms, 2:88\u2013102 (1981).","journal-title":"Journal of Algorithms"},{"key":"48_CR12","doi-asserted-by":"crossref","unstructured":"Rakesh M. Verma, T. Krishnaprasad, and I. V. Ramakrishnan, An efficient parallel algorithm for Term Matching, In Sixth FST-TCS, Springer-Verlag LNCS vol. 241, 1986.","DOI":"10.1007\/3-540-17179-7_31"}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0012867","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:23:43Z","timestamp":1586579023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012867"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0012867","relation":{},"subject":[]}}