Edmund F. Robertson

11 papers Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2007 J jnl
On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers.
Exp. Math.
Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson
2004 J jnl
Nice Efficient Presentions for all Small Simple Groups and their Covers.
LMS J. Comput. Math.
Colin M. Campbell, George Havas, Colin Ramsay, Edmund F. Robertson
2003 J jnl
Irreducible Cyclic Presentations of the Trivial Group.
Exp. Math.
George Havas, Edmund F. Robertson
2002 J jnl
Computing Transformation Semigroups.
J. Symb. Comput.
Steve Linton, Götz Pfeiffer, Edmund F. Robertson, Nikola Ruskuc
2001 J jnl
Automatic semigroups.
Theor. Comput. Sci.
Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
1996 J jnl
On Subsemigroups and ideals in Free Products of Semigroups.
Int. J. Algebra Comput.
Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
1995 J jnl
Rewriting a Semigroup Presentation.
Int. J. Algebra Comput.
Colin M. Campbell, Edmund F. Robertson, Nikola Ruskuc, Richard M. Thomas
1992 — conf
Application of Computational Tools for Finitely Presented Groups.
Computational Support for Discrete Mathematics
George Havas, Edmund F. Robertson
1991 J jnl
A library of simple groups: permutations, presentations, cojugacy classes, maximal subgroups and Sylow subgroups.
SIGSAM Bull.
A. R. Jamali, Edmund F. Robertson
1988 J jnl
Tietze Transformations with Weighted Substring Search.
J. Symb. Comput.
Edmund F. Robertson
1985 — conf
A Cayley File of Finite Simple Groups.
European Conference on Computer Algebra (2)
Colin M. Campbell, Edmund F. Robertson