On the cost of algorithms for random selection

DOI10.1515/MCMA.1999.5.1.39zbMATH Open0933.65006OpenAlexW2003624306MaRDI QIDQ4254585FDOQ4254585

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

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

zbMATH Keywords

algorithmslotteryrandom selection

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Cited In (4)

• Approximating Component Selection with General Costs
• Motif estimation via subgraph sampling: the fourth-moment phenomenon
• Title not available (Why is that?)
• 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)