Tight complexity bounds for term matching problems
- 1 November 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 101 (1) , 33-69
- https://doi.org/10.1016/0890-5401(92)90075-q
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Term matching on parallel computersThe Journal of Logic Programming, 1989
- Complexity of matching problemsJournal of Symbolic Computation, 1987
- An Efficient Parallel Biconnectivity AlgorithmSIAM Journal on Computing, 1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- On the sequential nature of unificationThe Journal of Logic Programming, 1984
- Simulation of Parallel Random Access Machines by CircuitsSIAM Journal on Computing, 1984
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- Linear unificationJournal of Computer and System Sciences, 1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- An Analysis of a Good Algorithm for the Subtree ProblemSIAM Journal on Computing, 1977