Design and analysis of randomized algorithms. Introduction to design paradigms.

MaRDI QIDQ1777964zbMATH OpenFDO

Authors Juraj Hromkovič

Publication date 26 May 2005

Published in Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

zbMATH Keywords

randomized algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)

Recommendations

• scientific article; zbMATH DE number 819814
• Probability and Computing
• An introduction to randomized algorithms
• scientific article; zbMATH DE number 1246227
• scientific article; zbMATH DE number 193197

Cited in

(17)

• Handbook of randomized computing. Vols. 1, 2
• Classical and Quantum Computations with Restricted Memory
• Online \(L(2,1)\)-coloring problem on paths with restricted size of memory
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Probability and Computing
• On the termination problem for probabilistic higher-order recursive programs
• Randomized online computation with high probability guarantees
• Indistinguishability and First-Order Logic
• Infinite vs. finite size-bounded randomized computations
• On the advice complexity of the \(k\)-server problem
• 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
• Time-Space Complexity Advantages for Quantum Computing
• On Assessing the Performance of Randomized Algorithms
• Quantum online algorithms with respect to space and advice complexity
• Two-way and one-way quantum and classical automata with advice for online minimization problems

This page was built for publication: Design and analysis of randomized algorithms. Introduction to design paradigms.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777964)