On Deciding Finiteness for Matrix Groups over Fields of Positive Characteristic. - Alla Detinko (LMS J. Comput. Math., 2001)

Computing in Nilpotent Matrix Groups. - A. S. Detinko; Dane L. Flannery (LMS J. Comput. Math., 2006)

Algorithms for computing with nilpotent matrix groups over infinite domains. - A. S. Detinko; Dane L. Flannery (J. Symb. Comput., 2008)

On deciding finiteness of matrix groups. - A. S. Detinko; Dane L. Flannery (J. Symb. Comput., 2009)

Recognizing finite matrix groups over infinite fields. - A. S. Detinko; Dane L. Flannery; Eamonn A. O'Brien (J. Symb. Comput., 2013)

Integrality and arithmeticity of solvable linear groups. - A. S. Detinko; Dane L. Flannery; Willem A. de Graaf (J. Symb. Comput., 2015)

Zariski density and computing in arithmetic groups. - A. S. Detinko; Dane L. Flannery; Alexander Hulpke (Math. Comput., 2018)

The strong approximation theorem and computing with linear groups. - Alla Detinko; Dane L. Flannery; Alexander Hulpke (CoRR, 2019)

Algorithms for Experimenting with Zariski Dense Subgroups. - A. S. Detinko; Dane L. Flannery; Alexander Hulpke (Exp. Math., 2020)

Experimenting with Symplectic Hypergeometric Monodromy Groups. - A. S. Detinko; Dane L. Flannery; Alexander Hulpke (Exp. Math., 2023)