Michael Hoffmann

According to our database, Michael Hoffmann authored at least 20 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries.

Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima

Algorithmica, February, 2023

2021

On temporal graph exploration.

Thomas Erlebach, Michael Hoffmann, Frank Kammer

J. Comput. Syst. Sci., 2021

2020

Untrusted Predictions Improve Trustable Query Policies.

Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter

CoRR, 2020

2018

Encoding nearest larger values.

Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman

Theor. Comput. Sci., 2018

2016

Query-competitive algorithms for cheapest set problems under uncertainty.

Thomas Erlebach, Michael Hoffmann, Frank Kammer

Theor. Comput. Sci., 2016

2015

Query-Competitive Algorithms for Computing with Uncertainty.

Thomas Erlebach, Michael Hoffmann

Bull. EATCS, 2015

2014

Minimum Spanning Tree Verification Under Uncertainty.

Thomas Erlebach, Michael Hoffmann

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

2013

On the automaticity of singular Artin monoids of finite type.

Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas

Int. J. Comput. Math., 2013

Verification Problem of Maximal Points under Uncertainty.

George Charalambous, Michael Hoffmann

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Semigroups with a Context-Free Word Problem.

Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Singular Artin Monoids of Finite Coxeter Type Are Automatic.

Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas

Proceedings of the Language and Automata Theory and Applications, 2011

2010

Notions of hyperbolicity in monoids.

Michael Hoffmann, Richard M. Thomas

Theor. Comput. Sci., 2010

2008

Computing Minimum Spanning Trees with Uncertainty.

Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman

Proceedings of the STACS 2008, 2008

2007

Streaming Algorithms for Data in Motion.

Michael Hoffmann, S. Muthukrishnan, Rajeev Raman

Proceedings of the Combinatorics, 2007

2006

A geometric characterization of automatic semigroups.

Michael Hoffmann, Richard M. Thomas

Theor. Comput. Sci., 2006

Network Discovery and Verification.

Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram

IEEE J. Sel. Areas Commun., 2006

Network Discovery and Verification with Distance Queries.

Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2005

Efficient Update Strategies for Geometric Computing with Uncertainty.

Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman

Theory Comput. Syst., 2005

Biautomatic Semigroups.

Michael Hoffmann, Richard M. Thomas

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2002

Automatic Semigroups with Subsemigroups of Finite Rees Index.

Michael Hoffmann, Richard M. Thomas, Nikola Ruskuc

Int. J. Algebra Comput., 2002