Design and Analysis of Randomized Algorithms by J Hromkovic
Systematically teaches key paradigmic algorithm design methods Provides a deep insight into randomization-
Information and Randomness
-
Universal Artificial Intelligence
-
Interactive Theorem Proving and Program Development
-
Graphs and Algorithms in Communication Networks
-
Computable Analysis
-
Models of Massive Parallelism
-
Structural Complexity I
-
The Resolution Calculus
-
Models of Computation
-
Dissemination of Information in Optical Networks:
-
A Practical Theory of Reactive Systems
-
Petri Net Synthesis
-
Grammatical Picture Generation
-
Temporal Logic and State Systems
-
Algorithmics for Hard Problems
-
Simulation Algorithms for Computational Systems Biology
-
Public-Key Cryptography
-
Communication Complexity and Parallel Computing
-
Boolean Functions and Computation Models
-
Verification of Reactive Systems
-
Theoretical Computer Science
-
Introduction to Circuit Complexity
-
Elements of Finite Model Theory
-
The Parametric Lambda Calculus
-
The Complexity Theory Companion
-
Introduction to Process Algebra
-
DNA Computing
-
Abstract Computing Machines
-
Dissemination of Information in Communication Networks
-
Formal Methods for Software Engineering
-
Complexity Theory and Cryptology
-
Parsing Schemata
From the reviews:
"The book gives an introduction to (design and analysis of) randomized algorithmsIt 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)| SKU | Unavailable |
| ISBN 13 | 9783642063008 |
| ISBN 10 | 3642063004 |
| Title | Design and Analysis of Randomized Algorithms |
| Author | J Hromkovic |
| Series | Texts In Theoretical Computer Science An Eatcs Series |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer |
| Year published | 2010-10-21 |
| Number of pages | 277 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |