Much Ado About Two

Sascha Böhme 🌐

November 6, 2007

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This article is an Isabelle formalisation of a paper with the same title. In a similar way as Knuth's 0-1-principle for sorting algorithms, that paper develops a 0-1-2-principle for parallel prefix computations.


BSD License


Session MuchAdoAboutTwo