More efficient bottom-up multi-pattern matching in trees
From MaRDI portal
Publication:685356
DOI10.1016/0304-3975(92)90277-MzbMath0777.68044MaRDI QIDQ685356
Robert Endre Tarjan, Jiazhen Cai, Robert Paige
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68N15: Theory of programming languages
68W10: Parallel algorithms in computer science
Related Items
Uses Software
Cites Work
- Preserving order in a forest in less than logarithmic time and linear space
- Proving and applying program transformations expressed with second-order patterns
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Pattern Matching in Trees
- Programming with Equations
- Faster tree pattern matching
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item