Publications on Computational Group Theory by Gene Cooperman
![[under construction]](at_work.gif)
This page is still under revision.
- o
- ``GCD of many integers'', G. Cooperman, S. Feisel,
J. von zur Gathen, and G. Havas,
Computing and Combinatorics, Lecture Notes in Computer
Science 1627 1999, pp. 310-317.
- o
- ``Elementary Algebra Revisited: Randomized Algorithms'', G. Cooperman
and G. Havas,
Proc. of DIMACS
Workshop on Randomization Methods in Algorithm Design 43,
DIMACS Series in
Discrete Mathematics and Theoretical Computer Science,
P. Pardalos, S. Rajasekaran, and J. Rolim (eds.),
AMS, Providence, RI, 1998, pp. 37-44
- o
- ``Practical Task-Oriented Parallelism for Gaussian Elimination
in Distributed Memory'', G. Cooperman,
Linear Algebra and its Applications 275-276,
1998, pp. 107-120
- o
- ``Constructing Permutation Representations for Matrix Groups'',
G. Cooperman, L. Finkelstein, M. Tselman and B. York,
J. of Symbolic Computation 24, 1997, pp. 471-488
- o
- ``Constructive Recognition of a
Black Box Group Isomorphic to GL(n,2)'',
G. Cooperman, L. Finkelstein and S. Linton, Proc. of DIMACS Workshop
on Groups and Computation II 28, DIMACS Series in Discrete
Mathematics and Theoretical Computer Science, AMS, Providence, RI, 1997,
pp. 85-101
- o
- ``New Sequential and Parallel Algorithms
for Generating High Dimension Hecke Algebras
using the Condensation Technique'', G. Cooperman and M. Tselman,
Proc. of International Symposium on Symbolic and Algebraic
Computation (ISSAC '96), ACM Press, 1996, pp. 155-160
- o
- ``Computing with Matrix Groups using Permutation Representations'',
G. Cooperman, L. Finkelstein and M. Tselman,
Proc. of International Symposium on Symbolic and Algebraic Computation
(ISSAC '95), ACM Press, 1995, pp. 259-264
- o
- ``Fast Monte Carlo Algorithms for Permutation Groups'', L. Babai,
G. Cooperman, L. Finkelstein, E. Luks, and Á. Seress,
J. of Computer and System Sciences 50(2), 1995, pp. 296-308
- o
- ``Permutation Routing via Cayley graphs with an Example for Bus
Interconnection Networks'', G. Cooperman and L. Finkelstein,
DIMACS Series in Discrete Mathematics and Theoretical Computer
Science 21, F. Hsu, A. Rosenberg and J. Sotteau (eds.), AMS,
Providence, RI., 1995, pp. 47-56
- o
- ``Constructing Permutation Representations for Large Matrix Groups'',
G. Cooperman, L. Finkelstein, B. York and M. Tselman,
Proc. of International Symposium on Symbolic and Algebraic Computation
(ISSAC '94), ACM Press, 1994, pp. 134-138
- o
- ``A Random Base Change Algorithm for Permutation Groups'', G. Cooperman
and L. Finkelstein, J. of Symbolic Computation 17, 1994,
pp. 513-528
- o
- ``Combinatorial Tools for Computational Group Theory'',
G. Cooperman and L. Finkelstein, Proceedings of DIMACS Workshop on Groups
and Computation, DIMACS-AMS 11, AMS Press, Providence, RI, 1993,
pp. 53-86
- o
- ``Group Membership for Groups with Primitive Orbits'', N. Sarawagi,
G. Cooperman and L. Finkelstein, Proceedings of DIMACS Workshop on Groups
and Computation, DIMACS-AMS 11, 1993, AMS, Providence, RI
- o
- ``Randomized Algorithms for Permutation Groups'', G. Cooperman
and L. Finkelstein, Centrum Wissenschaft Institut Quarterly
(CWI), Netherlands, June, 1992, pp. 107-125
- o
- ``New Methods for Using Cayley Graphs in Interconnection
Networks'', G. Cooperman and L. Finkelstein, Discrete Applied
Mathematics 37/38 (special issue on Interconnection Networks),
1992, pp. 95-118
- o
- ``A Fast Cyclic Base Change for Permutation Groups'', G.
Cooperman and L. Finkelstein, Proc. of International Symposium on
Symbolic and Algebraic Computation (ISSAC-92), ACM Press, 1992, pp. 224-232
- o
- ``Parallel Implementations of Group Membership and the Method
of Random Subproducts'', G. Cooperman, L. Finkelstein, and B. York,
Proc. of 1992 Dartmouth Institute for Advanced Graduate
Studies in Parallel Computation Symposium (DAGS'92), D. Johnson,
F. Makedon, and P. Metaxas (eds.), Department of
Mathematics and Computer Science, Dartmouth College, pp. 94-100,
June 17-20, 1992
- o
- ``A Strong Generating Test and Short
Presentations for Permutation Groups'',
G. Cooperman and L. Finkelstein, J. of Symbolic Computation
12 (1991), pp. 475-497
- o
- ``Nearly Linear Time Algorithms for Permutation Groups with a
Small Base'', L. Babai, G. Cooperman, L. Finkelstein, and Á. Seress,
Proc. of the 1991 International Symposium on Symbolic and
Algebraic Computation (ISSAC '91), Bonn, pp. 200-209, July, 1991
- o
- ``Fast Monte Carlo Algorithms for Permutation Groups'',
L. Babai, G. Cooperman, L. Finkelstein, E. Luks, and Á. Seress,
23rd ACM Symposium on Theory of Computer Science
(1991), pp. 90-100
- o
- ``Applications of Cayley Graphs'', G. Cooperman, L. Finkelstein
and N. Sarawagi, Applied Algebra, Algebraic
Algorithms and Error-Correcting Codes (AAECC-8) Springer-Verlag
Lecture Notes in Computer Science 508, S. Sakata (Ed.), 1990,
pp. 367-378
- o
- ``A Random Base Change Algorithm for Permutation Groups'',
G. Cooperman, L. Finkelstein and N. Sarawagi,
Proc. of 1990 International Symposium on Symbolic and Algebraic
Computation, Tokyo, Japan, ACM Press and Addison-Wesley, Aug., 1990,
pp. 161-168
- o
- ``Reduction of Group Constructions to Point Stabilizers'',
G. Cooperman, L. Finkelstein, and E. Luks,
Proc. of 1989 International Symposium on Symbolic and
Algebraic Computation, Portland, Oregon, July 17-19, pp. 351-356,
ACM Press, 1989
- o
- ``Fast Group Membership Using a Strong Generating Test for
Permutation Groups'',
G. Cooperman, L. Finkelstein, and P. Purdom,
Computers and Mathematics, (E. Kaltofen, and S.M. Watt, eds.)
Springer-Verlag, New York, 1989, pp. 27-36
- o
- ``Solving Permutation Problems Using Rewriting Systems'',
C. Brown, G. Cooperman, and L. Finkelstein,
Symbolic and Algebraic
Computation (Proc. of International Symposium ISSAC '88,
Rome, 1988), Springer Verlag Lecture Notes in Computer Science
358, pp. 364-377, 1989
Gene Cooperman
10/21/1999