Computational Logic Department of Computer Science University of Innsbruck
Ralph Bottesch, Ph.D. 
Department of Computer Science
Computational Logic Group
University of Innsbruck
Techniker Str. 21a
A-6020 Innsbruck
Austria

E-Mail: ralph.bottesch__AT__uibk.ac.at
Phone: +43/512/507 53234
Room: 3M09, 2. OG

Research

Currently I work as a post-doctoral researcher as part of the FWF project Certifying Termination and Complexity Proofs of Programs. Previously I was a post-doc at Centrum Wiskunde & Informatica (CWI), Amsterdam.

I am interested in various subfields of computational complexity theory (including parameterized complexity, quantum complexity, and communication complexity).

Publications

Conference publications

  1. J. Witteveen, R.C. Bottesch, and L. Torenvliet.
    A Hierarchy of Polynomial Kernels
    In Proceedings of the 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2019), LNCS, Vol. 11376, pp. 504--518, 2019. doi: 10.1007/978-3-030-10801-4

  2. R.C. Bottesch, M.W. Haslbeck, and R.A. Thiemann.
    A Verified Efficient Implementation of the LLL Basis Reduction Algorithm
    In Proceedings of the 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2018), Epic Series in Computing, Vol. 57, pp. 164--180, 2018.

  3. R.C. Bottesch.
    On W[1]-Hardness as Evidence for Intractability
    In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Leibniz International Proceedings in Informatics (LIPIcs), pages 73:1--73:15, 2018. doi: 10.4230/LIPIcs.MFCS.2018.73

  4. R.C. Bottesch.
    Relativization and Interactive Proof Systems in Parameterized Complexity Theory
    In Proceedings of the 12th International Symposium on Parameterized and Exact Computation (IPEC 2017), Leibniz International Proceedings in Informatics (LIPIcs), pages 9:1-9:12, 2018. doi: 10.4230/LIPIcs.IPEC.2017.9

  5. R.C. Bottesch, D. Gavinsky, and H. Klauck.
    Equality, Revisited
    In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015) .

  6. R.C. Bottesch, D. Gavinsky, and H. Klauck.
    Correlation in Hard Distributions in Communication Complexity
    In Proceedings of the 19th International Workshop on Randomization and Computation (RANDOM 2015).