An introduction to Computational Group Theory

An introduction to Computational Group Theory (1997)

Cached

Download Links

by Ákos Seress

Venue:	NOTICES AMER. MATH. SOC
Citations:	13 - 1 self

BibTeX

@ARTICLE{Seress97anintroduction,
    author = {Ákos Seress},
    title = {An introduction to Computational Group Theory},
    journal = {NOTICES AMER. MATH. SOC},
    year = {1997},
    volume = {44},
    pages = {671--679}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

553	Factoring Polynomials with Rational Coefficients - Lenstra, Lovàsz - 1982
448	Simple Word Problems in Universal Algebra - Knuth, Bendix - 1970
328	Atlas of finite groups - Conway, Curtis, et al. - 1985
144	Nauty user's guide (version 1.5 - MCKAY - 1990
115	Isomorphism of graphs of bounded valence can be tested in polynomial time - Luks - 1982
91	On the maximal subgroups of the finite classical groups - Aschbacher - 1984
76	Local expansion of vertex-transitive graphs and random generation in finite groups - Babai - 1991
61	On the complexity of matrix group problems - Babai, Szemeredi - 1984
59	Generating random elements of a finite group - Celler, Leedham-Green, et al. - 1995
51	An Atlas of Brauer Characters - Jansen, Lux, et al. - 1995
51	An Introduction to Magma - Cannon, Playoust - 1993
41	Testing modules for irreducibility - Holt, Rees - 1994
32	The occurrence problem for direct products of groups, Dokl - Mihailova - 1958
31	Permutation groups and polynomial-time computation - Luks - 1991
30	Las Vegas algorithms for matrix groups - Babai, Beals - 1993
26	Computing in solvable matrix groups - Luks - 1992
24	Crystallographic groups of four-dimensional space - Brown, Bülow, et al. - 1978
24	Fast Fourier Transforms - Clausen, Baum - 1993
22	Sylow’s theorem in polynomial time - KANTOR - 1985
22	On an algorithm for finding a base and strong generating set for a group given by generating permutations - LEON - 1980
21	Combinatorial tools for computational group theory - Cooperman, Finkelstein - 1991
21	Permutation group algorithms based on partitions. I. Theory and algorithms - Leon - 1991
20	Deciding finiteness of matrix groups in deterministic polynomial time - Babai, Beals, et al. - 1993
20	Computing the composition factors of a permutation group in polynomial time, Combinatorica 7 - LUKS - 1987
19	A constructive recognition algorithm for the special linear group, in The atlas of finite groups: ten years on - Celler, Leedham-Green - 1995
18	Collection from the left and other strategies - Leedham-Green, Soicher - 1990
17	An elementary introduction to coset table methods in computational group theory - Neubüser - 1982
17	Coset enumeration strategies - Havas - 1991
17	Finite rational matrix groups - Plesken, Nebe - 1995
16	Konstruktion transitiver Permutationsgruppen. Dissertation. Verlag der Augustinus-Buchhandlung - Hulpke - 1996
15	A non-constructive recognition algorithm for the special linear and other classical groups - Celler, Leedham-Green - 1997
15	Some algorithms for computing with finite permutation groups - Neumann - 1986
13	Constructing permutation representations for matrix groups - Cooperman, Finkelstein, et al. - 1997
12	Computation with finitely presented groups, Cambridge University Press. This article was processed using the LaT E X macro package with LLNCS style - Sims - 1994
12	Fundamental Algorithms for Permutation Groups vol - Butler - 1991
12	Some remarks on the computation of complements and normalizers in soluble groups - Celler, Neubuser, et al.
12	Recognizing badly presented Z-modules - Havas, Holt, et al. - 1993
12	and Ákos Seress. Black box classical groups - Kantor
12	Recognising tensor products of matrix groups - Leedham-Green, O’Brien - 1997
11	Fuks and ' A. Seress, Fast management of permutation groups - Babai, M - 1988
11	to appear b): A graphics system for displaying finite quotients of finitely presented groups - HOLT, REES - 1991
10	A language for group theory - Cannon
10	The Brauer tree of the principal 19-block of the sporadic simple Thompson group - Cooperman, Hiss, et al. - 1997
10	Algorithms for finite soluble groups and the SOGOS system - NEUBÜSER, J, et al. - 1984
9	Ákos Seress. Fast Monte Carlo algorithms for permutation groups - Babai, Cooperman, et al. - 1991
9	Testing matrix groups for primitivity - Holt, Leedham-Green, et al. - 1996
9	Double coset enumeration - LINTON - 1991
9	Selecting base points for the SchreierSims algorithm for matrix groups - Murray, O’Brien - 1995
8	Computational aspects of representation theory of finite groups, Representation theory of finite groups and finite-dimensional algebras [Progress - LUX, PAHLINGS - 1991
8	and A Seress, Nearly linear time algorithms for permutation groups with a small base - Babai, Cooperman, et al.