Address

Mathematische Grundlagen der Informatik
RWTH Aachen
D-52056 Aachen

Fax:	+49-241-80-22215
Email:	schalthoefer [AT] logic.rwth-aachen.de

PGP Fingerprint: CCAF AD79 4D0E 10E1 7151 0045 957B ED62 AEE5 FA4D

Research

I worked as a research assistant at the Mathematical Foundations of Computer Science group from February 2014 to January 2019, and obtained my PhD in January 2019.
My research interests include:

• Descriptive Complexity Theory
• Logics for Logspace
• Choiceless Polynomial Time

Awards

"Friedrich Wilhelm Preis" for my Master's thesis "Computing on Abstract Structures with Logical Interpretations"

Nominated for the Computer Science Department's Teaching Award for the course "Mathematical Logic"

Activities

• Member of the Examination Board (Prüfungsausschuss) and the Teaching Committee (Kommission für Lehre) of the Department of Computer Science
• Organiser of the first joint conference of student unions for the subjects mathematics, physics and computer science (summer term 2015)
• Instructor at "Girl's Day"
• Mentor for international students as part of the International Office's BeBuddy programme

Teaching

• Seminar Logic, Complexity, Games
  • Guarded Logics and Automata
  • Algorithmic Meta-Theorems in Logic
  • Logics of Dependence and Independence
  • Fixed-point Logics
  • Computational Social Choice
  • Definability and Complexity
• Mathematical Logic ( Summer 2018, Summer 2017, Summer 2016, Summer 2015, Summer 2014 )
• Logic and Games (Winter 2015)
• Quantum Computing (Summer 2015)

Recent Publications

• E. Grädel and S. Schalthöfer. Choiceless Logarithmic Space. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) (P. Rossmanith, P. Heggernes, and J. Katoen, Eds.), vol. 138 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 31:1–31:15, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2019.
• S. Schalthöfer. Choiceless computation and logic. PhD thesis, RWTH Aachen University, 2019.
• W. Pakusa, S. Schalthöfer, and E. Selman. Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016) (J. Talbot and L. Regnier, Eds.), vol. 62 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 19:1–19:17, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2016.
• E. Grädel, Ł. Kaiser, W. Pakusa, and S. Schalthöfer. Characterising Choiceless Polynomial Time with First-Order Interpretations. In Proceedings of 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2015.
• S. Schalthöfer. Computing on Abstract Structures with Logical Interpretations. Master thesis, RWTH Aachen University, 2013.

All publications

Selected Talks

• Choiceless Computation and Logic, PhD defence.
• Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time, held at CSL 2016 in Marseille, France.
• Characterising Choiceless Polynomial Time with First-Order Interpretations, held at LICS 2015 in Kyoto, Japan.