Efficient Parallel Algorithms / Alan GIBBONS

Public ISBD Titre : Efficient Parallel Algorithms Type de document : texte imprimé Auteurs : Alan GIBBONS, Auteur ; Wojciech RYTTER, Auteur Editeur : Cambridge : Cambridge University Press Année de publication : 1988 Importance : 259 P. Présentation : ill.; Format : 17cm x 24,5cm ISBN/ISSN/EAN : 978-0-521-34585-9 Langues : Anglais (eng) Langues originales : Anglais (eng) Catégories : Informatique:05 Informatique de Gestion Mots-clés : graph algorithms  expression evaluation  parallel recognition and parsing of context-free languages . Résumé : 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. Efficient Parallel Algorithms [texte imprimé] / Alan GIBBONS, Auteur ; Wojciech RYTTER, Auteur . - Cambridge : Cambridge University Press, 1988 . - 259 P. : ill.; ; 17cm x 24,5cm. ISBN : 978-0-521-34585-9 Langues : Anglais (eng) Langues originales : Anglais (eng) Catégories : Informatique:05 Informatique de Gestion Mots-clés : graph algorithms  expression evaluation  parallel recognition and parsing of context-free languages . Résumé : 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.

Réservation

Réserver ce document

Exemplaires(1)

Code-barres	numéro d'inventaire	Cote	Support	Localisation	Section	Disponibilité
76694	08-07-0002	Livre	Bibliothèque IGCMO	Documentaires	Disponible

---

1 (1 - 1 / 1) Par page : 25 50 100 200