J h reif (61 risultati)

paperback. Condizione: Good. Springer-Verlag, NY 1988, 8vo. paperbk. 476pp. crease to cover, ow F $.

paperback. Condizione: Very Good. Springer-Verlag, NY 1988, 8vo. paperbk. 476pp. F $.

Hardcover. First Printing. Hardcover; no dustjacket. This is an Ex-Corporate-Library copy, with all the typical markings (from a Cray Research technical library). A bit of very light surface rubbing to the boards. Library labels on the front board and spine tail. Else binding clean. Tiny nick at the fore-edge of a couple of pages. There is a pocket on the rear pastedown, Cray inkstamps on the flyleaves, and a date inkstamp on the title page; else the pages are clean, with no additional library markings. This is a heavy book; Priority and/or International may require shipping over and above standard costs. ; 29A; 9" x 7"; 1011 pages.…

Condizione: Good. 8vo. 248 pp. Very good in wraps. Front cover sticker reads "PRINTERS ERROR -Instead of Vol. XXXV, No. 2, please read Vol. XXXIV, No. 2." Front and back cover edges faded. Back cover scuffed along spine and upper edge.

Condizione: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service.

Condizione: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Condizione: good. This book is in Good condition. There may be some notes and highligting but otherwise the book is in overall good condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Hardcover. Condizione: Very Good. Berlin: Walter De Gruyter, 1987. xix, 817 pp. 24.5 x 17.5 cm. Coated paper covered boards printed black with blue and orange lettering to cover and spine; text in German. Light bumping to spine ends and corners of boards. Some scuffing and soil to edges of text block. Very light age toning to endpapers. Interior is clean and unmarked. Binding sound. Due to the weight of this book, additional shipping may be required for international orders. . Hard Cover. Very Good.…

Condizione: New.

Condizione: New. In English.

Condizione: New.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: New. Satisfaction Guaranteed or your money back.

Condizione: New. 2001. 2001st Edition. hardcover. . . . . .

Condizione: New. 969.

Bundle. Condizione: New.

Condizione: New. 2001. 2001st Edition. hardcover. . . . . . Books ship from the US and Ireland.

Hardcover. Condizione: Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Taschenbuch. Condizione: Neu. Handbook of Randomized Computing | Volume I/II | Sanguthevar Rajasekaran (u. a.) | Taschenbuch | l | Englisch | 2013 | Springer Us | EAN 9781461348863 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often is a collection of articles written by renowned experts in practice. This book in the area of randomized parallel computing. A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at the O(n logn) average run time for quicksort is that each input permutation is equally likely. Clearly, any average case analysis is only as good as how valid the assumption made on the input space is. Randomized algorithms achieve superior performances without making any assumptions on the inputs by making coin flips within the algorithm. Any analysis done of randomized algorithms will be valid for all possible inputs.…

Couverture rigide. Condizione: Très bon. Exemplaire de bibliothèque.

Condizione: New.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.