Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Computational geometry: an introduction
Computational geometry: an introduction
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Topologically sweeping an arrangement
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Deterministic parallel list ranking
VLSI Algorithms and Architectures
SIAM Journal on Computing
Cascading divide-and-conquer: a technique for designing parallel algorithms
SIAM Journal on Computing
Intersecting line segments in parallel with an output-sensitive number of processors
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A deterministic algorithm for partitioning arrangements of lines and its application
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Efficient parallel computation of arrangements of hyperplanes in d dimensions
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for arrangements
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Intersecting is easier than sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines
Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared Memory Machines
A Survey of Parallel Algorithms for Shared-Memory Machines
A Survey of Parallel Algorithms for Shared-Memory Machines
The complexity of parallel computations
The complexity of parallel computations
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
Efficient parallel techniques for computational geometry
Efficient parallel techniques for computational geometry
Efficient NC algorithms for set cover with applications to learning and geometry
Proceedings of the 30th IEEE symposium on Foundations of computer science
| Hi-index | 0.00 |