A recent approach to the study of algorithms

Authors:
S. H. Zweben
Affiliations:
Ohio State University, Columbus, Ohio
Venue:
ACM '74 Proceedings of the 1974 annual ACM conference - Volume 2
Year:
1974

Citing 5
Cited 1

Algorithms: Euclidean algorithm

Communications of the ACM
Algorithm dynamics

ACM '73 Proceedings of the ACM annual conference
Invariant properties of algorithms.

Invariant properties of algorithms.
The internal structure of algorithms.

The internal structure of algorithms.
Natural laws controlling algorithm structure?

ACM SIGPLAN Notices

An experiment comparing Fortran programming times with the software physics hypothesis

AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Much of the past work in the study of algorithms has been done in terms of what the algorithm is intended to do, and the properties of algorithms that are studied in this connection are often, therefore, execution-related. Even when an algorithm has been studied in terms of the way it was written, terms such as block structure and control flow were commonly used, and the most basic constituent studied was the individual statement.