{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T11:09:40Z","timestamp":1777460980720,"version":"3.51.4"},"reference-count":8,"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":["Information and Computation"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0890-5401(91)90064-9","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"172-176","source":"Crossref","is-referenced-by-count":4,"title":["Computing the order of centralizers in linear groups"],"prefix":"10.1016","volume":"91","author":[{"given":"Lajos","family":"R\u00f3nyai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90064-9_BIB1","series-title":"Proceedings, 17the ACM Symp. on Theory of Computing","first-page":"421","article-title":"Trading group theory for randomness","author":"Babai","year":"1985"},{"key":"10.1016\/0890-5401(91)90064-9_BIB2","article-title":"Interactive proofs in finite groups","author":"Babai","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0890-5401(91)90064-9_BIB3","series-title":"Proceedings, 17th ACM Symp. on Theory of Computing","first-page":"153","article-title":"Polynomial time solutions of some problems in computational algebra","author":"Friedl","year":"1985"},{"key":"10.1016\/0890-5401(91)90064-9_BIB4","author":"Herstein","year":"1968"},{"key":"10.1016\/0890-5401(91)90064-9_BIB5","volume":"Vol. 88","author":"Pierce","year":"1982"},{"key":"10.1016\/0890-5401(91)90064-9_BIB6","series-title":"Proceedings, 19th ACM Symp. on Theory of Computing","first-page":"398","article-title":"Simple algebras are difficult","author":"R\u00f3nyai","year":"1987"},{"key":"10.1016\/0890-5401(91)90064-9_BIB7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0747-7171(08)80017-X","article-title":"Computing the structure of finite algebras","volume":"9","author":"R\u00f3nyai","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0890-5401(91)90064-9_BIB8","volume":"Vol. 247","author":"Suzuki","year":"1982"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900649?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540191900649?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:43Z","timestamp":1548897943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540191900649"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["0890540191900649"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90064-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}