|
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
|
|
11
|
Prime power graphs for groups of Lie type
– William M. Kantor, Ákos Seress
- 2002
|
|
11
|
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
|
|
6
|
Permutation Group Algorithms Via Black Box Recognition Algorithms
– William M. Kantor, Ákos Seress
|
|
35
|
A polynomial-time theory of black-box groups I
– László Babai, Robert Beals
- 1998
|
|
|
Small Base Groups, Large Base Groups and the Case of Giants
– Jonathan Cohen
|
|
12
|
Black-box 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
|
|
28
|
What Do We Know About The Product Replacement Algorithm?
– Igor Pak
- 2000
|
|
17
|
The Product Replacement Algorithm is Polynomial
– Igor Pak
- 2000
|
|
7
|
Deciding Finiteness for Matrix Groups over Function Fields
– Daniel N. Rockmore, Ki-Seng Tan, Robert Beals
- 1998
|
|
|
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
|
|
35
|
The Product Replacement Algorithm And Kazhdan's Property (T)
– Alexander Lubotzky, Igor Pak
- 1999
|
|
8
|
Expansion of Product Replacement Graphs
– Alexander Gamburd, Igor Pak
- 2001
|
|
2
|
A polynomial-time theory of matrix groups and black box groups
– László Babai, Robert Beals, Ákos Seress
|
|
6
|
Order computations in generic groups
– Andrew V. Sutherland
- 2007
|
|
27
|
A Recognition Algorithm for Classical Groups over Finite Fields
– Alice C. Niemeyer, Cheryl E. Praeger
- 1998
|
