The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The Expression of Algorithms by Charts
Journal of the ACM (JACM)
Characterizations of Reducible Flow Graphs
Journal of the ACM (JACM)
On the capabilities of while, repeat, and exit statements
Communications of the ACM
Flow diagrams, turing machines and languages with only two formation rules
Communications of the ACM
Analysis of structured programs
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Structured programming
Negation can be exponentially powerful
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Can structured programs be efficient?
ACM SIGPLAN Notices
Structured programming with go to statements
Classics in software engineering
Recent developments in the theory of data structures
Computer Languages
| Hi-index | 0.00 |
The running time or computational complexity of a sequential process is usually determined by summing weights attached to the basic operations from which the process is derived. In practice, however, the complexity is often limited by how efficiently it can access its data structures and how efficiently it can control program flow. Furthermore, it has been extensively argued [4] that certain limitations on the process sequencing mechanisms available to the programmer result in more “efficient” representations for the underlying processes. In this paper we will examine these issues in an attempt to assess the “power” of various data and control structures.