Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821805169, 9781470439866

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Constructing permutation representations for matrix groups in parallel environments

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/20 ◽

1997 ◽

pp. 371-382

Author(s):

Michael Tselman

Keyword(s):

Matrix Groups

Download Full-text

Computing the fitting subgroup and solvable radical of small-base permutation groups in nearly linear time

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/12 ◽

1997 ◽

pp. 169-181 ◽

Cited By ~ 2

Author(s):

Eugene Luks ◽

Akos Seress

Keyword(s):

Linear Time ◽

Permutation Groups ◽

Fitting Subgroup ◽

Solvable Radical ◽

Small Base

Download Full-text

A polycyclic quotient algorithm

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/11 ◽

1997 ◽

pp. 159-167 ◽

Cited By ~ 1

Author(s):

Eddie Lo

Download Full-text

Algorithms for group actions applied to graph generation

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/09 ◽

1997 ◽

pp. 113-122 ◽

Cited By ~ 1

Author(s):

Thomas Gruner ◽

Reinhard Laue ◽

Markus Meringer

Keyword(s):

Group Actions ◽

Graph Generation

Download Full-text

GAP/MPI: Facilitating parallelism

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/06 ◽

1997 ◽

pp. 69-83 ◽

Cited By ~ 6

Author(s):

Gene Cooperman

Download Full-text

The complexity of McKay’s canonical labeling algorithm

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/14 ◽

1997 ◽

pp. 239-256 ◽

Cited By ~ 28

Author(s):

Takunari Miyazaki

Keyword(s):

Labeling Algorithm

Download Full-text

A non-constructive recognition algorithm for the special linear and other classical groups

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/05 ◽

1997 ◽

pp. 61-67 ◽

Cited By ~ 2

Author(s):

Frank Celler ◽

C Leedham-Green

Keyword(s):

Recognition Algorithm ◽

Classical Groups ◽

Special Linear

Download Full-text

Experimenting and computing with infinite groups

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/02 ◽

1997 ◽

pp. 19-30 ◽

Cited By ~ 2

Author(s):

Gilbert Baumslag ◽

Charles Miller

Keyword(s):

Infinite Groups

Download Full-text

Asymptotic results for simple groups and some applications

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/18 ◽

1997 ◽

pp. 309-327 ◽

Cited By ~ 3

Author(s):

Laszlc Pyber

Keyword(s):

Simple Groups ◽

Asymptotic Results

Download Full-text

On nearly linear time algorithms for Sylow subgroups of small-base permutation groups

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science ◽

10.1090/dimacs/028/15 ◽

1997 ◽

pp. 257-272

Author(s):

Prabhav Morje

Keyword(s):

Linear Time ◽

Permutation Groups ◽

Sylow Subgroups ◽

Small Base ◽

Linear Time Algorithms

Download Full-text

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Constructing permutation representations for matrix groups in parallel environments

Computing the fitting subgroup and solvable radical of small-base permutation groups in nearly linear time

A polycyclic quotient algorithm

Algorithms for group actions applied to graph generation

GAP/MPI: Facilitating parallelism

The complexity of McKay’s canonical labeling algorithm

A non-constructive recognition algorithm for the special linear and other classical groups

Experimenting and computing with infinite groups

Asymptotic results for simple groups and some applications

On nearly linear time algorithms for Sylow subgroups of small-base permutation groups

Groups and Computation II - DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Latest Publications