Much ado about two (pearl): a pearl on parallel prefix computation

This pearl develops a statement about parallel prefix computation in the spirit of Knuth's 0-1-Principle for oblivious sorting algorithms. It turns out that 0-1 is not quite enough here. The perfect hammer for the nails we are going to drive in is relational parametricity.

• Type: Conference
• Year: 2008
• Where: POPL
• Authors: Janis Voigtländer
• Keywords: Oblivious Sorting Algorithms, Parallel Prefix Computation, POPL 2008, Programming Languages