Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleApril 1974
Construction with parallel derivatives of the closure of a parallel program schema
STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computingPages 242–247https://doi.org/10.1145/800119.803901The parallel derivative of a set of strings is introduced. Given a serial, repetition-free parallel program schema, its closure is constructed by taking parallel derivatives of its set of computations. The construction resembles the construction of a ...
- ArticleApril 1974
Degrees of translatability and canonical forms in program schemas: Part I
STOC '74: Proceedings of the sixth annual ACM symposium on Theory of computingPages 1–12https://doi.org/10.1145/800119.803879We define a measure of the generality of the control structure of a program schema. This imposes a partial ordering on program schemas, and leads to a concept of the “difficulty” of a programming problem. In this sense there exists a “hardest” flowchart ...