### Workshop on Groups and Computation - II

#### June 7 - 10, 1995

June 7 - 9: Rutgers University, CoRE Building, Piscataway, NJ

June 10: Holiday Inn, South Plainfield, NJ

**Organizers:**
- Larry Finkelstein, Northeastern University, laf@ccs.neu.edu
- William M. Kantor, University of Oregon, kantor@bright.uoregon.edu
- Charles C. Sims, Rutgers University, sims@rutgers.math.edu

Computational group theory is an interdisciplinary field involving the use of
groups to solve problems in computer science and mathematics. The Workshop
will explore the interplay of research which has taken place in a number of
broad areas:
- Symbolic algebra which has led to the development of algorithms for
group--theoretic computation and large integrated software packages (such as
Cayley, Magma and GAP).
- Theoretical computer science} which has studied the complexity of
computation with groups.
- Group theory, which has provided new tools for understanding the
structure of groups, both finite and infinite.

Applications of group computation within mathematics or computer science,
which have dealt with such diverse subjects as simple groups, combinatorial
search, routing on interconnection networks of processors, the analysis of
data, and problems in geometry and topology.

The primary Workshop theme is to understand the algorithmic and mathematical
obstructions to efficient computations with groups. This will require an
assessment of algorithms that have had effective implementations and recently
developed algorithms that have improved worst--case asymptotic times. Many
algorithms of these two types depend heavily on structural properties of groups
(such as properties of simple groups in the finite case), both for motivation
and correctness proofs, while other algorithms have depended more on novel
data structures than on group theory.

Next: Program

Workshop Index

DIMACS Homepage

Contacting the Center

Document last modified on November 1, 1994