#### Filter Results:

- Full text PDF available (14)

#### Publication Year

1986

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

- 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)

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

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
- ISSAC
- 1992

Two new cyclic base change algorithms are presented for a permutation group G acting on n points. One is cleterministic and the other is randomized. When G is a small base permutation group both algorithms have worst case time complexities which are better than existing algorithms in their class. The deterministic algorithm requires O(rz log2 IGI + nlSl log… (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)

- 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, N. Sarawagi
- AAECC
- 1990

This paper demonstrates the power of the Cayley graph approach to solve specific applications, such as rearrangement problems and the design of interconnection networks for parallel CPU’s. Recent results of the authors for efficient use of Cayley graphs are used here in exploratory analysis to extend recent results of Babai et al. on a family of trivalent… (More)