{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T09:48:36Z","timestamp":1672480116505},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8294,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1016\/0166-218x(90)90081-m","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"35-62","source":"Crossref","is-referenced-by-count":10,"title":["Subtree isomorphism is in random NC"],"prefix":"10.1016","volume":"29","author":[{"given":"Phillip B.","family":"Gibbons","sequence":"first","affiliation":[]},{"given":"Richard M.","family":"Karp","sequence":"additional","affiliation":[]},{"given":"Gary L.","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Soroker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90081-M_BIB1","first-page":"65","article-title":"Fast parallel matrix and GCD computations","author":"Borodin","year":"1982","journal-title":"Proceedings of the Symposium on Foundations of Computer Science (FOCS)"},{"key":"10.1016\/0166-218X(90)90081-M_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90081-M_BIB3","unstructured":"D. Coppersmith, personal communication, 1988."},{"key":"10.1016\/0166-218X(90)90081-M_BIB4","first-page":"1","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","year":"1987","journal-title":"Proceedings of the Symposium on Theory of Computing (STOC)"},{"key":"10.1016\/0166-218X(90)90081-M_BIB5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.6028\/jres.071B.033","article-title":"Systems of distinct representatives and linear algebra","volume":"71","author":"Edmonds","year":"1967","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0166-218X(90)90081-M_BIB6","series-title":"Proceedings of the Symposium on Foundations of Computer Science (FOCS)","first-page":"490","article-title":"Improved processor bounds for algebraic and combinatorial problems in RNC","author":"Galil","year":"1985"},{"key":"10.1016\/0166-218X(90)90081-M_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90081-M_BIB8","first-page":"43","article-title":"Subtree isomorphism is in random NC","volume":"319","author":"Gibbons","year":"1988"},{"key":"10.1016\/0166-218X(90)90081-M_BIB9","series-title":"Tech. Rept. TR-89-014","article-title":"Subtree isomorphism is in random NC","author":"Gibbons","year":"1989"},{"key":"10.1016\/0166-218X(90)90081-M_BIB10","doi-asserted-by":"crossref","unstructured":"P.B. Gibbons, G.L. Miller and S.-H. Teng, personal communication,1988.","DOI":"10.1378\/chest.94.2.407"},{"key":"10.1016\/0166-218X(90)90081-M_BIB11","series-title":"Tech. Rept. UCB-CSD-88-408","article-title":"A survey of parallel algorithms for shared-memory machines","author":"Karp","year":"1988"},{"issue":"1","key":"10.1016\/0166-218X(90)90081-M_BIB12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a perfect matching is in random NC","volume":"6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(90)90081-M_BIB13","unstructured":"M. Karpinski and A. Lingas, Subtree isomorphism and bipartite perfect matching are mutually NC reducible, Submitted."},{"issue":"4","key":"10.1016\/0166-218X(90)90081-M_BIB14","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90081-M_BIB15","first-page":"91","article-title":"Subtree isomorphism in O(n52)","volume":"2","author":"Matula","year":"1978"},{"key":"10.1016\/0166-218X(90)90081-M_BIB16","first-page":"478","article-title":"Parallel tree contraction and its applications","author":"Miller","year":"1985","journal-title":"Proceedings of the Symposium on Foundations of Computer Science (FOCS)"},{"issue":"1","key":"10.1016\/0166-218X(90)90081-M_BIB17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","article-title":"Matching is as easy as matrix inversion","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(90)90081-M_BIB18","first-page":"504","article-title":"Fast and efficient parallel algorithms for the exact inversion of integer matrices","volume":"206","author":"Pan","year":"1985"},{"key":"10.1016\/0166-218X(90)90081-M_BIB19","first-page":"307","article-title":"On simultaneous resource bounds","author":"Pippenger","year":"1979","journal-title":"Proceedings of the Symposium on Foundations of Computer Science (FOCS)"},{"issue":"3","key":"10.1016\/0166-218X(90)90081-M_BIB20","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0020-0190(78)90079-0","article-title":"An improved parallel processor bound in fast matrix inversion","volume":"7","author":"Preparata","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90081-M_BIB21","series-title":"Tech. Rept. TR-15-84","article-title":"Maximum matchings in general graphs through randomization","author":"Rabin","year":"1984"},{"key":"10.1016\/0166-218X(90)90081-M_BIB22","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/322217.322225","article-title":"Fast probabilistic algorithms for verification of polynomial identities","volume":"27","author":"Schwartz","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(90)90081-M_BIB23","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/0213027","article-title":"Simulation of parallel random access machines by circuits","volume":"13","author":"Stockmeyer","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90081-M_BIB24","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090081M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090081M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:45Z","timestamp":1554967425000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090081M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0166218X9090081M"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90081-m","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}