default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Hulpke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]A. S. Detinko, Dane L. Flannery, Alexander Hulpke
:
Experimenting with Symplectic Hypergeometric Monodromy Groups. Exp. Math. 32(1): 88-96 (2023)- 2022
- [j13]Alexander Hulpke:
The perfect groups of order up to two million. Math. Comput. 91(334): 1007-1017 (2022) - 2020
- [j12]A. S. Detinko, Dane L. Flannery, Alexander Hulpke:
Algorithms for Experimenting with Zariski Dense Subgroups. Exp. Math. 29(3): 296-305 (2020)
2010 – 2019
- 2019
- [i1]Alla Detinko, Dane L. Flannery, Alexander Hulpke:
The strong approximation theorem and computing with linear groups. CoRR abs/1905.02683 (2019) - 2018
- [j11]A. S. Detinko, Dane L. Flannery, Alexander Hulpke:
Zariski density and computing in arithmetic groups. Math. Comput. 87(310): 967-986 (2018) - [c7]Alexander Hulpke:
Constructive Membership Tests in Some Infinite Matrix Groups. ISSAC 2018: 215-222 - 2015
- [c6]Alexander Hulpke:
Constructing All Composition Series of a Finite Group. ISSAC 2015: 229-234 - 2014
- [c5]Alexander Hulpke:
Software for Groups: Theory and Practice. ICMS 2014: 87-91 - 2013
- [j10]Alexander Hulpke:
Computing generators of groups preserving a bilinear form over residue class rings. J. Symb. Comput. 50: 298-307 (2013) - [c4]Alexander Hulpke:
Calculation of the subgroups of a trivial-fitting group. ISSAC 2013: 205-210 - 2012
- [j9]Bettina Eick, Alexander Hulpke:
Computing Hall subgroups of finite groups. LMS J. Comput. Math. 15: 205-218 (2012) - 2011
- [j8]Alexander Hulpke, Petteri Kaski, Patric R. J. Östergård:
The number of Latin squares of order 11. Math. Comput. 80(274): 1197-1219 (2011) - 2010
- [j7]Michael Ian Hartley, Alexander Hulpke:
Polytopes derived from sporadic simple groups. Contributions Discret. Math. 5(2) (2010)
2000 – 2009
- 2005
- [j6]Alexander Hulpke:
Constructing transitive permutation groups. J. Symb. Comput. 39(1): 1-30 (2005) - 2003
- [c3]Alexander Hulpke, Steve Linton:
Total ordering on subgroups and cosets. ISSAC 2003: 156-160 - 2001
- [j5]Alexander Hulpke:
Representing Subgroups of Finitely Presented Groups by Quotient Subgroups. Exp. Math. 10(3): 369-381 (2001) - 2000
- [j4]Alexander Hulpke:
Conjugacy classes in finite permutation groups via homomorphic images. Math. Comput. 69(232): 1633-1651 (2000)
1990 – 1999
- 1999
- [j3]Alexander Hulpke:
Computing Subgroups Invariant Under a Set of Automorphisms. J. Symb. Comput. 27(4): 415-427 (1999) - 1998
- [j2]John H. Conway, Alexander Hulpke, John McKay:
On Transitive Permutation Groups. LMS J. Comput. Math. 1: 1-8 (1998) - [c2]Alexander Hulpke:
Computing Normal Subgroups. ISSAC 1998: 194-198 - 1997
- [c1]Alexander Hulpke:
Techniques for the Computation of Galois Groups. Algorithmic Algebra and Number Theory 1997: 65-77 - 1995
- [j1]Alexander Hulpke:
Block Systems of a Galois Group. Exp. Math. 4(1): 1-9 (1995)
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 2024-04-29 21:24 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:
