Bibliography

  • [CS]
    Preprint

    On the computation of normal subgroups in permutation groups

    J.J. Cannon, B. Souvignier

    International Journal of Algebra and Computation(to appear)
  • [Ung]
    Preprint

    Computing chief series of a large permutation group

    W.R. Unger

    In preparation

  • [Ric73]
    Master's Thesis

    Group: a computer system for group-theoretic calculations

    J.S. Richardson

    Department of Pure Mathematics, University of Sydney1973
  • [Atk75]
    Article

    An algorithm for finding the blocks of a permutation group

    M.D. Atkinson

    Math. Comp.Vol. 29pp. 911–9131975
  • [Leo80]
    Article

    On an algorithm for finding a base and a strong generating set for a group given by generating permutations

    Jeffrey S. Leon

    Math. Comp.Vol. 35(151)pp. 941–9741980
  • [McK81]
    Article

    Practical Graph Isomorphism

    B. D. McKay

    Congressus NumerantiumVol. 30pp. 45–871981
  • [BC82]
    Article

    Computing with permutation and matrix groups I: Normal closure, commutator subgroups, series

    G. Butler, J.J. Cannon

    Math. Comp.Vol. 39pp. 671–6801982
  • [Hol84]
    Conference

    The calculation of the Schur multiplier of a permutation group

    D.F. Holt

    In Computational group theory (Durham, 1982)pp. 307–3191984
  • [But85]
    Article

    Effective computation with group homomorphisms

    G. Butler

    J. Symbolic Comp.Vol. 1pp. 143–1571985
  • [Hol85a]
    Article

    A computer program for the calculation of a covering group of a finite group

    D.F. Holt

    J. Pure Appl. AlgebraVol. 35(3)pp. 287–2951985
  • [Hol85b]
    Article

    The mechanical computation of first and second cohomology groups

    D.F. Holt

    J. Symbolic Comp.Vol. 1(4)pp. 351–3611985
  • [Neu86]
    Conference

    Some algorithms for computing with finite permutation groups

    P.M. Neumann

    In Groups - St. Andrews 19851986
  • [CFL89]
    Conference

    Reduction of group constructions to point stabilizers

    G. Cooperman, L. Finkelstein, E. Luks

    In Proc. of International Symposium on Symbolic and Algebraic Computation ISSAC '89pp. 351–3561989
  • [MN89]
    Article

    Some remarks on the computation of conjugacy classes of soluble groups

    M. Mecky, J. Neubüser

    Bull. Austral, Math. Soc.Vol. 40(2)pp. 281–2921989
  • [Sch90a]
    Article

    Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen.

    B. Schmalz

    Bayreuther Mathematische Schriften Vol. 31pp. 109–1431990
  • [Sim90]
    Article

    Computing the order of a solvable permutation group

    C. C. Sims

    J. Symb. Comp.Vol. 9(5/6)pp. 699–7051990
  • [CC91]
    Article

    Recognizing doubly transitive groups

    P.J. Cameron, J.J. Cannon

    J. Symb. Comp.Vol. 12(4/5)pp. 459–4741991
  • [Kan91]
    Article

    Finding composition factors of permutation groups of degree $nłeq 106$

    W. M. Kantor

    J. Symbolic Comp.Vol. 12(4/5)pp. 517–5261991
  • [LGPS91]
    Article

    Computing with group homomorphisms

    C.R. Leedham-Green, C.E. Praeger, L.H. Soicher

    J. Symbolic Comp.Vol. 12(4/5)pp. 527–5321991
  • [CB92]
    Article

    Structural computation in finite permutation groups

    J.J. Cannon, W. Bosma

    CWI QuarterlyVol. 5(2)pp. 127–1601992
  • [Bea93]
    PhD Thesis

    Algorithms for finite groups

    G. Beals

    University of Chicago1993
  • [Luk93]
    Conference

    Permutation groups and polynomial-time computation

    E. Luks

    In Groups and computation (New Brunswick, NJ, 1991)Vol. 11pp. 139–1751993
  • [But94]
    Article

    An inductive schema for computing conjugacy classes in permutation groups

    Greg Butler

    Mathematics of ComputationVol. 62(205)pp. 363–3831994
  • [SS94]
    Conference

    Finding blocks of imprimitivity in small-base groups in nearly linear time

    M. Schönert, A. Seress

    In Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp.pp. 154–1571994
  • [CLGM+95]
    Article

    Generating random elements of a finite group

    F. Celler, C. R. Leedham-Green, S. H. Murray, A. C. Niemeyer, E. A. O'Brien

    Comm. AlgebraVol. 23(13)pp. 4931–49481995
  • [CCH97]
    Article

    Computing Sylow subgroups in permutation groups

    J.J. Cannon, B. Cox, D.F. Holt

    J. Symb. Comp.Vol. 24(3/4)pp. 303–3161997
  • [CH97]
    Article

    Computing chief series, composition series and socles in large permutation groups

    J.J. Cannon, D.F. Holt

    J. Symb. Comp.Vol. 24(3/4)pp. 285–3011997
  • [CS97]
    Conference

    On the computation of conjugacy classes in permutation groups

    J.J. Cannon, B. Souvignier

    In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computationpp. 392–3991997

    Maui, July 21--23, 1997

  • [Leo97]
    Conference

    Partitions, refinements, and permutation group computation

    Jeffrey S. Leon

    In Groups and Computation IIVol. 28pp. 123–1581997
  • [Min98]
    Article

    An algorithm for solving the factorization problem in permutation groups

    DOIMR

    T. Minkwitz

    J. Symbolic Comput.Vol. 26(1)pp. 89–951998
  • [BP00]
    Article

    Fast constructive recognition of a black box group isomorphic to $S_n$ or $A_n$ using Goldbach's conjecture

    Sergey Bratus, Igor Pak

    J. Symbolic Comp.Vol. 29pp. 33–572000
  • [Geb00]
    Article

    Constructing a short defining set of relations for a finite group

    V. Gebhardt

    J. AlgebraVol. 233pp. 526–5422000
  • [CCH01b]
    Article

    Computing the subgroups of a permutation group

    J.J. Cannon, B. Cox, D.F. Holt

    J. Symb. Comp.Vol. 31pp. 149–1612001
  • [BLGN+03b]
    Article

    A black-box algorithm for recognising finite symmetric and alternating groups, I

    R. Beals, C. R. Leedham-Green, A. C. Niemeyer, C. E. Praeger, A. Seress

    Trans. Amer. Math. Soc.pp. 2097–21132003
  • [CH03]
    Article

    Automorphism group computation and isomorphism testing in finite groups

    J.J. Cannon, D.F. Holt

    J. Symbolic Comp.Vol. 35(3)pp. 241–2672003
  • [CHSS03]
    Preprint

    Computing subgroups of low index in a finite group

    J.J. Cannon, D.F. Holt, M. Slattery, A.K. Steel

    2003
  • [HL03]
    Conference

    Total ordering on subgroups and cosets

    DOIMR

    A. Hulpke, S. Linton

    In Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computationpp. 156–1602003
  • [Ser03]
    Book

    Permutation Group Algorithms

    DOIMR

    . Seress

    Cambridge University PressVol. 152pp. x+2642003
  • [CH04]
    Article

    Computing maximal subgroups of finite groups

    J.J. Cannon, D.F. Holt

    J. Symbolic Comp.Vol. 37(5)pp. 589–6092004
  • [LNPS06]
    Article

    A reduction algorithm for for large-base primitive permutation groups

    M. Law, A. Niemeyer, C. Praeger, A. Seress

    LMS J. Comput. Math.Vol. 9pp. 159–1732006
  • [Ung06a]
    Article

    Computing the character table of a finite group

    W.R. Unger

    J. Symbolic Comp.Vol. 41(8)pp. 847–8622006
  • [Ung06b]
    Article

    Computing the solvable radical of a permutation group

    W.R. Unger

    J. AlgebraVol. 300(1)pp. 305–3152006
  • [JLNP13]
    Article

    Fast recognition of alternating groups of unknown degree

    S. Jambor, M. Leuner, A. C. Niemeyer, W. Plesken

    J. AlgebraVol. 392pp. 315–3352013