Parallel algorithms for term matching
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient parallel solution of linear systemsPublished by Association for Computing Machinery (ACM) ,1985
- Constructing a perfect matching is in random NCPublished by Association for Computing Machinery (ACM) ,1985
- Parallel computational geometryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Improved processor bounds for algebraic and combinatorial problems in RNCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Optimal parallel algorithms for string matchingPublished by Association for Computing Machinery (ACM) ,1984
- On the Asymptotic Complexity of Matrix MultiplicationSIAM Journal on Computing, 1982
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Equations and Rewrite Rules: A SurveyPublished by Elsevier ,1980
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- The monotone and planar circuit value problems are log space complete for PACM SIGACT News, 1977