Optimal dynamic embedding of X-trees into arrays

DOI10.1016/0304-3975(88)90144-2zbMath0648.68064OpenAlexW1977252619MaRDI QIDQ1105377

Michael C. Loui, A. Scottedward Hodel

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90144-2

zbMATH Keywords

on-line simulationX-treearraydynamic embeddingmultihead bounded activity machinestorage medium

Mathematics Subject Classification ID

Cites Work

• Simulations among multidimensional Turing machines
• A fast implementation of a multidimensional storage into a tree storage
• Optimal Dynamic Embedding of Trees into Arrays
• Cost Trade-offs in Graph Embeddings, with Applications
• Space-Time Trade-Offs in Structured Programming
• Graphs That are Almost Binary Trees
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Relations Among Complexity Measures
• On the Minimum Computation Time of Functions

This page was built for publication: Optimal dynamic embedding of X-trees into arrays