Dekorationsartikel gehören nicht zum Leistungsumfang.
Efficient Parallel Algorithms
Taschenbuch von Alan Gibbons (u. a.)
Sprache: Englisch

67,60 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:
Beschreibung
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.
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.
Inhaltsverzeichnis
Preface; 1. Introduction; 2. Graph algorithms; 3. Expression evaluation; 4. Parallel recognition and parsing of context-free languages; 5. Fast parallel sorting; 6. Parallel string matching; 7. P-completeness: hardly parallelisable problems; Index.
Details
Erscheinungsjahr: 1990
Fachbereich: Programmiersprachen
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 268
ISBN-13: 9780521388412
ISBN-10: 0521388414
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Gibbons, Alan
Rytter, Wojciech
Hersteller: Cambridge University Press
Maße: 235 x 191 x 15 mm
Von/Mit: Alan Gibbons (u. a.)
Erscheinungsdatum: 01.01.1990
Gewicht: 0,507 kg
preigu-id: 115528136
Inhaltsverzeichnis
Preface; 1. Introduction; 2. Graph algorithms; 3. Expression evaluation; 4. Parallel recognition and parsing of context-free languages; 5. Fast parallel sorting; 6. Parallel string matching; 7. P-completeness: hardly parallelisable problems; Index.
Details
Erscheinungsjahr: 1990
Fachbereich: Programmiersprachen
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 268
ISBN-13: 9780521388412
ISBN-10: 0521388414
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Gibbons, Alan
Rytter, Wojciech
Hersteller: Cambridge University Press
Maße: 235 x 191 x 15 mm
Von/Mit: Alan Gibbons (u. a.)
Erscheinungsdatum: 01.01.1990
Gewicht: 0,507 kg
preigu-id: 115528136
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte