Pages that link to "Item:Q1923864"
From MaRDI portal
The following pages link to A method for obtaining randomized algorithms with small tail probabilities (Q1923864):
Displaying 7 items.
- Optimal speedup of Las Vegas algorithms (Q689615) (← links)
- Hitting times in Markov chains with restart and their application to network centrality (Q1739335) (← links)
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem (Q2661998) (← links)
- A tail estimate for Mulmuley's segment intersection algorithm (Q5204337) (← links)
- Markov Processes with Restart (Q5407020) (← links)
- Algorithm portfolios (Q5940819) (← links)
- Preface: stochastic resetting—theory and applications (Q6121747) (← links)
