Modern science and engineering is driven by massively large data sets and its advance
heavily relies on massively parallel computing platforms such as Spark, MapReduce, and …

The Longest Increasing Subsequence Problem (LIS for short) is a good illustration of
dynamic programming and has interested many scientists [2, 8, 10, 15, 18, 19, 20]. In July …

An alternative approach to compact deformable mirrors for adaptive optics is developed. A
prototype of a two inch mirror composed of a thin polymer membrane covered with a matrix …

Comparison of the DNA sequences and genes of two genomes can be useful to investigate
the common functionalities of the corresponding organisms and get a better understanding …

In this paper, we consider a parallel algorithm for the patience sorting. The problem is not
known to be in the class NC or P-complete. We propose two algorithms for the patience …

In this paper, we consider parallel algorithm for the longest increasing subsequence
problem. Although this problem is primitive combinatorial optimization problem, this is not …

In this paper, we consider parallel algorithms for the patience sorting and the longest
increasing subsequence. These two problems are related each other and are not known to …

In this paper, we give a parallel algorithm for the longest increasing subsequence problem
on a LARPBS, one of the recently proposed parallel model based on optical bus. For a …

Nous avons tous l'intuition qu'un travail peut être réalisé en beaucoup moins de temps s' il
est réparti entre plusieurs personnes ou sur plusieurs machines. Cette notion se nomme le …

In parallel computational theory, the class NC and P-completeness are known as primary
measures of parallel complexity. It is believed that problems in the class NC admit …