Martin Huschenbett
Researcher
|
|
Selected talks
- The Equational Theory of Aperiodic Semigroups is Decidable in Exponential Time
AI & Logic Day at AUT, Auckland, February 27th, 2014. [PDF]
Research Seminar of Graduate School "QuantLA", Leipzig, December 17th, 2013. [PDF] - A Polychromatic Ramsey Theory for Ordinals
38th International Symposium on Mathematical Foundations of Computer Science, Klosterneuburg (AT), August 26th, 2013. [PDF]
Annual Workshop "Algorithmic Model Theory", Berlin, February 26th, 2013. [Prezi]
19th Annual Meeting "Logik in der Informatik", Mannheim, November 17th, 2012. [Prezi] - The Rank of Tree-Automatic Linear Orderings
30th Symposium on Theoretical Aspects of Computer Science, Kiel, March 2nd, 2013. [PDF] - Word Automaticity of Tree Automatic Ordinals Is Decidable
Turing Centenary Conference and 8th Conference on Computability in Europe, Cambridge (UK), June 21st, 2012. [PDF]
18th Annual Meeting "Logik in der Informatik", Ilmenau, November 4th, 2011. [PDF]
Workshop on Automata Theory and Its Applications, Singapore, September 12th, 2011. [PDF]
Publications
Submitted Papers
- Pumping for Ordinal-Automatic Structures (with Alexander Kartzow and Philipp Schlicht) [PDF]
Submitted to a journal.
Journal Articles
- Tree-Automatic Well-Founded Trees (with Alexander Kartzow, Jiamou Liu and Markus Lohrey) [PDF]
Logical Methods in Computer Science 9(2:10), 1–44 (2013). - Models for Quantitative Distributed Systems and Multi-valued Logics [PDF]
International Journal of Computer Mathematics, 90(6), 1223–1246 (2013). - A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices [PDF]
Fundamenta Informaticae 112(2–3), 171–191 (2011).
Conference Papers
- The monoid of queue actions (with Dietrich Kuske and Georg Zetzsche) [PDF, arXiv]
Mathematical Foundations of Computer Science (MFCS) 2014, 340–351, LNCS vol. 8634 (2014). - Ehrenfeucht-Fraïssé Games on Omega Terms (with Manfred Kufleitner) [PDF, arXiv]
Symposium on Theoretical Aspects of Computer Science (STACS) 2014, 374–385, LIPIcs vol. 25 (2014). - A Polychromatic Ramsey Theory for Ordinals (with Jiamou Liu) [PDF]
Mathematical Foundations of Computer Science (MFCS) 2013, 559–570, LNCS vol. 8087 (2013). - The Rank of Tree-Automatic Linear Orderings [PDF, arXiv]
Symposium on Theoretical Aspects of Computer Science (STACS) 2013, 586–597, LIPIcs vol. 20 (2013). - Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable [PDF, arXiv]
Computability in Europe (CiE) 2012, 314–323, LNCS vol. 7318 (2012). - Models for Quantitative Distributed Systems and Multi-valued Logics [PDF]
Language and Automata Theory and Applications (LATA) 2011, 310–311, LNCS vol. 6638 (2011). - A Kleene-Schützenberger Theorem for Trace Series over Bounded Lattices [PDF]
Non-Classical Models of Automata and Applications (NCMA) 2010, 99–111, books@ocg.at vol. 263 (2010).
Theses
- Models for Quantitative Distributed Systems and Multi-Valued Logics [PDF]
Master's thesis, Universität Leipzig (2010). - Quantenautomaten und das Cut-Point-Theorem für beschränkte erkennbare Potenzreihen [PDF]
Bachelor's thesis (in German), Universität Leipzig (2009).
Other
- Warum Computer Mathematiker niemals ersetzen können [Prezi]
Talk in a popular scientific way (in German), 25. Tage der Wissenschaften und Kultur, Erfurt, March 30th, 2012.
Teaching
Winter term 2014/15
- Tutorial Automaten, Sprachen und Komplexität (Automata, Languages and Complexity)
- Tutorial Berechenbarkeit und Komplexität (Computability and Complexity)
- Tutorial Grundlagen und Methoden der Kryprographie (Foundations and Methods of Cryptography)
Summer term 2014
- Tutorial Automatentheorie (Automata Theory)
- Tutorial Logische Strukturen (Logical Structures)
Winter term 2013/14
- Tutorial Automaten und Formale Sprachen (Automata and Formal Languages)
- Tutorial Grundlagen und Methoden der Kryptographie (Foundations and Methods of Cryptography)
Summer term 2013
- Tutorial Logik in der Informatik (Logic in Computer Science)
- Tutorial Logische Strukturen (Logical Structures)
Winter term 2012/13
- Tutorial Automaten und Formale Sprachen (Automata and Formal Languages)
- Tutorial Automatentheorie (Automata Theory)
Summer term 2012
- Tutorial Formale Sprachen und Komplexität (Formal Languages and Complexity)
- Tutorial Public-Key-Kryptographie (Public-Key Cryptography)
Winter term 2011/12
- Tutorial Automaten und Formale Sprachen (Automata and Formal Languages)
- Tutorial Verifikation unendlicher Systeme (Verification of Infinite State Systems)
Summer term 2011
- Tutorial Logik in der Informatik (Logic in Computer Science)
Winter term 2010/11
- Tutorial Automaten und Formale Sprachen (Automata and Formal Languages)
Summer term 2010
- Tutorial Lineare Algebra II (Linear Algebra II)
Winter term 2009/10
- Tutorial Lineare Algebra I (Linear Algebra I)
Winter term 2008/09
- Tutorial Diskrete Strukturen (Discrete Structures)
Document Actions