Result 1 to 20 of 22 total
Fast management of permutation groups. I. (English)
SIAM J. Comput. 26, No.5, 1310-1342 (1997).
1
Fast Monte Carlo algorithms for permutation groups. (English)
J. Comput. Syst. Sci. 50, No.2, 296-308 (1995).
2
Graph isomorphism problem and $2$-closed permutation groups. (English)
Appl. Algebra Eng. Commun. Comput. 5, No.1, 9-22 (1994).
3
PERM: A program computing strong generating sets. (English)
Finkelstein, Larry (ed.) et al., Groups and computation. Papers from the workshop held at DIMACS, Rutgers University, New Brunswick, NJ (USA), October 7-10, 1991. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 11, 269-276 (1993).
4
On Holt’s algorithm. (English)
J. Symb. Comput. 15, No.2, 229-233 (1993).
5
Algorithms for permutation groups. (Chinese)
Adv. Math., Beijing 21, No.2, 140-152 (1992).
6
Minimum bases for permutation groups: The greedy approximation. (English)
J. Algorithms 13, No.2, 297-306 (1992).
7
Computational complexity in finite groups. (English)
Proc. Int. Congr. Math., Kyoto/Japan 1990, Vol. II, 1479-1489 (1991).
8
Permutation group algorithms based on partitions. I: Theory and algorithms. (English)
J. Symb. Comput. 12, No.4-5, 533-583 (1991).
9
A strong generating test and short presentations for permutation groups. (English)
J. Symb. Comput. 12, No.4-5, 475-497 (1991).
10
Fast recognition of doubly transitive groups. (English)
J. Symb. Comput. 12, No.4-5, 459-474 (1991).
11
Efficient representation of perm groups. (English)
Combinatorica 11, No.1, 33-43 (1991).
12
Fast group membership using a strong generating test for permutation groups. (English)
Computers and mathematics, Proc. Conf., Cambridge/Mass. 1989, 27-36 (1989).
13
A proof of Holt’s algorithm. (English)
J. Symb. Comput. 5, No.3, 275-283 (1988).
14
Coset representatives for permutation groups. (English)
Port. Math. 45, No.1, 61-68 (1988).
15
Data structures and algorithms for cyclically extended Schreier vectors. (English)
Numerical mathematics and computing, Proc. 15th Conf., Winnipeg/Manitoba 1985, Congr. Numerantium 52, 63-78 (1986).
16
An improvement to the centralizer algorithm for permutation groups. (English)
SIGSAM Bull. 19, No.2, 14-18 (1985).
17
On computing double coset representatives in permutation groups. (English)
Computational group theory, Proc. Symp., Durham/Engl. 1982, 283-290 (1984).
18
Computing normalizers in permutation groups. (English)
J. Algorithms 4, 163-175 (1983).
19
Finding the order of a permutation group. (English)
Finite groups, Santa Cruz Conf. 1979, Proc. Symp. Pure Math. 37, 511-517 (1980).
20
Result 1 to 20 of 22 total
Start
Contact
Print
General Help
