default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Hoffmann 0002
Person information
- affiliation: University of Leicester, UK
Other persons with the same name
- Michael Hoffmann — disambiguation page
- Michael Hoffmann 0001
![[0000-0001-5307-7106]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5307-7106")
— ETH Zürich, Switzerland - Michael Hoffmann 0003 — Scheer Management GmbH, Saarbrücken, Germany (and 1 more)
- Michael Hoffmann 0004 — Technische Universität Braunschweig, Germany
- Michael Hoffmann 0005 — Universität Ulm, Institut für Mikrowellentechnik, Germany
- Michael Hoffmann 0006 — Fraunhofer Institute for Manufacturing Technology and Advanced Materials, Bremen, Germany
- Michael Hoffmann 0007 — University of Leipzig, AKSW Research Group, Germany
- Michael Hoffmann 0008 — NaMLab GmbH, Dresden, Germany
- Michael Hoffmann 0009 — Hybridlab Inc., Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. Algorithmica 85(2): 406-443 (2023)- 2021
- [j10]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On temporal graph exploration. J. Comput. Syst. Sci. 119: 1-18 (2021) - [c14]Thomas Erlebach, Michael Hoffmann, Murilo Santos de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. STACS 2021: 27:1-27:18 - [i5]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima:
Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries. CoRR abs/2101.05032 (2021) - 2020
- [i4]Thomas Erlebach, Michael Hoffmann, Murilo S. de Lima, Nicole Megow, Jens Schlöter:
Untrusted Predictions Improve Trustable Query Policies. CoRR abs/2011.07385 (2020)
2010 – 2019
- 2018
- [j9]Michael Hoffmann, John Iacono, Patrick K. Nicholson, Rajeev Raman:
Encoding nearest larger values. Theor. Comput. Sci. 710: 97-115 (2018) - 2016
- [j8]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-competitive algorithms for cheapest set problems under uncertainty. Theor. Comput. Sci. 613: 51-64 (2016) - 2015
- [j7]Thomas Erlebach, Michael Hoffmann:
Query-Competitive Algorithms for Computing with Uncertainty. Bull. EATCS 116 (2015) - [c13]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. ICALP (1) 2015: 444-455 - [i3]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
On Temporal Graph Exploration. CoRR abs/1504.07976 (2015) - 2014
- [c12]Thomas Erlebach, Michael Hoffmann, Frank Kammer:
Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty. MFCS (2) 2014: 263-274 - [c11]Thomas Erlebach, Michael Hoffmann:
Minimum Spanning Tree Verification Under Uncertainty. WG 2014: 164-175 - 2013
- [j6]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
On the automaticity of singular Artin monoids of finite type. Int. J. Comput. Math. 90(6): 1197-1222 (2013) - [c10]George Charalambous, Michael Hoffmann:
Verification Problem of Maximal Points under Uncertainty. IWOCA 2013: 94-105 - 2012
- [c9]Michael Hoffmann, Derek F. Holt, Matthew D. Owens, Richard M. Thomas:
Semigroups with a Context-Free Word Problem. Developments in Language Theory 2012: 97-108 - 2011
- [c8]Ruth Corran, Michael Hoffmann, Dietrich Kuske, Richard M. Thomas:
Singular Artin Monoids of Finite Coxeter Type Are Automatic. LATA 2011: 250-261 - 2010
- [j5]Michael Hoffmann, Richard M. Thomas:
Notions of hyperbolicity in monoids. Theor. Comput. Sci. 411(4-5): 799-811 (2010)
2000 – 2009
- 2008
- [c7]Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. STACS 2008: 277-288 - [i2]Thomas Erlebach, Michael Hoffmann, Danny Krizanc, Matús Mihalák, Rajeev Raman:
Computing Minimum Spanning Trees with Uncertainty. CoRR abs/0802.2855 (2008) - 2007
- [c6]Michael Hoffmann, S. Muthukrishnan, Rajeev Raman:
Streaming Algorithms for Data in Motion. ESCAPE 2007: 294-304 - [c5]Michael Hoffmann, Richard M. Thomas:
Notions of Hyperbolicity in Monoids. FCT 2007: 341-352 - 2006
- [j4]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. IEEE J. Sel. Areas Commun. 24(12): 2168-2181 (2006) - [j3]Michael Hoffmann, Richard M. Thomas:
A geometric characterization of automatic semigroups. Theor. Comput. Sci. 369(1-3): 300-313 (2006) - [c4]Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák:
Network Discovery and Verification with Distance Queries. CIAC 2006: 69-80 - 2005
- [j2]Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty. Theory Comput. Syst. 38(4): 411-423 (2005) - [c3]Michael Hoffmann, Richard M. Thomas:
Biautomatic Semigroups. FCT 2005: 56-67 - [c2]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. WG 2005: 127-138 - [i1]Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. Algorithms for Optimization with Incomplete Information 2005 - 2003
- [c1]Richard Bruce, Michael Hoffmann, Danny Krizanc, Rajeev Raman:
Efficient Update Strategies for Geometric Computing with Uncertainty. CIAC 2003: 12-23 - 2002
- [j1]Michael Hoffmann, Richard M. Thomas, Nikola Ruskuc:
Automatic Semigroups with Subsemigroups of Finite Rees Index. Int. J. Algebra Comput. 12(3): 463-461 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
