9780521474658 - Randomized Algorithms (Cambridge International Series on Parallel Computation) von Motwani, Rajeev; Raghavan, Prabhakar (9 Ergebnisse)

Zustand: good. Befriedigend/Good: Durchschnittlich erhaltenes Buch bzw. Schutzumschlag mit Gebrauchsspuren, aber vollständigen Seiten. / Describes the average WORN book or dust jacket that has all the pages present.

Gebundene Ausgabe; Zustand: Gut. 9. Auflage;. 476 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1025.

Zustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1100grams, ISBN:9780521474658.

Hardcover-Großformat. Zustand: Gut. 476 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Einbandkanten sind leicht bestoßen. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 1170.

Zustand: New. pp. 496 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam.

Zustand: New. 1995. 1st Edition. Hardcover. This book presents basic tools from probability theory used in algorithmic applications, with concrete examples. Num Pages: 496 pages, Illustrations. BIC Classification: PBWH; UMB. Category: (P) Professional & Vocational. Dimension: 261 x 183 x 28. Weight in Grams: 1070. 492 pages, Illustrations. Presents basic tools from probability theory used in algorithmic applications, with concrete examples. Cateogry: (P) Professional & Vocational. BIC Classification: PBWH; UMB. Dimension: 261 x 183 x 28. Weight: 1032. . . . . . Books ship from the US and Ireland.

Zustand: Gut. Zustand: Gut | Seiten: 496 | Sprache: Englisch | Produktart: Bücher | For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This first book on the subject should prove invaluable as a reference for researchers and professional programmers, as well as for students.

Hardcover. Zustand: Brand New. 492 pages. 10.50x7.25x1.00 inches. In Stock.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.