Randomization in parallel algorithms and its impact on computational geometry


Journal Article

© Springer-Verlag Berlin Heidelberg 1989. 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.

Full Text

Duke Authors

Cited Authors

  • Reif, JH; Sen, S

Published Date

  • January 1, 1989

Published In

Volume / Issue

  • 401 LNCS /

Start / End Page

  • 1 - 8

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

Digital Object Identifier (DOI)

  • 10.1007/3-540-51859-2_1

Citation Source

  • Scopus