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)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Randomized algorithms (68W20)
Related Items (13)
On the Power of Randomness versus Advice in Online Computation ⋮ Randomized online computation with high probability guarantees ⋮ Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Time-Space Complexity Advantages for Quantum Computing ⋮ Infinite vs. finite size-bounded randomized computations ⋮ On the advice complexity of the \(k\)-server problem ⋮ Online \(L(2,1)\)-coloring problem on paths with restricted size of memory ⋮ Indistinguishability and First-Order Logic ⋮ Classical and Quantum Computations with Restricted Memory ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Unnamed Item ⋮ Randomized Rounding in the Presence of a Cardinality Constraint ⋮ Near-Optimal Dominating Sets via Random Sampling
This page was built for publication: Design and analysis of randomized algorithms. Introduction to design paradigms.
