{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:51:52Z","timestamp":1776761512442,"version":"3.51.2"},"reference-count":13,"publisher":"Elsevier BV","issue":"4-5","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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":7960,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/s0747-7171(08)80097-1","type":"journal-article","created":{"date-parts":[[2008,6,25]],"date-time":"2008-06-25T09:59:32Z","timestamp":1214387972000},"page":"443-457","source":"Crossref","is-referenced-by-count":2,"title":["Computing sylow subgroups of permutation groups using homomorphic images of centralizers"],"prefix":"10.1016","volume":"12","author":[{"given":"Gregory","family":"Butler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Cannon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(08)80097-1_bib1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0747-7171(85)80011-0","article-title":"ESective computation with group homomorphisms","volume":"1","author":"Butler","year":"1985","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(08)80097-1_bib2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0747-7171(89)80068-9","article-title":"Computing in permutation and matrix groups III: Sylow subgroups","volume":"8","author":"Butler","year":"1989","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(08)80097-1_bib3","first-page":"161","article-title":"Computing local structure of large finite groups","volume":"Vol. 4","author":"Cannon","year":"1971"},{"key":"10.1016\/S0747-7171(08)80097-1_bib4","series-title":"Computational Group Theory","first-page":"145","article-title":"An introduction to the group theory language Cayley","author":"Cannon","year":"1984"},{"key":"10.1016\/S0747-7171(08)80097-1_bib5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/S0747-7171(88)80030-0","article-title":"Constructing normalisera in finite soluble groups","volume":"5","author":"Glasby","year":"1988","journal-title":"J, Symbolic Computation"},{"key":"10.1016\/S0747-7171(08)80097-1_bib6","series-title":"The Theory of Groups","author":"Hall","year":"1959"},{"key":"10.1016\/S0747-7171(08)80097-1_bib7","series-title":"Computational Group Theory","first-page":"307","article-title":"A computer program for the calculation of the Schur multiplier of a permutation group","author":"Holt","year":"1984"},{"key":"10.1016\/S0747-7171(08)80097-1_bib8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0022-4049(85)90046-5","article-title":"A computer program for the calculation of a covering group of a finite group","volume":"35","author":"Holt","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/S0747-7171(08)80097-1_bib9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0747-7171(85)80020-1","article-title":"The mechanical computation of first and second cohomology groups","volume":"1","author":"Holt","year":"1985","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(08)80097-1_bib10","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/0196-6774(85)90029-X","article-title":"Polynomial-time algorithms for finding elements of prime order and Sylow subgroups","volume":"6","author":"Kantor","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0747-7171(08)80097-1_bib11","series-title":"Computational Group Theory","first-page":"105","article-title":"Algorithms for finite soluble groups and the SOGOS system","author":"Laue","year":"1984"},{"key":"10.1016\/S0747-7171(08)80097-1_bib12","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0747-7171(08)80083-1","article-title":"Computing the order of a solvable permutation group","volume":"9","author":"Sims","year":"1990","journal-title":"J. Symbolic Computation"},{"key":"10.1016\/S0747-7171(08)80097-1_bib13","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800971?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717108800971?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T16:57:27Z","timestamp":1545929847000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717108800971"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":13,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["S0747717108800971"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(08)80097-1","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}