We provide a comprehensive presentation of algorithms, data structures, and
implementation techniques for high-performance sparse multivariate polynomial arithmetic …

Every permutation of {1, 2,…, N} can be written as the product of two involutions. As a
consequence, any permutation of the elements of an array can be performed in-place using …

We present parallel algorithms to efficiently permute a sorted array into the level-order
binary search tree (BST), level-order B-tree (B-tree), and van Emde Boas (vEB) layouts in …

The huge data volumes, big data, and the emergence of new parallel architectures lead to
revisiting classic computer science topics. The motivation of the proposed work for revisiting …

We reconsider a recently published algorithm (Dalkilic et al.) for merging lists by way of the
perfect shuffle. The original publication gave only experimental results which, although …

Abstract Graphics Processing Units (GPUs) have emerged as a highly attractive architecture
for general-purpose computing due to their numerous programmable cores, low-latency …

This work proposes duelmerge, a stable merging algorithm that is asymptotically optimal in
the number of comparisons and performs O (n log 2 (n)) moves. Unlike other partition-based …

The huge data volumes and the emergence of new parallel architectures, eg multicore
CPUs lead to revisiting classic computer science topics such as in-place sequence rotation …

In this paper, we present several improvements in the parallelization of the in-place merge
algorithm, which merges two contiguous sorted arrays into one with an O (T) space …

Abstract Two-dimensional (2D) perfect shuffle transform (PST) plays an important role in
optical communication and optical information processing due to very high space-bandwidth …