Space and Time Hierarchies for Classes of Control Structures and Data Structures
From MaRDI portal
Publication:4099200
Cited in
(12)- Optimal dynamic embedding of X-trees into arrays
- Blocking for external graph searching
- The independence of control structures in abstract programming systems
- Bounds on the costs of data encodings
- Storage representations for tree-like data structures
- Bandwidth and pebbling
- Perfect Storage Representations for Families of Data Structures
- Accessibility of values as a determinant of relative complexity in algebras
- A new combinatorial approach to optimal embeddings of rectangles
- Simulations among multidimensional Turing machines
- Data encodings and their costs
- Relative complexity of algebras
This page was built for publication: Space and Time Hierarchies for Classes of Control Structures and Data Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099200)