Handbook Randomized Computing (24 results)
Handbook on Randomized Computing
Rajasekaran, Sanguthevar (EDT); Paradalos, Panow M. (EDT); Reif, J. H. (EDT); Rolim, Jose (EDT)
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 65.71
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: Antiquariat Bookfarm, Löbnitz, GermanyAntiquariat Bookfarm
Contact seller5-star sellerCondition: Used - Very good
US$ 23.59
US$ 46.03 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Gut. 456 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780792369578 Sprache: Englisch Gewicht in Gramm: 990.
- Hardcover
Seller: Antiquariat Bookfarm, Löbnitz, GermanyAntiquariat Bookfarm
Contact seller5-star sellerCondition: Used - Very good
US$ 23.59
US$ 46.03 shippingShips from Germany to U.S.A.Quantity: 2 available
Condition: Gut. XXIV S., S. 457 - 941, XXV - L S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780792369585 Sprache: Englisch Gewicht in Gramm: 990.
Handbook on Randomized Computing
Rajasekaran, Sanguthevar (EDT); Paradalos, Panow M. (EDT); Reif, J. H. (EDT); Rolim, Jose (EDT)
- Hardcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 68.68
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 70.25
US$ 16.09 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
Handbook on Randomized Computing
Rajasekaran, Sanguthevar (EDT); Paradalos, Panow M. (EDT); Reif, J. H. (EDT); Rolim, Jose (EDT)
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 70.24
US$ 20.14 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Handbook on Randomized Computing
Rajasekaran, Sanguthevar (EDT); Paradalos, Panow M. (EDT); Reif, J. H. (EDT); Rolim, Jose (EDT)
- Hardcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 77.33
US$ 20.14 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
- Hardcover
- First Edition
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
US$ 91.60
US$ 10.93 shippingShips from Ireland to U.S.A.Quantity: 15 available
Condition: New. 2001. 2001st Edition. hardcover. . . . . .
- Softcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 105.22
US$ 3.99 shippingShips within U.S.A.Quantity: 4 available
Condition: New. 969.
Handbook of Randomized Computing, 2 Teile
Rajasekaran, Sanguthevar|Pardalos, Panos M.|Reif, J. H.|Rolim, José
- Hardcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 57.77
US$ 56.37 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New.
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
US$ 107.77
US$ 10.50 shippingShips within U.S.A.Quantity: 15 available
Condition: New. 2001. 2001st Edition. hardcover. . . . . . Books ship from the US and Ireland.
- Hardcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 97.48
US$ 26.85 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Hardcover. Condition: Brand New. 1st edition. 1048 pages. 9.75x6.50x2.50 inches. In Stock.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 59.73
US$ 80.55 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: 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: p…reigu.
- Hardcover
Seller: Books Puddle, New York, NY, U.S.A.Books Puddle
Contact seller4-star sellerCondition: New
US$ 192.25
US$ 3.99 shippingShips within U.S.A.Quantity: 1 available
Condition: New. pp. 941.
- Hardcover
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 198.22
US$ 8.73 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New. pp. 941.
- Hardcover
- International Edition
Seller: UK BOOKS STORE, London, LONDO, United KingdomUK BOOKS STORE
Contact seller5-star sellerInternational EditionCondition: Used
US$ 280.02
Free ShippingShips from United Kingdom to U.S.A.Quantity: 1 available
Condition: New Books. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 6-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested… if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
- Hardcover
- Print on Demand
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
US$ 68.36
Free ShippingShips within U.S.A.Quantity: 10 available
Condition: Brand New. New. Delivery takes 20-25 days. Print on Demand.
- Softcover
- Print on Demand
Seller: Basi6 International, Irving, TX, U.S.A.Basi6 International
Contact seller5-star sellerCondition: New
US$ 68.36
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: Brand New. New. US edition. Print on demand title. Delivery takes 20-25 days. Excellent Customer Service.
- Hardcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 63.39
US$ 26.47 shippingShips from Germany to U.S.A.Quantity: 2 available
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 1052 pp. Englisch.
- Softcover
- Print on Demand
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermanyBuchWeltWeit Ludwig Meier e.K.
Contact seller5-star sellerCondition: New
US$ 63.39
US$ 26.47 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 s…olving 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. 1052 pp. Englisch.
- Softcover
- Print on Demand
Seller: Majestic Books, Hounslow, United KingdomMajestic Books
Contact seller4-star sellerCondition: New
US$ 100.72
US$ 8.73 shippingShips from United Kingdom to U.S.A.Quantity: 4 available
Condition: New. Print on Demand 969.
- Softcover
- Print on Demand
Seller: Biblios, frankfurt am main, HESSE, GermanyBiblios
Contact seller4-star sellerCondition: New
US$ 109.81
US$ 11.45 shippingShips from Germany to U.S.A.Quantity: 4 available
Condition: New. PRINT ON DEMAND 969.
- Hardcover
- Print on Demand
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germanybuchversandmimpf2000
Contact seller5-star sellerCondition: New
US$ 63.39
US$ 69.04 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 vari…ous 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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 1052 pp. Englisch.
- Hardcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 63.39
US$ 79.96 shippingShips from Germany to U.S.A.Quantity: 1 available
Buch. Condition: Neu. nach der Bestellung gedruckt 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 vario…us 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.
