8

On sampling generating sets of finite groups and product replacement algorithm. (Extended Abstract)
– Igor Pak, Sergey Bratus
 1999

4

Computing with Matrix Groups
– William M. Kantor, Ákos Seress
 2001

10

Prime power graphs for groups of Lie type
– William M. Kantor, Ákos Seress
 2002

12

Simple Groups in Computational Group Theory
– William M. Kantor
 1998

4

Constructive recognition of a black box group isomorphic to GL(n, 2
– Gene Cooperman, Larry Finkelstein, Steve Linton, Abstract A Monte Carlo
 1997

27

Black box classical groups
– William M. Kantor, Ákos Seress

6

Permutation group algorithms via black box recognition algorithms
– William M. Kantor, Akos Seress
 1999

40

A polynomialtime theory of blackbox groups I
– László Babai, Robert Beals
 1998


Small Base Groups, Large Base Groups and the Case of Giants
– Jonathan Cohen

13

Blackbox recognition of finite simple groups of Lie type by statistics of element orders
– László Babai, William M. Kantor, Péter P. Pálfy, Ákos Seress
 2002

21

The Product Replacement Algorithm is Polynomial
– Igor Pak
 2000

30

What Do We Know About The Product Replacement Algorithm?
– Igor Pak
 2000

8

Deciding Finiteness for Matrix Groups over Function Fields
– Daniel N. Rockmore, KiSeng Tan, Robert Beals
 1998


A computerassisted analysis of some matrix groups
– Derek F. Holt, et al.

1

Computing a chief series and the soluble radical of a matrix group over a finite field
– Derek F. Holt, Mark J. Stather
 2008

13

An introduction to Computational Group Theory
– Ákos Seress
 1997

36

The product replacement algorithm and Kazhdan’s property
– Alexander Lubotzky, Igor Pak

9

Expansion of Product Replacement Graphs
– Alexander Gamburd, Igor Pak
 2001

2

A polynomialtime theory of matrix groups and black box groups
– László Babai, Robert Beals, Ákos Seress
