Upper Bounds for Speedup in Parallel Parsing
- 1 April 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (2) , 408-428
- https://doi.org/10.1145/322307.322316
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Analyses of deterministic parsing algorithmsCommunications of the ACM, 1978
- Symbolic Solution of Finite-Difference EquationsACM Transactions on Mathematical Software, 1977
- A Survey of Parallel Machine Organization and ProgrammingACM Computing Surveys, 1977
- Practical syntactic error recoveryCommunications of the ACM, 1975
- The complexity of parallel evaluation of linear recurrencePublished by Association for Computing Machinery (ACM) ,1975
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974