default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMax Neunhöffer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j10]Derek F. Holt, Stephen A. Linton, Max Neunhöffer, Richard Parker, Markus Pfeiffer, Colva M. Roney-Dougal
:
Polynomial-time proofs that groups are hyperbolic. J. Symb. Comput. 104: 419-475 (2021)- 2016
- [j9]Collin Bleak, Francesco Matucci, Max Neunhöffer:
Embeddings into Thompson's group V and coCF groups. J. Lond. Math. Soc. 94(2): 583-597 (2016) - 2014
- [j8]Max Neunhöffer, Cheryl E. Praeger:
Sporadic neighbour-transitive codes in Johnson graphs. Des. Codes Cryptogr. 72(1): 141-152 (2014) - 2012
- [j7]Klaus Lux, Max Neunhöffer, Felix Noeske:
Condensation of homomorphism spaces. LMS J. Comput. Math. 15: 140-157 (2012) - 2010
- [j6]João Araújo, Paul von Bünau, James D. Mitchell, Max Neunhöffer:
Computing automorphisms of semigroups. J. Symb. Comput. 45(3): 373-392 (2010) - 2008
- [j5]Max Neunhöffer, Cheryl E. Praeger:
Computing Minimal Polynomials of Matrices. LMS J. Comput. Math. 11: 252-279 (2008) - 2005
- [j4]Jürgen Müller, Max Neunhöffer:
Some Computations Regarding Foulkes' Conjecture. Exp. Math. 14(3): 277-283 (2005) - [j3]Sophie Ambrose, Max Neunhöffer, Cheryl E. Praeger, Csaba Schneider:
Generalised Sifting in Black-Box Groups. LMS J. Comput. Math. 8: 217-250 (2005) - 2002
- [j2]Jürgen Müller, Max Neunhöffer, Frank Röhr, Robert A. Wilson:
Completing the Brauer Trees for the Sporadic Simple Lyons Group. LMS J. Comput. Math. 5: 18-33 (2002) - 2001
- [j1]Frank Lübeck, Max Neunhöffer:
Enumerating Large Orbits and Direct Condensation. Exp. Math. 10(2): 197-205 (2001)
Conference and Workshop Papers
- 2013
- [c4]Vladimir Janjic, Christopher Brown, Max Neunhöffer, Kevin Hammond, Steve Linton, Hans-Wolfgang Loidl:
Space Exploration using Parallel Orbits: a Study in Parallel Symbolic Computing. PARCO 2013: 225-232 - 2010
- [c3]Reimer Behrends, Alexander Konovalov, Steve Linton, Frank Lübeck, Max Neunhöffer:
Parallelising the computational algebra system GAP. PASCO 2010: 177-178 - [c2]Reimer Behrends, Alexander Konovalov, Steve Linton, Frank Lübeck, Max Neunhöffer:
Towards High-Performance Computational Algebra with GAP. ICMS 2010: 58-61 - 2006
- [c1]Max Neunhöffer, Ákos Seress:
A data structure for a uniform approach to computations with finite groups. ISSAC 2006: 254-261
Informal and Other Publications
- 2012
- [i2]Max Neunhöffer, Markus Pfeiffer, Nik Ruskuc:
Deciding Word Problems of Semigroups using Finite State Automata. CoRR abs/1206.1714 (2012) - 2007
- [i1]Max Neunhöffer, Cheryl E. Praeger:
Computing Minimal Polynomials of Matrices. CoRR abs/0705.0933 (2007)
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-05-08 21: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:
