A fast implementation of a multidimensional storage into a tree storage

DOI10.1016/0304-3975(82)90037-8zbMath0489.68043OpenAlexW2093865976WikidataQ126865869 ScholiaQ126865869MaRDI QIDQ1166931

K. Ruediger Reischuk

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90037-8

zbMATH Keywords

Turing machineon-line simulationtree storagemultidimensional storageperformance measures for embeddings of graphstree machine

Mathematics Subject Classification ID

Related Items (3)

Optimal dynamic embedding of X-trees into arrays ⋮ Linear speed-up does not hold on Turing machines with tree storages ⋮ Minimizing access pointers into trees and arrays

Cites Work

• Unnamed Item
• Data encodings and their costs
• Simulations among multidimensional Turing machines
• Space-Time Trade-Offs in Structured Programming
• Preserving average proximity in arrays
• Relations Among Complexity Measures
• Boolean Memories

This page was built for publication: A fast implementation of a multidimensional storage into a tree storage