Systematically teaches key paradigmic algorithm design methods
Provides a deep insight into randomization
"synopsis" may belong to another edition of this title.
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.
From the reviews:
"The book gives an introduction to (design and analysis of) randomized algorithms. It is a self-contained textbook primarily for students. ... The proofs are precise and contain all details. This makes the book perfect for self-study. ... A student ... will be happy to find everything defined precisely and explained in detail." (Benjamin Doerr, Zentralblatt MATH, Vol. 1083, 2006)
“Theory of Computing community (especially those who work on Algorithm Design) is well acquainted with the concept of Randomization. ... this book still gives a fresh and interesting point of view to Randomization and Randomized Algorithms. ... This is a very good to excellent textbook on the Design and Analysis of Randomized Algorithms. Its unique ... feature is that it explicitly isolates and promotes the most important design techniques; this is really a great experience for the incoming theorist to specialize on Randomized Algorithms.” (Marios Mavronicolas, SIGACT News, Vol. 40 (2), 2009)"About this title" may belong to another edition of this title.
FREE shipping within U.S.A.
Destination, rates & speedsSeller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Hardcover. Condition: Very Good. No Jacket. Zámecniková, I. (illustrator). May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.23. Seller Inventory # G3540239499I4N00
Quantity: 1 available
Seller: Ammareal, Morangis, France
Hardcover. Condition: Trčs bon. Zámecniková, I. (illustrator). Ancien livre de bibliothčque. Edition 2005. Ammareal reverse jusqu'ŕ 15% du prix net de cet article ŕ des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2005. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-627-426
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Zámecniková, I. (illustrator). Seller Inventory # 3403349-n
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Zámecniková, I. (illustrator). Seller Inventory # ABLIING23Mar3113020163790
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. Zámecniková, I. (illustrator). In. Seller Inventory # ria9783540239499_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Zámecniková, I. (illustrator). Seller Inventory # 3403349-n
Quantity: Over 20 available
Seller: moluna, Greven, Germany
Gebunden. 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. Seller Inventory # 4886075
Quantity: Over 20 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Buch. Condition: Neu. Zámecniková, I. (illustrator). 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. Seller Inventory # 9783540239499
Quantity: 2 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: As New. Zámecniková, I. (illustrator). Unread book in perfect condition. Seller Inventory # 3403349
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Zámecniková, I. (illustrator). Unread book in perfect condition. Seller Inventory # 3403349
Quantity: Over 20 available