![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Derek F. Holt
Person information
- affiliation: University of Warwick, Mathematics Institute
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j38]Derek F. Holt, Sarah Rees:
Biautomatic structures in systolic Artin groups. Int. J. Algebra Comput. 31(3): 365-391 (2021) - [j37]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) - 2020
- [j36]Derek F. Holt, Gordon F. Royle
:
A census of small transitive groups and vertex-transitive graphs. J. Symb. Comput. 101: 51-60 (2020)
2010 – 2019
- 2019
- [j35]John J. Cannon, Derek F. Holt, William R. Unger:
The use of permutation representations in structural computations in large finite matrix groups. J. Symb. Comput. 95: 26-38 (2019) - [c5]Derek F. Holt, Markus Lohrey, Saul Schleimer:
Compressed Decision Problems in Hyperbolic Groups. STACS 2019: 37:1-37:16 - 2017
- [b1]Derek F. Holt, Sarah Rees, Claas E. Röver:
Groups, Languages and Automata. London Mathematical Society Student Texts 88, Cambridge University Press 2017, ISBN 9781316588246 - [j34]Shavak K. Sinanan, Derek F. Holt:
Algorithms for polycyclic-by-finite groups. J. Symb. Comput. 79: 269-284 (2017) - 2015
- [j33]Henrik Bäärnhielm
, Derek F. Holt, Charles R. Leedham-Green, Eamonn A. O'Brien:
A practical model for computation with matrix groups. J. Symb. Comput. 68: 27-60 (2015) - 2013
- [j32]John J. Cannon, Derek F. Holt:
Computing Projective Indecomposable Modules and Higher Cohomology Groups. Exp. Math. 22(1): 51-59 (2013) - [j31]Derek F. Holt, Sarah Rees:
Shortlex automaticity and geodesic regularity in Artin groups. Groups Complex. Cryptol. 5(1): 1-23 (2013) - [j30]D. J. Buckley, Derek F. Holt:
The Conjugacy Problem in hyperbolic Groups for Finite Lists of Group Elements. Int. J. Algebra Comput. 23(5): 1127-1150 (2013) - 2012
- [c4]Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas:
Semigroups with a Context-Free Word Problem. Developments in Language Theory 2012: 97-108 - 2011
- [j29]Derek F. Holt, Sarah Rees, Claas E. Röver:
Groups with Context-Free Conjugacy Problems. Int. J. Algebra Comput. 21(1-2): 193-216 (2011) - 2010
- [j28]Derek F. Holt, Colva M. Roney-Dougal:
Constructing maximal subgroups of orthogonal groups. LMS J. Comput. Math. 13: 164-191 (2010)
2000 – 2009
- 2008
- [j27]John J. Cannon, Derek F. Holt:
The Transitive Permutation Groups of Degree 32. Exp. Math. 17(3): 307-314 (2008) - [j26]Susan M. Hermiller, Derek F. Holt, Sarah Rees:
Groups whose Geodesics are Locally Testable. Int. J. Algebra Comput. 18(5): 911-923 (2008) - [j25]Derek F. Holt, Sarah Rees, Michael Shapiro
:
Groups that do and do not Have Growing Context-Sensitive Word Problem. Int. J. Algebra Comput. 18(7): 1179-1191 (2008) - [j24]Derek F. Holt, Mark J. Stather:
Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field. LMS J. Comput. Math. 11: 223-251 (2008) - 2007
- [j23]Susan M. Hermiller, Derek F. Holt, Sarah Rees:
Star-Free Geodesic Languages for Groups. Int. J. Algebra Comput. 17(2): 329-345 (2007) - 2006
- [j22]David B. A. Epstein, Derek F. Holt:
The Linearity of the Conjugacy Problem in Word-hyperbolic Groups. Int. J. Algebra Comput. 16(2): 287-306 (2006) - [j21]Derek F. Holt, Claas E. Röver:
Groups with Indexed Co-word Problem. Int. J. Algebra Comput. 16(5): 985-1014 (2006) - 2005
- [j20]John J. Cannon, Derek F. Holt, Michael C. Slattery, Allan K. Steel:
Computing subgroups of bounded index in a finite group. J. Symb. Comput. 40(2): 1013-1022 (2005) - [j19]Derek F. Holt, Colva M. Roney-Dougal:
Constructing Maximal Subgroups of Classical Groups. LMS J. Comput. Math. 8: 46-79 (2005) - 2004
- [j18]John J. Cannon, Derek F. Holt:
Computing maximal subgroups of finite groups. J. Symb. Comput. 37(5): 589-609 (2004) - 2003
- [j17]Derek F. Holt, Sarah Rees:
Regularity of Quasigeodesics in a Hyperbolic Group. Int. J. Algebra Comput. 13(5): 585-596 (2003) - [j16]John J. Cannon, Derek F. Holt:
Automorphism group computation and isomorphism testing in finite groups. J. Symb. Comput. 35(3): 241-267 (2003) - 2001
- [j15]David B. A. Epstein, Derek F. Holt:
Computation in Word-Hyperbolic Groups. Int. J. Algebra Comput. 11(4): 467-488 (2001) - [j14]John J. Cannon, Bruce C. Cox, Derek F. Holt:
Computing the Subgroups of a Permutation Group. J. Symb. Comput. 31(1/2): 149-161 (2001) - 2000
- [j13]Derek F. Holt:
Word-Hyperbolic Groups Have Real-Time Word Problem. Int. J. Algebra Comput. 10(2): 221-228 (2000) - [c3]Derek F. Holt:
Computation in word-hyperbolic groups. ISSAC 2000
1990 – 1999
- 1999
- [j12]Robert H. Gilman, Derek F. Holt, Sarah Rees:
Combing Nilpotent and Polycyclic Groups. Int. J. Algebra Comput. 9(2): 135-156 (1999) - [j11]Derek F. Holt, D. F. Hurt:
Computing Automatic Coset Systems and Subgroup Presentations. J. Symb. Comput. 27(1): 1-19 (1999) - 1997
- [j10]John J. Cannon, Derek F. Holt:
Computing Chief Series, Composition Series and Socles in Large Permutation Groups. J. Symb. Comput. 24(3/4): 285-301 (1997) - [j9]John J. Cannon, Bruce C. Cox, Derek F. Holt:
Computing Sylow Subgroups in Permutation Groups. J. Symb. Comput. 24(3/4): 303-316 (1997) - [j8]Derek F. Holt, Wilhelm Plesken, Bernd Souvignier:
Constructing a Representation of the Group. J. Symb. Comput. 24(3/4): 489-492 (1997) - 1996
- [j7]Derek F. Holt, Sarah Rees:
Free Quotients of Finitely Presented Groups. Exp. Math. 5(1): 49-56 (1996) - 1995
- [j6]Derek F. Holt:
An Alternative Proof That the Fibonacci Group F(2, 9) is Infinite. Exp. Math. 4(2): 97-100 (1995) - 1994
- [c2]Derek F. Holt:
The Warwick automatic groups software. Geometric and Computational Perspectives on Infinite Groups 1994: 69-82 - 1992
- [j5]Derek F. Holt, Sarah Rees:
An Implementation of the Neumann-Praeger Algorithm for the Recognition of Special Linear Groups. Exp. Math. 1(3): 237-242 (1992) - 1991
- [j4]David B. A. Epstein, Derek F. Holt, Sarah Rees:
The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups. J. Symb. Comput. 12(4/5): 397-414 (1991) - [j3]Derek F. Holt:
The Computation of Normalizers in Permutation Groups. J. Symb. Comput. 12(4/5): 499-516 (1991) - [c1]Derek F. Holt, Sarah Rees:
A Graphics System for Displaying Finite Quotients of Finitely Presented Groups 113. Groups And Computation 1991: 113-126
1980 – 1989
- 1985
- [j2]Derek F. Holt:
The Mechanical Computation of First and Second Cohomology Groups. J. Symb. Comput. 1(4): 351-361 (1985) - 1981
- [j1]Derek F. Holt:
A graph which is edge transitive but not arc transitive. J. Graph Theory 5(2): 201-204 (1981)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint