Automatic Semigroups with Subsemigroups of Finite Rees Index. - Michael Hoffmann 002; Richard M. Thomas; Nikola Ruskuc (Int. J. Algebra Comput., 2002)

Biautomatic Semigroups. - Michael Hoffmann 002; Richard M. Thomas (FCT, 2005)

Efficient Update Strategies for Geometric Computing with Uncertainty. - Richard Bruce; Michael Hoffmann 002; Danny Krizanc; Rajeev Raman (Theory Comput. Syst., 2005)

Network Discovery and Verification with Distance Queries. - Thomas Erlebach; Alexander Hall; Michael Hoffmann 002; Matús Mihalák (CIAC, 2006)

Network Discovery and Verification. - Zuzana Beerliova; Felix Eberhard; Thomas Erlebach; Alexander Hall; Michael Hoffmann 002; Matús Mihalák; L. Shankar Ram (IEEE J. Sel. Areas Commun., 2006)

A geometric characterization of automatic semigroups. - Michael Hoffmann 002; Richard M. Thomas (Theor. Comput. Sci., 2006)

Streaming Algorithms for Data in Motion. - Michael Hoffmann 002; S. Muthukrishnan 001; Rajeev Raman (ESCAPE, 2007)

Computing Minimum Spanning Trees with Uncertainty. - Michael Hoffmann 002; Thomas Erlebach; Danny Krizanc; Matús Mihalák; Rajeev Raman (STACS, 2008)

Notions of hyperbolicity in monoids. - Michael Hoffmann 002; Richard M. Thomas (Theor. Comput. Sci., 2010)

Singular Artin Monoids of Finite Coxeter Type Are Automatic. - Ruth Corran; Michael Hoffmann 002; Dietrich Kuske; Richard M. Thomas (LATA, 2011)

Semigroups with a Context-Free Word Problem. - Michael Hoffmann 002; Derek F. Holt; Matthew D. Owens; Richard M. Thomas (Developments in Language Theory, 2012)

Verification Problem of Maximal Points under Uncertainty. - George Charalambous; Michael Hoffmann 002 (IWOCA, 2013)

On the automaticity of singular Artin monoids of finite type. - Ruth Corran; Michael Hoffmann 002; Dietrich Kuske; Richard M. Thomas (Int. J. Comput. Math., 2013)

Minimum Spanning Tree Verification Under Uncertainty. - Thomas Erlebach; Michael Hoffmann 002 (WG, 2014)

Query-Competitive Algorithms for Computing with Uncertainty. - Thomas Erlebach; Michael Hoffmann 002 (Bull. EATCS, 2015)

Query-competitive algorithms for cheapest set problems under uncertainty. - Thomas Erlebach; Michael Hoffmann 002; Frank Kammer (Theor. Comput. Sci., 2016)

Encoding nearest larger values. - Michael Hoffmann 002; John Iacono; Patrick K. Nicholson; Rajeev Raman (Theor. Comput. Sci., 2018)

Untrusted Predictions Improve Trustable Query Policies. - Thomas Erlebach; Michael Hoffmann 002; Murilo S. de Lima; Nicole Megow; Jens Schlöter (CoRR, 2020)

On temporal graph exploration. - Thomas Erlebach; Michael Hoffmann 002; Frank Kammer (J. Comput. Syst. Sci., 2021)

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. - Thomas Erlebach; Michael Hoffmann 002; Murilo Santos de Lima (Algorithmica, 2023)