Correlation in Hard Distributions in Communication Complexity. - Ralph Bottesch; Dmitry Gavinsky; Hartmut Klauck (APPROX-RANDOM, 2015)

Equality, Revisited. - Ralph Bottesch; Dmitry Gavinsky; Hartmut Klauck (MFCS (2), 2015)

Relativization and Interactive Proof Systems in Parameterized Complexity Theory. - Ralph Bottesch (IPEC, 2017)

A Verified Efficient Implementation of the LLL Basis Reduction Algorithm. - Ralph Bottesch; Max W. Haslbeck; René Thiemann (LPAR, 2018)

On W[1]-Hardness as Evidence for Intractability. - Ralph Christian Bottesch (MFCS, 2018)

Verifying an Incremental Theory Solver for Linear Arithmetic in Isabelle/HOL. - Ralph Bottesch; Max W. Haslbeck; René Thiemann (FroCos, 2019)

A Hierarchy of Polynomial Kernels. - Jouke Witteveen; Ralph Bottesch; Leen Torenvliet (SOFSEM, 2019)

Farkas' Lemma and Motzkin's Transposition Theorem. - Ralph Bottesch; Max W. Haslbeck; René Thiemann (Arch. Formal Proofs, 2019)

Linear Inequalities. - Ralph Bottesch; Alban Reynaud; René Thiemann (Arch. Formal Proofs, 2019)

Verifying a Solver for Linear Mixed Integer Arithmetic in Isabelle/HOL. - Ralph Bottesch; Max W. Haslbeck; Alban Reynaud; René Thiemann (NFM, 2020)

Formalizing the LLL Basis Reduction Algorithm and the LLL Factorization Algorithm in Isabelle/HOL. - René Thiemann; Ralph Bottesch; Jose Divasón; Max W. Haslbeck; Sebastiaan J. C. Joosten; Akihisa Yamada 002 (J. Autom. Reason., 2020)

Two algorithms based on modular arithmetic: lattice basis reduction and Hermite normal form computation. - Ralph Bottesch; Jose Divasón; René Thiemann (Arch. Formal Proofs, 2021)