Conference paper
Parallel communication with limited buffers
Nicholas Pippenger
FOCS 1984
Conference paper
PARALLEL COMPUTATIONAL GEOMETRY.
Abstract
The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.
Related
Alok Aggarwal, Dina Kravets, et al.
Algorithmica (New York)
Conference paper
Enhancing the decision making process for paper mill schedulers
S. Murthy, R. Akkiraju, et al.
Finishing and Converting Conference 1998
Conference paper
A model-theoretic analysis of knowledge: Preliminary report
Ronald Fagin, Joseph Y. Halpern, et al.
FOCS 1984