EasyChair Smart SlideDocs/Log in
Author: Tobias Nipkow

This page shows all presentations of this author published in EasyChair Smart Slide.

Verification of NP-Hardness for Exact Lattice Problems

Verification of NP-Hardness for Exact Lattice Problems

Katharina Kreuzer and Tobias Nipkow

A Verified Implementation of B-Trees in Isabelle/HOL

A Verified Implementation of B-Trees in Isabelle/HOL

Niels Mündler and Tobias Nipkow

Verified Analysis of Random Binary Tree Structures

Verified Analysis of Random Binary Tree Structures

Manuel Eberl, Max W. Haslbeck and Tobias Nipkow

Verified Memoization and Dynamic Programming

Verified Memoization and Dynamic Programming

Simon Wimmer, Shuwei Hu and Tobias Nipkow

Presentations in this collection: 4
Copyright © 2002 – 2024 EasyChair