Parallel tree pattern matching
From MaRDI portal
Recommendations
- Publication:3779742
- Parallel computation of matchings in trees
- Publication:3793740
- Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
- Publication:4816824
- Faster tree pattern matching
- Fast multiple pattern Cartesian tree matching
- Publication:5186734
- Parallel algorithms for tree traversals
- Parallel algorithms for combinatorial pattern matching
Cites work
- scientific article; zbMATH DE number 3921984 (Why is no real title available?)
- scientific article; zbMATH DE number 4011929 (Why is no real title available?)
- scientific article; zbMATH DE number 4064467 (Why is no real title available?)
- scientific article; zbMATH DE number 3551946 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- Abstract data types and software validation
- Efficient parallel algorithms for graph problems
- Optimal parallel algorithms for string matching
- Optimal parallel pattern matching in strings
- Parallelism in random access machines
- Pattern Matching in Trees
- Term matching on parallel computers
- The Parallel Evaluation of General Arithmetic Expressions
Cited in
(6)- Parallel computation of matchings in trees
- On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching
- scientific article; zbMATH DE number 4058881 (Why is no real title available?)
- scientific article; zbMATH DE number 1956456 (Why is no real title available?)
- scientific article; zbMATH DE number 4041265 (Why is no real title available?)
- scientific article; zbMATH DE number 4060735 (Why is no real title available?)
This page was built for publication: Parallel tree pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912610)
