The following pages link to Alexander Hulpke (Q237007):
Displaying 50 items.
- (Q468699) (redirect page) (← links)
- Algorithms for arithmetic groups with the congruence subgroup property. (Q468700) (← links)
- Connected quandles and transitive groups (Q888845) (← links)
- Algorithms for a class of infinite permutation groups. (Q928769) (← links)
- (Q1117359) (redirect page) (← links)
- Polynomial hulls of graphs (Q1117360) (← links)
- (Q1264435) (redirect page) (← links)
- An algorithm for solving the factorization problem in permutation groups (Q1264436) (← links)
- Construction of finite groups (Q1283195) (← links)
- The groups of order at most 1000 except 512 and 768 (Q1283196) (← links)
- Computing subgroups invariant under a set of automorphisms (Q1283197) (← links)
- A modular method for computing the Galois groups of polynomials (Q1358933) (← links)
- Computing Sylow subgroups in permutation groups (Q1369792) (← links)
- Automorphism group computation and isomorphism testing in finite groups (Q1401150) (← links)
- Constructive recognition of classical groups in their natural representation. (Q1426140) (← links)
- Computing generators of groups preserving a bilinear form over residue class rings. (Q1930173) (← links)
- Subquadratic-time algorithms for normal bases (Q2040602) (← links)
- An atomic model of the graph of permutations linked by transpositions (Q2090136) (← links)
- Obituary: Joachim Neubüser (1932--2021) (Q2165021) (← links)
- The multiple holomorph of a semidirect product of groups having coprime exponents (Q2187417) (← links)
- Universal covers of finite groups (Q2216564) (← links)
- The twisted Euclidean algorithm: applications to number theory and geometry (Q2216570) (← links)
- On presentations for unitary groups (Q2282984) (← links)
- Finding intermediate subgroups (Q2413195) (← links)
- The strong approximation theorem and computing with linear groups (Q2415313) (← links)
- Computing conjugacy classes of elements in matrix groups. (Q2438900) (← links)
- Constructing transitive permutation groups. (Q2456530) (← links)
- Permutation groups, minimal degrees and quantum computing. (Q2469771) (← links)
- Computational group theory. (Q2570243) (← links)
- Linear time algorithms for Abelian group isomorphism and related problems (Q2643019) (← links)
- Zariski density and computing with \(S\)-integral groups (Q2698475) (← links)
- (Q2759625) (← links)
- Representing Subgroups of Finitely Presented Groups by Quotient Subgroups (Q2775765) (← links)
- Constructing All Composition Series of a Finite Group (Q2819762) (← links)
- All Finite Generalized Tetrahedon Groups II (Q2869262) (← links)
- Software for Groups: Theory and Practice (Q2879103) (← links)
- Calculation of the subgroups of a trivial-fitting group (Q2963235) (← links)
- The number of Latin squares of order 11 (Q3168748) (← links)
- (Q3412702) (← links)
- (Q3545337) (← links)
- The Tits Alternative for Spherical Generalized Tetrahedron Groups (Q3597564) (← links)
- All Finite Generalized Tetrahedron Groups (Q3597566) (← links)
- On Transitive Permutation Groups (Q4230656) (← links)
- (Q4232496) (← links)
- (Q4240273) (← links)
- (Q4240274) (← links)
- (Q4247783) (← links)
- Efficient Simple Groups (Q4428240) (← links)
- Conjugacy classes in finite permutation groups via homomorphic images (Q4501044) (← links)
- EFFICIENT SIMPLE GROUPS (Q4532336) (← links)