The automated proof of a trace transformation for a bitonic sort

The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way decomposition instead of a two-way decomposition. It is proven that Batcher's bitonic ...

An O(n) algorithm to sort n²elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts the n²elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm ...

Cut-elimination is the most prominent form of proof transformation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-...