Space and Time Hierarchies for Classes of Control Structures and Data Structures
From MaRDI portal
Publication:4099200
DOI10.1145/321978.321990zbMath0333.68024MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
68Q45: Formal languages and automata
68N01: General topics in the theory of software
68W99: Algorithms in computer science
Related Items
Optimal dynamic embedding of X-trees into arrays, 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, Bandwidth and pebbling, A new combinatorial approach to optimal embeddings of rectangles, Blocking for external graph searching, Perfect Storage Representations for Families of Data Structures, Storage representations for tree-like data structures, Relative complexity of algebras, Bounds on the costs of data encodings