Parallel Selection with High Probability

DOI10.1137/0403003MaRDI QIDQ3031943zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, Graham Brightwell

Publication date 1990

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0403003

zbMATH Keywords

medianparallel comparison algorithmsselecting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Probabilistic Parallel Algorithms for Sorting and Selection
• Parallel algorithms for select and partition with noisy comparisons
• scientific article; zbMATH DE number 4213428
• Finding an approximate median with high probability in constant parallel time
• Parallel selection

Cited in

(4)

• LOL selection in high dimension
• Fast Deterministic Selection
• High entropy random selection protocols
• Optimal parallel selection

This page was built for publication: Parallel Selection with High Probability

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