scientific article; zbMATH DE number 4039291

From MaRDI portal
Publication:3777451





[For the entire collection see Zbl 0599.00013.] This well written paper starts with a survey of parallel computer models and architectures followed by a brief overview of the complexity theory for sequential and parallel computation. The author then focusses on parallel algorithms for combinatorial problems like sorting, merging, graph-theoretic problems, and combinatorial optimization problems. Most algorithms are only briefly mentioned, but a few are given in detail. The paper may be recommended as a starting point to someone new to the field of parallel computation and as a fairly complete guide to the relevant literature.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777451)