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

DOI10.1145/321978.321990zbMath0333.68024OpenAlexW2036795391MaRDI QIDQ4099200

Stanley C. Eisenstat, Richard J. Lipton, Richard A. DeMillo

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321978.321990

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (12)

Optimal dynamic embedding of X-trees into arrays ⋮ A new combinatorial approach to optimal embeddings of rectangles ⋮ Blocking for external graph searching ⋮ Data encodings and their costs ⋮ The independence of control structures in abstract programming systems ⋮ Simulations among multidimensional Turing machines ⋮ Accessibility of values as a determinant of relative complexity in algebras ⋮ Perfect Storage Representations for Families of Data Structures ⋮ Storage representations for tree-like data structures ⋮ Bounds on the costs of data encodings ⋮ Bandwidth and pebbling ⋮ Relative complexity of algebras

This page was built for publication: Space and Time Hierarchies for Classes of Control Structures and Data Structures