Evolving from having had done the Ninja Warriors sports myself, I had started coaching children and adults coming to our gym for the first time.

I worked with pretty different populations, ranging from 10 up to 40 yrs. in age, from 3 up to 20 in group size, and for over 100 coached hours in total. My speciality was in children’s birthdays.

Our gym closed in July 2021 for financial reasons.

Selection of specializing courses in master and bachelor taken so far:

• Formal Methods / Theoretical CS

  • Research project on “Structure-Preserving Diagram Operators in Knowledge Representation Systems”, advised by Florian Rabe: delivered talk and accepted paper at the WADT 2020 conference (to be appearing in Springer LNCS), talk at LFMTP, final project report
  • Bachelor thesis on Refactoring Theory Graphs in Knowledge Representation Systems
  • “Knowledge Representation and Processing”: paradigms and challenges for storing and processing ontological, deductive, computational, tabulating, and narrative knowledge. By extrapolating homework assignments, I developed a Coq formalization of a basic ontology language and (reinvented) a Coq formalization of lambda calculus using de Bruijn indices.
  • “Practical Semantics of Programming Languages”: intro to the Coq proof assistant up to formalizing a typed imperative language, a Hoare logic, small and big step operational semantics (course was based on the Software Foundations series).
  • “Logic-based Knowledge Representation for Mathematic/Technical Knowledge”: representing math and ZFC in the MMT system by employing Edinburgh Logical Framework LF and the mechanisms of theory graphs induced by MMT on top of that.
  • “Logic-based Speech Representation”: using logic to give semantics to (controlled) natural language. The lecture covered a runway through various suitable logics incl. higher-order logic and discourse representation theory, while the lab used the Grammatical Framework to parse natural language and to transform it to sentences over a logic.
  • “Algebra of Programming” incl. F-algebras and initial algebras

• Cryptography

  • “Introduction to Algorithmic Cryptography”
  • “Privacy-Preserving Cryptocurrencies”: research-near runway through Bitcoin alternatives with more privacy, incl. ring-confidential transactions (used in Monero) and ZeroCash (used in Zcash, both of which heavily employ zero-knowledge proofs.
  • “Cryptocurrencies”: mechanisms of Bitcoin and Altcoins, incl. lab project in Python to implement and compare algorithms for deanonymization (linking attacks) on a blockchain

• Math minor

  • Topology
  • Functional Analysis
  • Complex Analysis
  • Elementary Number Theory

• Misc.

  • “Virtual Machines”: classification of virtualization approaches and hands-on exercises with building JIT & AOT compiler for Atmel AVR targetting Intel x64.
  • Concurrent Systems (concurrency on systems level)

This course is taught for first-year students of CS and involves basics of propositional logic, elementary logic gates up to multiplexers, multipliers, dividers, algorithmic minimization of circuits, and VHDL to describe hardware.

As a TA, I was responsible to deliver one blackboard exercise lesson per week discussing lecture material and problem sets. On top of that, I voluntarily also

• discussed additional problem sets incl. old exams
• answered questions via e-mail/online forum
• created a website with longer expository information (e.g. on division algorithms) and self-made interactive educational tools:
  • Karnaugh maps to highlight symmetries and compute minimal disjunctive/conjunctive forms of boolean formulae
  • an decimal number ↔ IEEE 754 bit representation converter