Tobias Nipkow

 

Website: http://www21.in.tum.de/~nipkow

 

Entries

2020

January 16: Verified Approximation Algorithms

January 13: Closest Pair of Points Algorithms

 

2019

June 25: Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra

June 25: Priority Search Trees

 

2018

May 27: Optimal Binary Search Trees

May 22: Monadification, Memoization and Dynamic Programming

March 13: Weight-Balanced Trees

February 26: Hoare Logics for Time Bounds

February 6: Treaps

 

2017

August 20: Root-Balanced Tree

June 21: Propositional Proof Systems

 

2016

November 23: Abstract Interpretation of Annotated Commands

July 14: Pairing Heap

February 17: Analysis of List Update Algorithms

 

2015

June 7: Parameterized Dynamic Tables

March 30: Trie

 

2014

October 9: A Verified Compiler for Probability Density Functions

September 4: Priority Queues Based on Braun Trees

August 13: Skew Heap

August 12: Splay Tree

July 7: Amortized Complexity Verified

June 12: Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions

June 8: Boolean Expression Checkers

May 28: A Fully Verified Executable LTL Model Checker

January 30: Unified Decision Procedures for Regular Expression Equivalence

 

2012

January 3: Markov Models

 

2011

August 19: Gauss-Jordan Elimination for Matrices Represented as Functions

 

2010

December 17: Hall's Marriage Theorem

May 12: Regular Sets and Expressions

February 20: List Index

 

2008

November 7: Fun With Tilings

September 1: Arrow and Gibbard-Satterthwaite

August 26: Fun With Functions

February 18: Normalization by Evaluation

January 11: Quantifier Elimination for Linear Arithmetic

 

2006

September 9: Hotel Key Card System

August 8: Abstract Hoare Logics

May 22: Flyspeck I: Tame Graphs

 

2005

June 1: Jinja is not Java

 

2004

July 9: Compiling Exceptions Correctly

March 30: Functional Automata

March 19: Mini ML

March 19: AVL Trees