Publikationen

Svenja Schalthöfer

2019

  • 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.             

2016

  • 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.             

2015

  • 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.             

2013

  • S. Schalthöfer. Computing on Abstract Structures with Logical Interpretations. Master thesis, RWTH Aachen University, 2013.