A time-randomness tradeoff for selection in parallel

DOI10.1007/3-540-57155-8_271zbMath1504.68080OpenAlexW1570508879MaRDI QIDQ5060137

Danny 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic Parallel Algorithms for Sorting and Selection
• Sorting and Selecting in Rounds
• Parallelism in Comparison Problems

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