Space and Time Hierarchies for Classes of Control Structures and Data Structures

@article{Lipton1976SpaceAT,
  title={Space and Time Hierarchies for Classes of Control Structures and Data Structures},
  author={Richard J. Lipton and Stanley C. Eisenstat and Richard A. DeMillo},
  journal={J. ACM},
  year={1976},
  volume={23},
  pages={720-732}
}
Control structures and data structures are modeled by directed graphs. In the control case nodes represent executable statements and arcs represent possible flow of control; in the data case nodes represent memory locations and arcs represent logical adjacencies in the data structure. Classes of graphs are compared by a relation ≤<subscrpt><italic>S.T</italic></subscrpt> where <italic>G</italic> ≤<subscrpt><italic>S.T</italic></subscrpt> <italic>H</italic> if <italic>G</italic> can be embedded… CONTINUE READING
20 Citations
1 References
Similar Papers

References

Publications referenced by this paper.

ANt~ JACOmm, G Flow-diagrams, Turmg machines, and languages with only two formation rules

  • C. B6HM
  • Comm. ACM 9,
  • 1966
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…