We stand with Ukraine  

Martin Huschenbett

According to our database1, Martin Huschenbett authored at least 11 papers between 2010 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Daml: A Smart Contract Language for Securely Automating Real-World Multi-Party Business Workflows.
[BibTeX]
[DOI]
Alexander Bernauer
,
Sofia Faro
,
Rémy Haemmerle
,
Martin Huschenbett
,
Moritz Kiefer
,
Andreas Lochbihler
,
Jussi Mäki
,
Francesco Mazzoli
,
Simon Meier
,
Neil Mitchell
,
Ratko G. Veprek
CoRR, 2023

2017
Pumping for ordinal-automatic structures.
[BibTeX]
[DOI]
Martin Huschenbett
,
Alexander Kartzow
,
Philipp Schlicht
Comput., 2017

2016
The model-theoretic complexity of automatic linear orders.
[BibTeX]
[DOI]
Martin Huschenbett
PhD thesis, 2016

2014
Ehrenfeucht-Fraïssé Games on Omega-Terms.
[BibTeX]
[DOI]
Martin Huschenbett
,
Manfred Kufleitner
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, 2014

The Monoid of Queue Actions.
[BibTeX]
[DOI]
Martin Huschenbett
,
Dietrich Kuske
,
Georg Zetzsche
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Tree-Automatic Well-Founded Trees
[BibTeX]
[DOI]
Martin Huschenbett
,
Alexander Kartzow
,
Jiamou Liu
,
Markus Lohrey
Log. Methods Comput. Sci., 2013

The Rank of Tree-Automatic Linear Orderings.
[BibTeX]
[DOI]
Martin Huschenbett
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

A Polychromatic Ramsey Theory for Ordinals.
[BibTeX]
[DOI]
Martin Huschenbett
,
Jiamou Liu
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable.
[BibTeX]
[DOI]
Martin Huschenbett
Proceedings of the How the World Computes, 2012

2011
Models for Quantitative Distributed Systems and Multi-Valued Logics.
[BibTeX]
[DOI]
Martin Huschenbett
Proceedings of the Language and Automata Theory and Applications, 2011

2010
A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices.
[BibTeX]
Martin Huschenbett
Proceedings of the Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23, 2010


  Loading...