Faster tree pattern matching
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 145-150vol.1
- https://doi.org/10.1109/fscs.1990.89533
Abstract
Recently, R. Kosaraju (Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, p.178-83) gave an O(nm/sup 0.75/ polylog(m))-step algorithm for tree pattern matching. The authors improve this result by designing a simple O(n square root m polylog (m)) algorithm.Keywords
This publication has 3 references indexed in Scilit:
- Efficient tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Pattern Matching in TreesJournal of the ACM, 1982
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977