Edmund F. Robertson

According to our database, Edmund F. Robertson authored at least 11 papers between 1985 and 2007.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2007

On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers.

Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson

Exp. Math., 2007

2004

Nice Efficient Presentions for all Small Simple Groups and their Covers.

Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson

LMS J. Comput. Math., 2004

2003

Irreducible Cyclic Presentations of the Trivial Group.

George Havas, Edmund F. Robertson

Exp. Math., 2003

2002

Computing Transformation Semigroups.

Steve Linton, Götz Pfeiffer, Edmund F. Robertson, Nikola Ruskuc

J. Symb. Comput., 2002

2001

Automatic semigroups.

Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas

Theor. Comput. Sci., 2001

1996

On Subsemigroups and ideals in Free Products of Semigroups.

Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas

Int. J. Algebra Comput., 1996

1995

Rewriting a Semigroup Presentation.

Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas

Int. J. Algebra Comput., 1995

1992

Application of Computational Tools for Finitely Presented Groups.

George Havas, Edmund F. Robertson

Proceedings of the Computational Support for Discrete Mathematics, 1992

1991

A library of simple groups: permutations, presentations, cojugacy classes, maximal subgroups and Sylow subgroups.

A. R. Jamali, Edmund F. Robertson

SIGSAM Bull., 1991

1988

Tietze Transformations with Weighted Substring Search.

Edmund F. Robertson

J. Symb. Comput., 1988

1985

A Cayley File of Finite Simple Groups.

Colin M. Campbell, Edmund F. Robertson

Proceedings of the EUROCAL '85, 1985