Dynamic string searching

Authors:
Arne Andersson;Mikkel Thorup
Affiliations:
Computing Science Department, Information Technology, Uppsala University, Sweden;AT&T Labs-Research, 180 Park Avenue, Florhan Park, NJ
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 3
Cited 1

Optimal bounds for the predecessor problem

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Tight(er) worst-case bounds on dynamic searching and priority queues

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Faster deterministic sorting and searching in linear space

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Dynamic ordered sets with exponential search trees

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Optimal bounds are presented for dynamic string searching. If the longest common prefix between a query key x and a currently stored string y is ℓ words, then finding the stored string lexicographically nearest to x takes optimal &THgr;(√log n/log log n + ℓ) time. Similarly, we can insert and delete strings from the stored set within this time bound. The space requirements is linear and the time bounds are worst-case.