Time-Randomness Trade-offs in Parallel C
β
Danny Krizanc
π
Article
π
1996
π
Elsevier Science
π
English
β 171 KB
In this paper we study two problems which have a provable gap between their randomized and deterministic complexity; oblivious routing on fixed connection Ε½ . networks and finding the median on a parallel comparison tree PCT . We prove a trade-off between the amount of randomness used by an algorith