Design and analysis of randomized algorithms. Introduction to design paradigms.
From MaRDI portal
Publication:1777964
zbMath1083.68146MaRDI QIDQ1777964
Publication date: 26 May 2005
Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68W20: Randomized algorithms
Related Items
Unnamed Item, Time-Space Complexity Advantages for Quantum Computing, Online \(L(2,1)\)-coloring problem on paths with restricted size of memory, Classical and Quantum Computations with Restricted Memory, Quantum online algorithms with respect to space and advice complexity, Randomized online computation with high probability guarantees, Two-way and one-way quantum and classical automata with advice for online minimization problems, On the advice complexity of the \(k\)-server problem, Infinite vs. finite size-bounded randomized computations, Randomized Rounding in the Presence of a Cardinality Constraint, Near-Optimal Dominating Sets via Random Sampling, On the Power of Randomness versus Advice in Online Computation, Indistinguishability and First-Order Logic