Synapse
⌘+K
Synapse
PulseExploreClubsResearchersJournals
Instagram
HomeClubsExplore
January 1, 1988

Optimal parallel algorithms for polygon and point-set problems

View Full Paper
Ask AI
Bookmark
Share

Authors

RCRichard ColeCourant Institute of Mathematical SciencesMGMichael T. GoodrichUniversity of California, Irvine

Discussion

Loading...

Member takes

Implication

Key Points

Key points are not available for this paper at this time.

Cite This Study

Cole et al. (1988) studied this question.

synapsesocial.com/papers/6a1f552fe800721f04835343https://doi.org/10.1145/73393.73414
View Full Paper
Ask AI
Bookmark
Share

Also Consider

Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines1989 · 131 citations
  2. 2The power of parallel prefix1985 · 255 citations
  3. 3An Optimal Algorithm for Finding the Kernel of a Polygon1979 · 162 citations