The workshop was set up in order to stimulate the interaction between (finite and algebraic) geometries and groups. Five areas of concentrated research were chosen on which attention would be focused, namely: diagram geometries and chamber systems with transitive automorphism groups, geometries viewed as incidence systems, properties of finite groups of Lie type, geometries related to finite simple groups, and algebraic groups. The list of talks (cf. page iii) illustrates how these subjects were represented during the workshop. The contributions to these proceedings mainly belong to the first...

If a black box simple group is known to be isomorphic to a classical group over a field of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. The proof relies on the geometry of the classical groups rather than on difficult group-theoretic background. This algorithm has applications to matrix group questions and to nearly linear time algorithms for permutation groups. In particular, we upgrade all known nearly linear time Monte Carlo permutation group algorithms to nearly linear Las Vegas algorithms when the input group has no composition factor isomorphic...