• Problem Class Algorithmen und Datenstrukturen
• SeminarAlgorithmen und Komplexität

Winter Semester 2015/2016

• SeminarAlgorithmen und Komplexität

Publications:

1. Dense Peelable Random Uniform Hypergraphs; with Martin Dietzfelbinger, to be presented at ESA 2019 {preprint}.
2. Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row,
   with Applications; with Martin Dietzfelbinger, to be presented at ESA 2019 {preprint}.
3. Constant-Time Retrieval with O(log m) Extra Bits; with Martin Dietzfelbinger, presented at STACS 2019 {doi}.
4. Dynamic Space Efficient Hashing; with Tobias Maier and Peter Sanders, {doi}.
5. Private Function Evaluation with Cards; with Alexander Koch, submitted. {preprint}.
6. A Subquadratic Algorithm for 3XOR; with Martin Dietzfelbinger and Philipp Schlag, MFCS 2018, {doi}.
7. Load Thresholds for Cuckoo Hashing with Double Hashing; with Michael Mitzenmacher and Konstantinos Panagiotou, presented at SWAT 2018, {doi}.
8. The Minimum Number of Cards in Practical Card-Based Protocols; with six coauthors, ASIACRYPT 2017 {doi}.
9. Load Thresholds for Cuckoo Hashing with Overlapping Blocks; presented at ICALP 2018. {preprint of full version}.
10. Foundations for Actively Secure Card-based Cryptography; with Alexander Koch, submitted. {preprint}.
11. Clumsy Packings with Polyominoes; with Maria Axenovich und Torsten Ueckerdt, Computational Geometry: Theory and Applications, 47 (1), (2014). {doi}.
12. Playing Weighted Tron on Trees with Daniel Hoske, Jonathan Rollin und Torsten Ueckerdt, Discrete Mathematics 338 (2015). {doi}
13. Boolean lattices: Ramsey properties and embeddings, with Maria Axenovich, {doi}.
14. Card-based Cryptographic Protocols Using a Minimal Number of Cards, with Alexander Koch und Kevin Härtel, Advances in Cryptology – ASIACRYPT 2015, Proceedings.

Talks:

1. Constant-Time Retrieval with Polynomially-small Slack, 76. Workshop über Algorithmen und Komplexität, Lutterstadt Wittenberg, September 2018.
2. Cuckoo Hashing with Overlapping Buckets, Dagstuhl Seminar 17181 – Theory and Applications of Hashing, May 2017.
3. Card-based Cryptographic Protocols Using a Minimal Number of Cards, 71. Theorietag der Fachgruppen Algorithmen und Komplexität, Dortmund, Germany, February 2016.

Theses:

1. Ramsey Variant of the 2-Dimension of Posets, Master's Thesis, Karlsruhe Institute of Technology, (October 2015).
2. Clumsy Packings in the Grid, Bachelor's Thesis, Karlsruhe Institute of Technology, (November 2012).