Courses taught at the University of Delaware, Newark, DE, USA
Spring 2009 CISC 303 -- Automata Theory (an introductory course for theoretical computer science)
Also in 2009 at the University of Delaware I got awarded the "Computer and Information Sciences Teaching Assistant Award" awarded for achievements in teaching.
The following tools I programmed because I couldn't find an appropriate tool online. I give no warranty on what actually happens when you use them, but feel free to send me bugs. Use a Java VM to execute.
Stopwatch. Very small tool to time talks. Counts down minutes and seconds from a specified time, resettable and resizable; counter will turn orange when at most five minutes are left, and red when at most one is left. Accurate to within about one tenth of a second.
LaTeXInOneCompiler. Small tool to compile a latex driver file to a single .tex file, recurses down through \include and \input commands and builds a new file called "<filename>InOne.tex". Use by dragging file on the program frame and then dropping. BibTeX inlining optional, %-comments will be removed. Optionally, you get cleaned output, which removes unused commands and useless newlines. This is great when your submission software gives you trouble with multiple source files. Note that this will not change any of your files.
LaTeXCompileLock. Another small tool to keep on latex'ing a file whenever it changes (i.e., whenever you saved changes in your editor). This is great when your pdf viewer automatically refreshes (I use it with SumatraPDF). It also recompiles when another .tex-file in the directory changes, in case you spread your sources over several files (looking for files also in subdirectories is optional). Use by dragging driver file on the program frame and then dropping. Stops when you close it. This jar requires Java 7.
Currently (2016-2019) I am working on my DFG grant "Eigene Stelle" on "The Structure of Algorithmic Learning".
June 2015 - present: Postdoctoral Researcher at the Hasso Plattner Institute, Potsdam, Germany
Our research focus is on theoretical computer science and algorithm engineering. We are equally interested in the mathematical foundations of algorithms and developing efficient algorithms in practice. A special focus is on random structures and methods.