On the cost of algorithms for random selection

DOI10.1515/MCMA.1999.5.1.39MaRDI QIDQ4254585zbMATH OpenOpenAlexFDO

Authors P. S. Rouzankin, A. V. Vojtishek

Publication date 20 March 2000

Published in Monte Carlo Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/mcma.1999.5.1.39

zbMATH Keywords

algorithmslotteryrandom selection

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Recommendations

• Sorting and Selection with Random Costs
• A random algorithm for multiselection
• Randomized selection in \(n+C+o(n)\) comparisons
• On the greedy algorithm with random costs
• Randomized algorithm for the sum selection problem
• Algorithms and Computation
• scientific article; zbMATH DE number 1286253
• Optimal randomized algorithm for the density selection problem
• On Assessing the Performance of Randomized Algorithms

Cited in

(4)

• Approximating Component Selection with General Costs
• Motif estimation via subgraph sampling: the fourth-moment phenomenon
• scientific article; zbMATH DE number 1273640 (Why is no real title available?)
• Algorithms and Computation

This page was built for publication: On the cost of algorithms for random selection

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