Isbn: 9780521474658 - randomized algorithms hardback (cambridge international series on parallel computation) (36 resultados)

Condición: very_good.

Condición: acceptable.

Condición: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardcover. Condición: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes).

Condición: 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.…

Condición: Fine. 1997 printing, 496 pp., Hardcover, faint age-toning to top edge of pages else fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country.…

Gebundene Ausgabe. Condición: 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.

Hardcover-Großformat. Condición: 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.…

Condición: New.

Hardcover. Condición: Fine.

Condición: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

hardcover. Condición: new.

Hardcover. Condición: new. New Copy. Customer Service Guaranteed.

Condición: New.

Condición: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Condición: New.

Condición: As New. Unread book in perfect condition.

HRD. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Condición: 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. . . . . . …

Condición: New.

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Hardback. Condición: New. 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.…

Condición: 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. …

Condición: Akzeptabel. Zustand: Akzeptabel | 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. Condición: Brand New. 492 pages. 10.50x7.25x1.00 inches. In Stock.

Condición: Very Good.

Buch. Condición: Neu. Randomized Algorithms | Rajeev Motwani (u. a.) | Buch | Gebunden | Englisch | 2015 | Cambridge University Press | EAN 9780521474658 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu.

Buch. Condición: Neu. Neuware - 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.…

Hardback. Condición: New. 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.…