Order Total (1 Item Items):
Shipping Destination:
Design Analysis Randomized Algorithms by Hromkovic (23 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (23)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (18)
- As New, Fine or Near Fine (5)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (16)
- Not Print on Demand (16)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Condition: New. Zámecniková, I. (illustrator).
-
Condition: As New. Zámecniková, I. (illustrator). Unread book in perfect condition.
-
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 45.35
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. Zámecniková, I. (illustrator). In English.
-
Design and Analysis of Randomized Algorithms : Introduction to Design Paradigms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Zámecniková, I. (illustrator).
-
Design and Analysis of Randomized Algorithms : Introduction to Design Paradigms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Zámecniková, I. (illustrator). Unread book in perfect condition.
-
Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 60.59
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. Zámecniková, I. (illustrator). In.
-
Condition: New. Zámecniková, I. (illustrator).
-
Design And Analysis of Randomized Algorithms : Introduction to Design Paradigms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Zámecniková, I. (illustrator).
-
Condition: New. Zámecniková, I. (illustrator). pp. 292.
-
Design and Analysis of Randomized Algorithms : Introduction to Design Paradigms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer, Springer Vieweg, 2010
ISBN 10: 3642063004 ISBN 13: 9783642063008
Taschenbuch. Condition: Neu. Zámecniková, I. (illustrator). Druck auf Anfrage Neuware - Printed after ordering - Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms - foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. - while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.
-
Taschenbuch. Condition: Neu. Zámecniková, I. (illustrator). Design and Analysis of Randomized Algorithms | Introduction to Design Paradigms | J. Hromkovic | Taschenbuch | Texts in Theoretical Computer Science. An EATCS Series | xii | Englisch | 2010 | Springer | EAN 9783642063008 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Design and Analysis of Randomized Algorithms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg, 2005
ISBN 10: 3540239499 ISBN 13: 9783540239499
Condition: New. Zámecniková, I. (illustrator). The first introductory textbook at the advanced and graduate level on randomized algorithmsSystematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization|Randomness is a powerful phenomenon that.
-
Design and Analysis of Randomized Algorithms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer, Berlin, Springer, 2005
ISBN 10: 3540239499 ISBN 13: 9783540239499
Buch. Condition: Neu. Zámecniková, I. (illustrator). Druck auf Anfrage Neuware - Printed after ordering - Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms - foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. - while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.
-
Design And Analysis of Randomized Algorithms : Introduction to Design Paradigms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSSeller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 118.99
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Zámecniková, I. (illustrator). Unread book in perfect condition.
-
Hardcover. Condition: Like New. Zámecniková, I. (illustrator). Like New. book.
-
Condition: As New. Zámecniková, I. (illustrator). Unread book in perfect condition.
-
Condition: new. Zámecniková, I. (illustrator). Questo è un articolo print on demand.
-
Design and Analysis of Randomized Algorithms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg Okt 2010, 2010
ISBN 10: 3642063004 ISBN 13: 9783642063008
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Zámecniková, I. (illustrator). This item is printed on demand - it takes 3-4 days longer - Neuware -Systematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization 292 pp. Englisch.
-
Design and Analysis of Randomized Algorithms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer, Berlin, Springer Berlin Heidelberg, Springer, 2005
ISBN 10: 3540239499 ISBN 13: 9783540239499
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Zámecniková, I. (illustrator). This item is printed on demand - it takes 3-4 days longer - Neuware -Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms - foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. - while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field. 277 pp. Englisch.
-
Design and Analysis of Randomized Algorithms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 3642063004 ISBN 13: 9783642063008
Condition: New. Zámecniková, I. (illustrator). Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The first introductory textbook at the advanced and graduate level on randomized algorithmsSystematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization|Randomness is a powerful phenomenon that.
-
Condition: New. Zámecniková, I. (illustrator). Print on Demand pp. 292 Illus.
-
Design and Analysis of Randomized Algorithms
Book 15 of 45: Texts in Theoretical Computer Science. An EATCSLanguage: English
Published by Springer, Springer Vieweg Okt 2010, 2010
ISBN 10: 3642063004 ISBN 13: 9783642063008
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Zámecniková, I. (illustrator). This item is printed on demand - Print on Demand Titel. Neuware -Randomness is a powerful tool for solving various problems in all areas of computer applications. Randomized algorithms are often more efficient, simpler (and so easier to implement), and surprisingly also more reliable than their best deterministic counterparts. This book does not only systematically teach the paradigmic algorithm design methods, such as foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, but it also provides a deep insight into the nature of the success of randomization. Taking sufficient space for presenting motivation and for developing reader's intuition. It is an ideal introduction to the subject.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 292 pp. Englisch.
-
Condition: New. Zámecniková, I. (illustrator). PRINT ON DEMAND pp. 292.
