Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal parallel algorithms for polygon and point-set problems
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
On the parallel decomposability of geometric problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Randomized algorithms for binary search and load balancing with geometric applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Constructing arrangements optimally in parallel (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel algorithms for evaluating sequences of set-manipulation operations
Journal of the ACM (JACM)
Lower bounds for intersection searching and fractional cascading in higher dimension
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Lower bounds for intersection searching and fractional cascading in higher dimension
Journal of Computer and System Sciences - STOC 2001
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |