Parallel searching in generalized Monge arrays with applications

Authors:
A. Aggarwal;D. Kravets;J. Park;S. Sen
Affiliations:
IBM Research Division, T. J. Watson Research Center, Yorktown Heights, NY;Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA;Department of Computer Science, Duke University, Durham, NC
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Geometric applications of a matrix searching algorithm

SCG '86 Proceedings of the second annual symposium on Computational geometry
Fast algorithms for computing the largest empty rectangle

SCG '87 Proceedings of the third annual symposium on Computational geometry
Constructing trees in parallel

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Highly parallelizable problems

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
String editing on an SIMD hypercube multicomputer

Journal of Parallel and Distributed Computing
On-line dynamic programming with applications to the prediction of RNA secondary structure

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Sparse dynamic programming

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The String-to-String Correction Problem

Journal of the ACM (JACM)
The Parallel Evaluation of General Arithmetic Expressions

Journal of the ACM (JACM)
Efficient dynamic programming using quadrangle inequalities

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

Hi-index	0.00