Header menu link for other important links
Randomization in parallel algorithms and its impact on computational geometry
J.H. Reif,
Published in Springer Verlag
Volume: 401 LNCS
Pages: 1 - 8
Randomization offers elegant solutions to some problems in parallel computing. In addition to improved efficiency it often leads to simpler and practical algorithms. In this paper we discuss some of the characteristics of randomized algorithms and also give applications in computational geometry where use of randomization gives us significant advantage over the best known deterministic parallel algorithms. © Springer-Verlag Berlin Heidelberg 1989.
About the journal
Published in Springer Verlag
Open Access
Impact factor