Parallel and sequential algorithms can be applied to a variety of fields and domains, such as scientific computing, artificial intelligence, cryptography, and searching and sorting.

Merge Sort and Quick Sort are two efficient sorting algorithms commonly used for sorting large datasets. This program provides implementations of Merge Sort and Quick Sort in both sequential and ...

Parallel sorting algorithms can be more efficient than their sequential counterparts, especially for sorting large datasets, as they can take advantage of the parallel processing power of modern ...

Programming Parallel Algorithms. Guy E. Blelloch. Communications of the ACM, 39(3), March, 1996. In the past 20 years there has been tremendous progress in developing and analyzing parallel algorithms ...

Abstract: We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (aka mixed packing and covering problems). For explicitly given problems ...

The parallel implementation leverages multi-threading to divide the work among multiple processors. It follows a strategy based on the Bowyer-Watson algorithm, with enhancements for parallel execution ...

Overview. 15-210 aims to teach methods for designing, analyzing, and programming sequential and parallel algorithms and data structures. The emphasis is on teaching fundamental concepts applicable ...

Given a data sequence, sequential pattern mining, which finds frequent sequence patterns among them, is an important data mining problem. However, in the existing sequential pattern mining, only the ...

Sequential Feature Selection Algorithms Sequential feature selection algorithms are basically part of the wrapper methods where it adds and removes features from the dataset sequentially. Sometimes it ...

V. P. Gergel and Y. D. Sergeyev, “Sequential and Parallel Global Optimization Algorithms Using Derivatives,” Computer & Mathematics with Applications, Vol. 37, No. 4-5, 1999, ... In this paper, we ...