Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Computational geometry: an introduction
Computational geometry: an introduction
Type architectures, shared memory, and the corollary of modest potential
Annual review of computer science vol. 1, 1986
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Efficient parallel solutions to some geometric problems
Journal of Parallel and Distributed Computing
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Towards an architecture-independent analysis of parallel algorithms
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On communication latency in PRAM computations
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
On the parallel decomposability of geometric problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A bridging model for parallel computation
Communications of the ACM
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
An NC parallel 3D convex hull algorithm
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
SIAM Journal on Computing
An optimal randomized logarithmic time connectivity algorithm for the EREW PRAM (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Efficient routing and message bounds for optimal parallel algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Direct Bulk-Synchronous Parallel Algorithms
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
A Convex Hull Algorithm on Coarse-Grained Multiprocessors
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
Parallel linear programming in fixed dimension almost surely in constant time
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Developing a practical projection-based parallel Delaunay algorithm
Proceedings of the twelfth annual symposium on Computational geometry
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Coarse grained parallel computing on heterogeneous systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Computing the arrangement of curve segments: divide-and-conquer algorithms via sampling
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient selection algorithms on distributed memory computers
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
3D in the Pines and on the Plains
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Parallel Models and Job Characterization for System Scheduling
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Interoperability of Data Parallel Runtime Libraries
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A 2-D Parallel Convex Hull Algorithm with Optimal Communication Phases
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Parallel Algorithms for Grounded Range Search and Applications
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Parallel Geometric Algorithms in Coarse-Grain Network Models
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Coarse Grained Parallel Algorithms for Detecting Convex Bipartite Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Coarse grained gather and scatter operations with applications
Journal of Parallel and Distributed Computing
A Coarse-Grained multicomputer algorithm for the detection of repetitions
Information Processing Letters
Coarse grained parallel algorithms for graph matching
Parallel Computing
The Journal of Supercomputing
A Coarse-Grained Multicomputer algorithm for the detection of repetitions
Information Processing Letters
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
A CGM algorithm solving the longest increasing subsequence problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
SMI 2012: Full GPU accelerated convex hull computation
Computers and Graphics
gHull: A GPU algorithm for 3D convex hull
ACM Transactions on Mathematical Software (TOMS)
| Hi-index | 0.01 |