Computations with Rational Subsets of Confluent Groups. - Robert H. Gilman 001 (EUROSAM, 1984)

Characteristically Simple 0-Categorical Groups. - Robert H. Gilman 001 (J. Symb. Log., 1984)

Verifying that a Group is Virtually Free. - Robert H. Gilman 001 (Int. J. Algebra Comput., 1991)

Automatic Groups and String Rewriting. - Robert H. Gilman 001 (Term Rewriting, 1993)

A Remark about Combings of Groups. - Martin R. Bridson; Robert H. Gilman 001 (Int. J. Algebra Comput., 1993)

Formal languages and infinite groups. - Robert H. Gilman 001 (Geometric and Computational Perspectives on Infinite Groups, 1994)

A Shrinking Lemma for Indexed Languages. - Robert H. Gilman 001 (Theor. Comput. Sci., 1996)

Combing Nilpotent and Polycyclic Groups. - Robert H. Gilman 001; Derek F. Holt; Sarah Rees (Int. J. Algebra Comput., 1999)

Context-Free Languages of Sub-exponential Growth. - Martin R. Bridson; Robert H. Gilman 001 (J. Comput. Syst. Sci., 2002)

Report on Generic Case Complexity - Robert H. Gilman 001; Alexei G. Myasnikov; Alex D. Myasnikov; Alexander Ushakov (CoRR, 2007)

A geometric zero-one law. - Robert H. Gilman 001; Yuri Gurevich; Alexei D. Miasnikov (J. Symb. Log., 2009)

Random equations in free groups. - Robert H. Gilman 001; Alexei G. Myasnikov; Vitalii Roman'kov (Groups Complex. Cryptol., 2011)

Generalized small cancellation presentations for automatic groups. - Robert H. Gilman 001 (Groups Complex. Cryptol., 2014)

Groups whose word problems are not semilinear. - Robert H. Gilman 001; Robert P. Kropholler; Saul Schleimer (Groups Complex. Cryptol., 2018)