{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:48:07Z","timestamp":1770994087966,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0022-0000(91)90012-t","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"237-248","source":"Crossref","is-referenced-by-count":13,"title":["On isomorphism testing of a class of 2-Nilpotent groups"],"prefix":"10.1016","volume":"42","author":[{"given":"Max","family":"Garzon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yechezkel","family":"Zalcstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(91)90012-T_BIB1","first-page":"136","article-title":"Su di un problema combinatorio in teoria dei gruppi","volume":"74","author":"Curzio","year":"1983","journal-title":"Atti Lincei VIII"},{"key":"10.1016\/0022-0000(91)90012-T_BIB2","series-title":"27th FOCS","first-page":"313","article-title":"Complexity of isomorphism testing","author":"Garzon","year":"1986"},{"key":"10.1016\/0022-0000(91)90012-T_BIB3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02573115","article-title":"On permutation properties in groups and semigroups","volume":"35","author":"Garzon","year":"1987","journal-title":"Semigroup Forum"},{"key":"10.1016\/0022-0000(91)90012-T_BIB4","article-title":"The complexity of Grigorchuk groups with application to cryptography","volume":"91","author":"Garzon","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(91)90012-T_BIB5","series-title":"Algebra","author":"Hungerford","year":"1980"},{"key":"10.1016\/0022-0000(91)90012-T_BIB6","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1007\/BF01238631","article-title":"The occurrence of finite groups in the automorphism group of nilpotent groups of class 2","volume":"25","author":"Heineken","year":"1974","journal-title":"Arch. Math."},{"key":"10.1016\/0022-0000(91)90012-T_BIB7","series-title":"Endliche Gruppen, I","author":"Huppert","year":"1967"},{"issue":"No. 4","key":"10.1016\/0022-0000(91)90012-T_BIB8","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","article-title":"Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix","volume":"8","author":"Kannan","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90012-T_BIB9","series-title":"Proceedings, Conf. on Inform. Sci. and Systems","first-page":"33","article-title":"Complexity of the word and isomorphism problems for finite groups","author":"Lipton","year":"1976"},{"key":"10.1016\/0022-0000(91)90012-T_BIB10","series-title":"Combinatorial Group Theory","author":"Lyndon","year":"1977"},{"key":"10.1016\/0022-0000(91)90012-T_BIB11","series-title":"Combinatorial Group Theory","author":"Magnus","year":"1965"},{"key":"10.1016\/0022-0000(91)90012-T_BIB12","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/0021-8693(84)90237-0","article-title":"On the Burnside Problem for semigroups","volume":"89","author":"Restivo","year":"1984","journal-title":"J. Algebra"},{"issue":"No. 1","key":"10.1016\/0022-0000(91)90012-T_BIB13","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(85)90156-2","article-title":"Rational languages and the Burnside Problem","volume":"40","author":"Restivo","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(91)90012-T_BIB14","series-title":"A Course in the Theory of Groups","author":"Robinson","year":"1982"},{"key":"10.1016\/0022-0000(91)90012-T_BIB15","unstructured":"R. E. TARJAN, unpublished."},{"key":"10.1016\/0022-0000(91)90012-T_BIB16","first-page":"432","article-title":"On Polynomial Reducibility of Word Problems under Embedding of Recursively Presented Groups in Finitely Presented Groups","author":"Valiev","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190012T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190012T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:56:08Z","timestamp":1550325368000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009190012T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["002200009190012T"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90012-t","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}