2018

1. A Formalization of the LLL Basis Reduction Algorithm

   Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2. A Perron-Frobenius Theorem for Jordan Blocks for Complexity Proving

   WST 2018 16th International Workshop on Termination

3. Efficient certification of complexity proofs formalizing the Perron-Frobenius theorem (invited talk paper)

   CPP 2018 - Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, Co-located with POPL 2018