#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1986

2007

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We introduce new Monte Carlo methods to speed up and greatly simplify the manipulation of permutation groups. The methods are of a combinatorial character and use elementary group theory only. We achieve a nearly optimal 0(n3 loge n) running time for membership testing, an improvement of two orders of magnitude compared to known elementary algorithms and… (More)

- Gene Cooperman, Larry Finkelstein, Michael Tselman, Bryant W. York
- J. Symb. Comput.
- 1997

(Received) New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the… (More)

- Gene Cooperman, Larry Finkelstein
- Groups And Computation
- 1991

A variety of elementary combinatorial techniques for permutation groups are reviewed. It is shown how to apply these techniques to yield faster and/or more space-eecient algorithms for problems including group membership, normal closure, center, base change and Cayley graphs. Emphasis is placed on randomized techniques and new data structures. The paper… (More)

This article summarizes a report presented on February 9-10, 2002 in Washington DC, to a group of 30 deans of colleges and schools of information technology (IT), who have been meeting semiannually under the sponsorship of the Computing Research Association (CRA). The rapid increase in IT academic units and programs represents a positive response by… (More)

- Cynthia A. Brown, Larry Finkelstein, Paul Walton Purdom
- AAECC
- 1988

- Gene Cooperman, Larry Finkelstein, N. Sarawagi
- ISSAC
- 1990

A new random base change algorithm is presented for a permutation group <italic>G</italic> acting on <italic>n</italic> points whose worst case asymptotic running time is better for groups with a small to moderate size base than any known deterministic algorithm. To achieve this time bound, the algorithm requires a random generator… (More)

- Gene Cooperman, Larry Finkelstein
- Discrete Applied Mathematics
- 1992

A number of researchers have proposed Cayley graphs and Schreier coset graphs as models for interconnection networks. New algorithms are presented for generating Cayley graphs in a more time-eecient manner than was previously possible. Alternatively, a second algorithm is provided for storing Cayley graphs in a space-eecient manner (log 2 (3) bits per… (More)

- László Babai, Gene Cooperman, Larry Finkelstein, Ákos Seress
- ISSAC
- 1991

A base of a permutation group G is a subset B of the permutation domain such that only the identity of G fixes B pointwise. The permutation representations of important classes of groups, including all finite simple groups other than the alternating groups, admit O(log n) size bases, where n is the size of the permutation domain. Groups with very small… (More)

- Gene Cooperman, Larry Finkelstein
- J. Symb. Comput.
- 1991

The group membership problem for permutation groups is perhaps the most important problem of computational group theory. Solution of this problem seems to depend intrinsically on constructing a strong generating set. Until now, recognizing if a set of generators is strong has been thought to be as hard as constructing a strong generating set from an… (More)

- Gene Cooperman, Larry Finkelstein, Eugene M. Luks
- ISSAC
- 1989

The construction of point stabilizer subgroups is a problem which has been studied intensively. [1, 4, 5, 10, 11, 12, 14] This work describes a general reduction of certain group constructions to the point stabilizer problem. Examples are given for the centralizer, the normal closure, and a restricted group intersection problem. For the normal closure… (More)