More efficient bottom-up multi-pattern matching in trees
From MaRDI portal
Publication:685356
DOI10.1016/0304-3975(92)90277-MzbMATH Open0777.68044OpenAlexW4213337636MaRDI QIDQ685356FDOQ685356
Authors: Jiazhen Cai, Robert Paige, Robert E. Tarjan 
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(92)90277-m
Recommendations
- scientific article
- Faster tree pattern matching
- Fast multiple pattern Cartesian tree matching
- scientific article; zbMATH DE number 4041265
- Fast algorithms for single and multiple pattern Cartesian tree matching
- Efficient pattern matching on graph patterns of bounded treewidth
- Tree Pattern Matching to Subset Matching in Linear Time
- TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
- scientific article; zbMATH DE number 4053042
- scientific article; zbMATH DE number 2079422
Theory of programming languages (68N15) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preserving order in a forest in less than logarithmic time and linear space
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Title not available (Why is that?)
- Log-logarithmic worst-case range queries are possible in space theta(N)
- Title not available (Why is that?)
- Pattern Matching in Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster tree pattern matching
- Proving and applying program transformations expressed with second-order patterns
- Programming with Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (13)
- Tree pattern matching with a more general notion of occurrence of the pattern.
- Computational Science and Its Applications – ICCSA 2004
- Higher-order matching for program transformation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Left-to-right tree pattern matching
- TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING
- Efficient preprocessing of simple binary pattern forests
- Generating tables for bottom-up matching
- Title not available (Why is that?)
- An NSF proposal
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: More efficient bottom-up multi-pattern matching in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685356)
