Fast many-to-one matching algorithms
Proc. of the first international conference on Rewriting techniques and applications
Optimal parallel pattern matching in strings
Information and Control
Optimal parallel algorithms for string matching
Information and Control
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
An efficient parallel algorithm for term matching
Proc. of the sixth conference on Foundations of software technology and theoretical computer science
Parallel algorithms for term matching
Proc. of the 8th international conference on Automated deduction
Term matching on parallel computers
14th International Colloquium on Automata, languages and programming
Highly parallelizable problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient tree pattern matching (extended abstract): an aid to code generation
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Abstract data types and software validation
Communications of the ACM
An interpreter generator using tree pattern matching
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Rapid identification of repeated patterns in strings, trees and arrays
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The SAC-1 system: An introduction and survey
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
A Survey of Parallel Algorithms for Shared-Memory Machines
A Survey of Parallel Algorithms for Shared-Memory Machines
Tree templates and subtree transformational grammars.
Tree templates and subtree transformational grammars.
Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
| Hi-index | 0.00 |
Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance of any variable in the pattern occurs at most once. In this paper we describe a new parallel algorithm for linear tree pattern matching using a parallel random access machine model.