More efficient bottom-up multi-pattern matching in trees
Open Access
- 30 November 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 106 (1) , 21-60
- https://doi.org/10.1016/0304-3975(92)90277-m
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Conception, evolution, and application of functional programming languagesACM Computing Surveys, 1989
- Planar point location using persistent search treesCommunications of the ACM, 1986
- Storing a Sparse Table with 0 (1) Worst Case Access TimeJournal of the ACM, 1984
- Log-logarithmic worst-case range queries are possible in space Θ(N)Information Processing Letters, 1983
- Programming with EquationsACM Transactions on Programming Languages and Systems, 1982
- Pattern Matching in TreesJournal of the ACM, 1982
- Proving and applying program transformations expressed with second-order patternsActa Informatica, 1978
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977