Dr. Kristian Hinnenthal

Former
Phone:
+49 5251 60-6730
Fax (External):
+49 5251 60-6697
E-mail:
Office:
F2.323
Web:
Visitor:
Fürstenallee 11
33102 Paderborn
33102 Paderborn
Publications
Latest Publications
Time-Optimal Construction of Overlays
T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, Distributed Computing (2023).
Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter
K. Hinnenthal, Models and Algorithms for Hybrid Networks and Hybrid Programmable Matter, 2021.
Time-Optimal Construction of Overlays
T. Götte, K. Hinnenthal, C. Scheideler, J. Werthmann, in: K. Censor-Hillel (Ed.), Proc. of the 40th ACM Symposium on Principles of Distributed Computing (PODC ’21), ACM, New York, n.d.
Shortest Paths in a Hybrid Network Model
J. Augustine, K. Hinnenthal, F. Kuhn, C. Scheideler, P. Schneider, in: S. Chawla (Ed.), Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020, SIAM, 2020, pp. 1280–1299.
Forming tile shapes with simple robots
Show all publications
R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T. Strothmann, Nat. Comput. 19 (2020) 375–390.
Teaching
- WS12/13: Tutorials for "Modellierung"
- SS13: Tutorials for "Grundlagen der Programmiersprachen"
- WS13/14: Tutorials for "Modellierung"
- WS14/15: Tutorials for "Modellierung"
- WS16/17: Tutorials for "Fundamental Algorithms"
- WS17/18: Tutorials for "Fundamental Algorithms"
- SS18: Tutorials for "Digitaltechnik"
- WS18/19: Tutorials for "Berechenbarkeit und Komplexität"
- SS19-WS19/20: Project group "OverHyPeD"
- SS20: Tutorials for "Datenstrukturen und Algorithmen"
- WS20/21: Tutorials for "Grundlegende Algorithmen"
Vorträge
- "Shape Recognition by a Finite Automaton Robot", EuroCG 2018, Berlin
- "Forming Tile Shapes with Simple Robots", BDA 2018, London
- "O-Hull Formation for Programmable Matter", EuroCG 2018, Utrecht
- "Fast Shape Formation with Hybrid Programmable Matter", BDA 2019, Toronto