Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...
Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper...
Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, th...
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
Michael Kaufmann, Sanguthevar Rajasekaran, Jop F. ...
This work explores a statistical basis for a process often described in computer vision: image segmentation by region merging following a particular order in the choice of regions...
— Data-centric storage [6] is a very important concept for sensor networks that supports efficient in-network data query and processing. Previous approaches are mostly using a h...