Bettina Eick

Orcid: 0000-0003-2884-6545

According to our database1, Bettina Eick authored at least 33 papers between 1995 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Groups whose orders factorise into at most four primes.
J. Symb. Comput., 2022

2021
Computing the Schur multipliers of the Lie <i>p</i>-rings in the family defined by a symbolic Lie <i>p</i>-ring presentation.
J. Symb. Comput., 2021

2020
The GAP Package LiePRing.
Proceedings of the Mathematical Software - ICMS 2020, 2020

A nilpotent quotient algorithm for finitely presented associative $\mathbb {Z}$-algebras and its application to integral group rings.
Proceedings of the 75 Years of Mathematics of Computation, 2020

2019
Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups.
J. Symb. Comput., 2019

The conjugacy problem in GL ( n , Z ).
J. Lond. Math. Soc., 2019

2017
The isomorphism problem for torsion free nilpotent groups of Hirsch length at most 5.
Groups Complex. Cryptol., 2017

Coclass Theory for Finite Nilpotent Associative Algebras: Algorithms and a Periodicity Conjecture.
Exp. Math., 2017

2016
The automorphism group of a finitely generated virtually abelian group.
Groups Complex. Cryptol., 2016

2015
Group extensions with special properties.
Groups Complex. Cryptol., 2015

2014
The constructive membership problem for discrete free subgroups of rank 2 of.
LMS J. Comput. Math., 2014

Approximating Generators for Integral Arithmetic Groups.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
On the Classification of Groups of Prime-Power Order by Coclass: the 3-Groups of Coclass 2.
Int. J. Algebra Comput., 2013

2012
Computing Hall subgroups of finite groups.
LMS J. Comput. Math., 2012

2011
Computation of Low-Dimensional (Co)Homology Groups for Infinite Sequences of P-Groups with Fixed Coclass.
Int. J. Algebra Comput., 2011

Computing Nilpotent Quotients of Associative Algebras and Algebras Satisfying a Polynomial Identity.
Int. J. Algebra Comput., 2011

2010
Some new simple Lie algebras in characteristic 2.
J. Symb. Comput., 2010

Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases.
Proceedings of the Mathematical Software, 2010

2009
Constructing CF Groups by Coclass.
Exp. Math., 2009

2008
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications.
Int. J. Algebra Comput., 2008

2007
Testing polycyclicity of finitely generated rational matrix groups.
Math. Comput., 2007

2005
Computing polycyclic presentations for polycyclic rational matrix groups.
J. Symb. Comput., 2005

2004
Special polycyclic generating sequences for finite soluble groups.
J. Symb. Comput., 2004

2003
On the orbit-stabilizer problem for integral matrix actions of polycyclic groups.
Math. Comput., 2003

The Solvable Primitive Permutation Groups of Degree at Most 6560.
LMS J. Comput. Math., 2003

2002
Computing Subgroups by Exhibition in Finite Solvable Groups.
J. Symb. Comput., 2002

Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups.
J. Symb. Comput., 2002

A Millennium Project: Constructing Small Groups.
Int. J. Algebra Comput., 2002

Computational Aspects of Group Extensions and Their Applications in Topology.
Exp. Math., 2002

1999
The Groups of Order at Most 1000 Except 512 and 768.
J. Symb. Comput., 1999

Construction of Finite Groups.
J. Symb. Comput., 1999

1997
The Groups of Order 512.
Proceedings of the Algorithmic Algebra and Number Theory, 1997

1995
Special presentations for finite soluble groups and computing(pre-) Frattini subgroups.
Proceedings of the Groups and Computation, 1995


  Loading...