Parallel algorithms for arrangements

Authors:
R. Anderson;P. Beame;E. Brisson
Affiliations:
Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington;Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington;Department of Computer Science and Engineering, FR-35, University of Washington, Seattle, Washington
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Cylindrical algebraic decomposition I: the basic algorithm

SIAM Journal on Computing
Constructing arrangements of lines and hyperplanes with applications

SIAM Journal on Computing
Worst-case optimal hidden-surface removal

ACM Transactions on Graphics (TOG)
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
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
Polling: a new randomized sampling technique for computational geometry

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Intersecting is easier than sorting

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Constructing arrangements optimally in parallel (preliminary version)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
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