Now showing items 5-6 of 6

    • Parallelism in Random Access Machines 

      Fortune, Steven; Wyllie, James C. (Cornell University, 1978-01)
      A model of computation based on random access machines operating in parallel and sharing a common memory is presented. The computational power of this model is related to that of traditional models. In particular, ...
    • Sorting Helps for Voronoi Diagrams 

      Chew, L. Paul; Fortune, Steven (Cornell University, 1993-05)
      It is well known that, using standard models of computation, it requires $\Omega(n$ log $n$) time to build a Voronoi diagram for $n$ data points. This follows from the fact that a Voronoi diagram algorithm can be used ...