Pages that link to "Item:Q1777964"
From MaRDI portal
The following pages link to Design and analysis of randomized algorithms. Introduction to design paradigms. (Q1777964):
Displaying 13 items.
- Quantum online algorithms with respect to space and advice complexity (Q669542) (← links)
- Randomized online computation with high probability guarantees (Q2134747) (← links)
- Two-way and one-way quantum and classical automata with advice for online minimization problems (Q2139057) (← links)
- On the advice complexity of the \(k\)-server problem (Q2396827) (← links)
- Infinite vs. finite size-bounded randomized computations (Q2637645) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
- On the Power of Randomness versus Advice in Online Computation (Q3166941) (← links)
- Indistinguishability and First-Order Logic (Q3502636) (← links)
- Time-Space Complexity Advantages for Quantum Computing (Q5055992) (← links)
- (Q5129945) (← links)
- Online \(L(2,1)\)-coloring problem on paths with restricted size of memory (Q6043925) (← links)
- Classical and Quantum Computations with Restricted Memory (Q6163622) (← links)