Optimal parallel algorithms for computing convex hulls and for sortng

Optimal parallel merging and sorting without memory conflicts

IEEE Transactions on Computers

A Bibliography on Digital and Computational Convexity (1961-1988)

IEEE Transactions on Pattern Analysis and Machine Intelligence

A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem

IEEE Transactions on Computers

Faster output-sensitive parallel convex hulls for d≤3: optimal sublogarithmic algorithms for small outputs

Proceedings of the twelfth annual symposium on Computational geometry

Finding a Hamiltonian paths in tournaments on clusters - a provably communication-efficient approach

Proceedings of the 2001 ACM symposium on Applied computing

Grid-enabled parallel divide-and-conquer: theory and practice

Proceedings of the 2002 ACM symposium on Applied computing

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science

PHoMpara – Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems

Computing

Output-sensitive algorithms for optimally constructing the upper envelope of straight line segments in parallel

Journal of Parallel and Distributed Computing