Parallel complexity of logical query programs
- 1 November 1988
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 3 (1-4) , 5-42
- https://doi.org/10.1007/bf01762108
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The parallel complexity of simple chain queriesPublished by Association for Computing Machinery (ACM) ,1987
- Efficient parallel evaluation of straight-line code and arithmetic circuitsPublished by Springer Nature ,1986
- Parallel evaluation of recursive rule queriesPublished by Association for Computing Machinery (ACM) ,1985
- A taxonomy of problems with fast parallel algorithmsInformation and Control, 1985
- Solving tree problems on a mesh-connected processor arrayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974