Parallel computation: Theory and algorithms (review) (Q1183834)

The paper can be seen as a brief review of some subareas of parallel processing. The first part deals with theoretical models of parallel computation and a description of the \(NC\) class, reducibility, \(P\)- completeness and randomized approach is given as well. The second part of the paper is devoted to techniques for designing parallel algorithms and to references to concrete parallel algorithms of linear algebra, integer arithmetic, series and polynomials, combinatorics, graph theory, computational geometry and sorting.