A time-randomness tradeoff for selection in parallel

DOI10.1007/3-540-57155-8_271MaRDI QIDQ5060137zbMATH OpenOpenAlexFDO

Authors D. Krizanc

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_271

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Randomized algorithms (68W20)

Recommendations

• Time-Randomness Trade-offs in Parallel Computation
• Parallel selection
• Probabilistic Parallel Algorithms for Sorting and Selection
• scientific article; zbMATH DE number 4213428
• scientific article; zbMATH DE number 1419211

Cites work

• scientific article; zbMATH DE number 437558 (Why is no real title available?)
• scientific article; zbMATH DE number 3564899 (Why is no real title available?)
• Parallelism in Comparison Problems
• Probabilistic Parallel Algorithms for Sorting and Selection
• Sorting and Selecting in Rounds

Cited in

(3)

• Time-Randomness Trade-offs in Parallel Computation
• scientific article; zbMATH DE number 1419211 (Why is no real title available?)
• Parallel selection

This page was built for publication: A time-randomness tradeoff for selection in parallel

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