This paper aims to investigate the security problem of nonlinear cyber-physical systems
(CPSs), which poses a challenge to handle compared with linear CPSs. A series of …

QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's
Quicksort algorithm with X, where X can be chosen from a wider range of other known …

In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort.
Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm if X …

In this paper we improve large-scale disk-based model checking by shifting complex
numerical operations to the graphic card, enjoying that during the last decade graphics …

The two most prominent solutions for the sorting problem are Quicksort and Mergesort.
While Quicksort is very fast on average, Mergesort additionally gives worst-case guarantees …

QuickHeapsort is a combination of Quicksort and Heapsort. We show that the expected
number of comparisons for QuickHeapsort is always better than for Quicksort if a usual …

Quicksort is one of the most popular sorting algorithms, it is based on a divide-and-conquer
technique and has a wide acceptance as the fastest general-purpose sorting technique …

In this paper we present Fast-Insertion-Sort, a sequence of efficient external variants of the
well known Insertion-Sort algorithm which achieve by nesting an O (n1+ ε) worst-case time …

A new variant of HEAPSORT is presented in this paper. The algorithm is not an internal
sorting algorithm in the strong sense, since extra storage for n integers is necessary. The …

The article discusses the heapsort algorithm based on creating a nongrowing heap from an
array of data and further operations with it. Its efficiency is compared with other sorting …