Randomization in parallel algorithms and its impact on computational geometry
Publication
, Journal Article
Reif, JH; Sen, S
Published in: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
January 1, 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.
Duke Scholars
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
January 1, 1989
Volume
401 LNCS
Start / End Page
1 / 8
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences
Citation
APA
Chicago
ICMJE
MLA
NLM
Reif, J. H., & Sen, S. (1989). Randomization in parallel algorithms and its impact on computational geometry. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 401 LNCS, 1–8. https://doi.org/10.1007/3-540-51859-2_1
Reif, J. H., and S. Sen. “Randomization in parallel algorithms and its impact on computational geometry.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 401 LNCS (January 1, 1989): 1–8. https://doi.org/10.1007/3-540-51859-2_1.
Reif JH, Sen S. Randomization in parallel algorithms and its impact on computational geometry. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1989 Jan 1;401 LNCS:1–8.
Reif, J. H., and S. Sen. “Randomization in parallel algorithms and its impact on computational geometry.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 401 LNCS, Jan. 1989, pp. 1–8. Scopus, doi:10.1007/3-540-51859-2_1.
Reif JH, Sen S. Randomization in parallel algorithms and its impact on computational geometry. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1989 Jan 1;401 LNCS:1–8.
Published In
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI
EISSN
1611-3349
ISSN
0302-9743
Publication Date
January 1, 1989
Volume
401 LNCS
Start / End Page
1 / 8
Related Subject Headings
- Artificial Intelligence & Image Processing
- 46 Information and computing sciences