efficient parallel algorithms von gibbons alan (9 Ergebnisse)

Paperback. Zustand: Very Good. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged.

Zustand: Gut. Auflage: Reprint. 268 Seiten ex Library Book aus einer wissenschafltichen Bibliothek Sprache: Englisch Gewicht in Gramm: 469 23,2 x 19,0 x 1,4 cm, Taschenbuch.

Ed. Cambridge University Press - 1988, in-8, reliure d'édireur, 259 pages Bon état.

Hardback. Zustand: Very Good. First Edition. Hardback. No Dustjacket. 8vo. Illustrated laminated boards. Issued without dustjacket. Diagrams. ISBN: 0521345855 Pages: 267 Covers very slightly bumped otherwise VG+.

Zustand: New. In.

Zustand: New.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 268 | Sprache: Englisch | Produktart: Bücher | This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems. The authors present regularly-used techniques and a range of algorithms including some of the more celebrated ones. Nonspecialists considering entering the field of parallel algorithms, as well as advanced undergraduate or postgraduate students of computer science and mathematics will find this book helpful.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This largely self-contained text is an introduction to the field of efficient parallel algorithms and to the techniques for efficient parallelism, that presumes no special knowledge of parallel computers or particular mathematics. The book emphasizes designing algorithms within the timeless and abstracted context of a high-level programming language rather than within highly specific computer architectures. This is an approach that concentrates on the essence of algorithmic theory, determining and taking advantage of the inherently parallel nature of certain types of problems. The authors present regularly-used techniques and a range of algorithms including some of the more celebrated ones. Nonspecialists considering entering the field of parallel algorithms, as well as advanced undergraduate or postgraduate students of computer science and mathematics will find this book helpful.

Hardcover. 1. Edition. 259 p. Good condition. The reading pages are clean and unmarked. Slight signs of storage and use. Retired library copy with corresponding marking. Otherwise a good copy. Sprache: Englisch Gewicht in Gramm: 1000.