Derek F. Holt · VLDB 2026 Research

VLDB 2026 Research / reviewers in the wild / expert

Derek F. Holt

dblp:22/1357 · DBLP profile ↗

← Back

19ranked-venue papers

8as first author

1since 2021 · last 2021

0009-0008-1671-5576ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 19 · 8 first-author · 1 since 2021

Year	Publication	Venue	Position
2021	Polynomial-time proofs that groups are hyperbolic Derek F. Holt, Stephen A. Linton, Max Neunhöffer, Richard Parker, Markus Pfeiffer, Colva M. Roney-Dougal	J. Symb. Comput.	1
2020	A census of small transitive groups and vertex-transitive graphs Derek F. Holt, Gordon F. Royle	J. Symb. Comput.	1
2019	Compressed Decision Problems in Hyperbolic Groups abstract We prove that the compressed word problem and the compressed simultaneous conjugacy problem are solvable in polynomial time in hyperbolic groups. In such problems, group elements are input as words defined by straight-line programs defined over a finite generating set for the group. We prove also that, for any infinite hyperbolic group G, the compressed knapsack problem in G is NP-complete. Derek F. Holt, Markus Lohrey, Saul Schleimer	STACS	1
2019	The use of permutation representations in structural computations in large finite matrix groups John J. Cannon, Derek F. Holt, William R. Unger	J. Symb. Comput.	2
2017	Algorithms for polycyclic-by-finite groups Shavak K. Sinanan, Derek F. Holt	J. Symb. Comput.	2
2015	A practical model for computation with matrix groups Henrik Bäärnhielm, Derek F. Holt, Charles R. Leedham-Green, Eamonn A. O'Brien	J. Symb. Comput.	2
2012	Semigroups with a Context-Free Word Problem Michael Hoffmann 0002, Derek F. Holt, Matthew D. Owens, Richard M. Thomas	Developments in Language Theory	2
2005	Computing subgroups of bounded index in a finite group John J. Cannon, Derek F. Holt, Michael C. Slattery, Allan K. Steel	J. Symb. Comput.	2
2004	Computing maximal subgroups of finite groups John J. Cannon, Derek F. Holt	J. Symb. Comput.	2
2003	Automorphism group computation and isomorphism testing in finite groups John J. Cannon, Derek F. Holt	J. Symb. Comput.	2
2001	Computing the Subgroups of a Permutation Group John J. Cannon, Bruce C. Cox, Derek F. Holt	J. Symb. Comput.	3
2000	Computation in word-hyperbolic groups abstract There is an important class of finitely presented groups known as automatic groups, in which many computations can be undertaken efficiently. In particular, there is a normal form for group elements which is the language of a finite state automation, and arbitrary words in the group generators can be reduced to normal form in quadratic time. The normal form can also be used to enumerate group elements, and to compute the (rational) growth function of the group. The theory of automatic groups is developed [2], and the algorithms are described in more detail in [4]. Implementations of the algorithms are available in a software package of the author ([3]). Derek F. Holt	ISSAC	1
1999	Computing Automatic Coset Systems and Subgroup Presentations Derek F. Holt, D. F. Hurt	J. Symb. Comput.	1
1997	Computing Sylow Subgroups in Permutation Groups John J. Cannon, Bruce C. Cox, Derek F. Holt	J. Symb. Comput.	3
1997	Computing Chief Series, Composition Series and Socles in Large Permutation Groups John J. Cannon, Derek F. Holt	J. Symb. Comput.	2
1997	Constructing a Representation of the Group Derek F. Holt, Wilhelm Plesken, Bernd Souvignier	J. Symb. Comput.	1
1991	The Use of Knuth-Bendix Methods to Solve the Word Problem in Automatic Groups David B. A. Epstein, Derek F. Holt, Sarah Rees	J. Symb. Comput.	2
1991	The Computation of Normalizers in Permutation Groups Derek F. Holt	J. Symb. Comput.	1
1985	The Mechanical Computation of First and Second Cohomology Groups Derek F. Holt	J. Symb. Comput.	1