{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T08:51:53Z","timestamp":1776761513740,"version":"3.51.2"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":10273,"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":[[1985,6]]},"DOI":"10.1016\/s0747-7171(85)80011-0","type":"journal-article","created":{"date-parts":[[2008,3,29]],"date-time":"2008-03-29T10:14:04Z","timestamp":1206785644000},"page":"143-157","source":"Crossref","is-referenced-by-count":5,"title":["Effective computation with group homomorphisms"],"prefix":"10.1016","volume":"1","author":[{"given":"Gregory","family":"Butler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(85)80011-0_bib1","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1090\/S0025-5718-1975-0367030-3","article-title":"An algorithm for finding the blocks of a permutation group","volume":"29","author":"Atkinson","year":"1975","journal-title":"Math. Comp"},{"key":"10.1016\/S0747-7171(85)80011-0_bib2","first-page":"167","article-title":"The Schreier algorithm for matrix groups","volume":"76","author":"Butler","year":"1976"},{"key":"10.1016\/S0747-7171(85)80011-0_bib3","series-title":"Computational Approaches to Certain Problems in the Theory of Finite Groups","author":"Butler","year":"1979"},{"key":"10.1016\/S0747-7171(85)80011-0_bib4","first-page":"671","article-title":"Computing with permutation and matrix groups II: backtrack algorithm","volume":"39","author":"Butler","year":"1982","journal-title":"Math. Comp"},{"key":"10.1016\/S0747-7171(85)80011-0_bib5","series-title":"Computing with permutation and matrix groups III: Sylow subgroups (in prep.)","author":"Butler","year":"1979"},{"key":"10.1016\/S0747-7171(85)80011-0_bib6","first-page":"663","article-title":"Computing with permutation and matrix groups I: normal closure, commutator subgroup, series","volume":"39","author":"Butler","year":"1982","journal-title":"Math. Comp."},{"key":"10.1016\/S0747-7171(85)80011-0_bib7","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(73)90104-0","article-title":"Construction of defining relators for finite groups","volume":"5","author":"Cannon","year":"1973","journal-title":"Discrete Math"},{"key":"10.1016\/S0747-7171(85)80011-0_bib8","series-title":"Computational Group Theory . (Proceedings of the LMS Symposium on Computational Group Theory, Durham, July 30-August 9, 1982)","first-page":"145","article-title":"An introduction to the group theory language Cayley","author":"Cannon","year":"1984"},{"key":"10.1016\/S0747-7171(85)80011-0_bib9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1090\/S0025-5718-1973-0335610-5","article-title":"Implementation and analysis of the Todd-Coxeter algorithm","volume":"27","author":"Cannon","year":"1973","journal-title":"Math. Comp"},{"key":"10.1016\/S0747-7171(85)80011-0_bib10","first-page":"941","article-title":"On an algorithm for finding a base and strong generating set for a group given by generating permutations","volume":"35","author":"Leon","year":"1980","journal-title":"Math. Canip."},{"key":"10.1016\/S0747-7171(85)80011-0_bib11","series-title":"The Theory of Groups","author":"MacDonald","year":"1968"},{"key":"10.1016\/S0747-7171(85)80011-0_bib12","first-page":"1","article-title":"An elementary introduction to coset table methods in computational group theory","volume":"71","author":"Neubiiser","year":"1982"},{"key":"10.1016\/S0747-7171(85)80011-0_bib13","series-title":"GROUP; A Computer System for Group-theoretical Calculations","author":"Richardson","year":"1973"},{"key":"10.1016\/S0747-7171(85)80011-0_bib14","series-title":"Sine Methode zur Berechnung der Automorphismengruppe einer endliche Gruppe","author":"Robertz","year":"1976"},{"key":"10.1016\/S0747-7171(85)80011-0_bib15","first-page":"191","article-title":"Determining the conjugacy classes of a permutation group","volume":"4","author":"Sims","year":"1971","journal-title":"SIAM-AMS Proceedings"},{"key":"10.1016\/S0747-7171(85)80011-0_bib16","series-title":"Proc . Second Symp. on Symbolic and Algebraic Manipulation","first-page":"23","article-title":"Computation with permutation groups","author":"Sims","year":"1971"},{"key":"10.1016\/S0747-7171(85)80011-0_bib17","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:S0747717185800110?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717185800110?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T12:54:16Z","timestamp":1546174456000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717185800110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["S0747717185800110"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(85)80011-0","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}