Time-Randomness Trade-offs in Parallel Computation

DOI10.1006/JAGM.1996.0001MaRDI QIDQ4864432zbMATH OpenOpenAlexFDO

Authors D. Krizanc

Publication date 27 June 1996

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0001

zbMATH Keywords

parallel comparison tree

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A time-randomness tradeoff for selection in parallel
• A Time-Randomness Trade-Off for Oblivious Routing
• scientific article; zbMATH DE number 4047072
• scientific article; zbMATH DE number 1304350
• The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms

Cited in

(1)

• A time-randomness tradeoff for selection in parallel

This page was built for publication: Time-Randomness Trade-offs in Parallel Computation

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