Superlinear bounds on matrix searching

Authors:
Maria M. Klawe
Affiliations:
Dept. of Computer Science, UBC, Vancouver, BC V6T 1W5
Venue:
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Year:
1990

Citing 4
Cited 0

The least weight subsequence problem

SIAM Journal on Computing
Fast algorithms for computing the largest empty rectangle

SCG '87 Proceedings of the third annual symposium on Computational geometry
The concave least-weight subsequence problem revisited

Journal of Algorithms
An almost linear time algorithm for generalized matrix searching

SIAM Journal on Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract