default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBettina Eick
Person information
- affiliation: Technical University of Braunschweig, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j28]Bettina Eick
, Óscar Fernández Ayala:
The conjugacy problem and canonical representatives in finitely generated nilpotent groups. J. Symb. Comput. 130: 102422 (2025)- 2022
- [j27]Heiko Dietrich, Bettina Eick, Xueyu Pan:
Groups whose orders factorise into at most four primes. J. Symb. Comput. 108: 23-40 (2022) - 2021
- [j26]Bettina Eick, Taleea Jalaeeyan Ghorbanzadeh:
Computing the Schur multipliers of the Lie p-rings in the family defined by a symbolic Lie p-ring presentation. J. Symb. Comput. 106: 68-77 (2021) - 2019
- [j25]Bettina Eick, Tommy Hofmann, Eamonn A. O'Brien:
The conjugacy problem in GL ( n , Z ). J. Lond. Math. Soc. 100(3): 731-756 (2019) - [j24]Alexander Cant, Bettina Eick:
Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups. J. Symb. Comput. 92: 203-210 (2019) - 2017
- [j23]Bettina Eick, Tobias Moede:
Coclass Theory for Finite Nilpotent Associative Algebras: Algorithms and a Periodicity Conjecture. Exp. Math. 26(3): 267-274 (2017) - [j22]Bettina Eick, Ann-Kristin Engel:
The isomorphism problem for torsion free nilpotent groups of Hirsch length at most 5. Groups Complex. Cryptol. 9(1): 55 (2017) - 2016
- [j21]Bettina Eick:
The automorphism group of a finitely generated virtually abelian group. Groups Complex. Cryptol. 8(1): 35-45 (2016) - 2015
- [j20]Andreas Distler, Bettina Eick:
Group extensions with special properties. Groups Complex. Cryptol. 7(1): 1-10 (2015) - 2014
- [j19]Bettina Eick, Markus Kirschmer, Charles R. Leedham-Green:
The constructive membership problem for discrete free subgroups of rank 2 of. LMS J. Comput. Math. 17(1): 345-359 (2014) - 2013
- [j18]Bettina Eick, Charles R. Leedham-Green, Mike F. Newman, Eamonn A. O'Brien:
On the Classification of Groups of Prime-Power Order by Coclass: the 3-Groups of Coclass 2. Int. J. Algebra Comput. 23(5): 1243- (2013) - 2012
- [j17]Bettina Eick, Alexander Hulpke:
Computing Hall subgroups of finite groups. LMS J. Comput. Math. 15: 205-218 (2012) - 2011
- [j16]Bettina Eick, Dörte Feichtenschlager:
Computation of Low-Dimensional (Co)Homology Groups for Infinite Sequences of P-Groups with Fixed Coclass. Int. J. Algebra Comput. 21(4): 635-649 (2011) - [j15]Bettina Eick:
Computing Nilpotent Quotients of Associative Algebras and Algebras Satisfying a Polynomial Identity. Int. J. Algebra Comput. 21(8): 1339-1355 (2011) - 2010
- [j14]Bettina Eick:
Some new simple Lie algebras in characteristic 2. J. Symb. Comput. 45(9): 943-951 (2010) - 2009
- [j13]Bettina Eick, Dörte Feichtenschlager:
Constructing CF Groups by Coclass. Exp. Math. 18(2): 205-211 (2009) - 2008
- [j12]Laurent Bartholdi, Bettina Eick, René Hartung:
A Nilpotent Quotient Algorithm for Certain Infinitely Presented Groups and its Applications. Int. J. Algebra Comput. 18(8): 1321-1344 (2008) - 2007
- [j11]Björn Assmann, Bettina Eick:
Testing polycyclicity of finitely generated rational matrix groups. Math. Comput. 76(259): 1669-1682 (2007) - 2005
- [j10]Björn Assmann, Bettina Eick:
Computing polycyclic presentations for polycyclic rational matrix groups. J. Symb. Comput. 40(6): 1269-1284 (2005) - 2004
- [j9]John J. Cannon, Bettina Eick, Charles R. Leedham-Green:
Special polycyclic generating sequences for finite soluble groups. J. Symb. Comput. 38(5): 1445-1460 (2004) - 2003
- [j8]Bettina Eick, Burkhard Höfling:
The Solvable Primitive Permutation Groups of Degree at Most 6560. LMS J. Comput. Math. 6: 29-39 (2003) - [j7]Bettina Eick, Gretchen Ostheimer:
On the orbit-stabilizer problem for integral matrix actions of polycyclic groups. Math. Comput. 72(243): 1511-1529 (2003) - 2002
- [j6]Karel Dekimpe, Bettina Eick:
Computational Aspects of Group Extensions and Their Applications in Topology. Exp. Math. 11(2): 183-200 (2002) - [j5]Hans Ulrich Besche, Bettina Eick, Eamonn A. O'Brien:
A Millennium Project: Constructing Small Groups. Int. J. Algebra Comput. 12(5): 623-644 (2002) - [j4]Bettina Eick, Charles R. B. Wright:
Computing Subgroups by Exhibition in Finite Solvable Groups. J. Symb. Comput. 33(2): 129-143 (2002) - [j3]Bettina Eick:
Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups. J. Symb. Comput. 34(1): 1-19 (2002) - 1999
- [j2]Hans Ulrich Besche, Bettina Eick:
Construction of Finite Groups. J. Symb. Comput. 27(4): 387-404 (1999) - [j1]Hans Ulrich Besche, Bettina Eick:
The Groups of Order at Most 1000 Except 512 and 768. J. Symb. Comput. 27(4): 405-413 (1999)
Conference and Workshop Papers
- 2020
- [c5]Bettina Eick, Michael R. Vaughan-Lee:
The GAP Package LiePRing. ICMS 2020: 131-140 - 2014
- [c4]Bettina Eick:
Approximating Generators for Integral Arithmetic Groups. ICMS 2014: 83-86 - 2010
- [c3]Bettina Eick, Max Horn:
Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases. ICMS 2010: 50-53 - 1997
- [c2]Bettina Eick, Eamonn A. O'Brien:
The Groups of Order 512. Algorithmic Algebra and Number Theory 1997: 379-380 - 1995
- [c1]Bettina Eick:
Special presentations for finite soluble groups and computing(pre-) Frattini subgroups. Groups and Computation 1995: 101-112
Parts in Books or Collections
- 2020
- [p1]Bettina Eick, Tobias Moede:
A nilpotent quotient algorithm for finitely presented associative ℤ-algebras and its application to integral group rings. 75 Years of Mathematics of Computation 2020
Editorship
- 2024
- [e1]Kevin Buzzard, Alicia Dickenstein, Bettina Eick, Anton Leykin, Yue Ren:
Mathematical Software - ICMS 2024 - 8th International Conference, Durham, UK, July 22-25, 2024, Proceedings. Lecture Notes in Computer Science 14749, Springer 2024, ISBN 978-3-031-64528-0 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-04-30 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
