Constructing permutation representations for matrix groups

Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures

Memory-based and disk-based algorithms for very high degree permutation groups

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Note: On the ranks of O'N and Ly

Discrete Applied Mathematics

A disk-based parallel implementation for direct condensation of large permutation modules

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

A comparative analysis of parallel disk-based Methods for enumerating implicit graphs

Proceedings of the 2007 international workshop on Parallel symbolic computation