A fast implementation of a multidimensional storage into a tree storage

DOI10.1016/0304-3975(82)90037-8MaRDI QIDQ1166931zbMATH OpenOpenAlexWikidataFDO

Authors Rüdiger 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 machinetree storageon-line simulationmultidimensional storageperformance measures for embeddings of graphstree machine

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• scientific article; zbMATH DE number 3600020 (Why is no real title available?)
• Boolean Memories
• Data encodings and their costs
• Preserving average proximity in arrays
• Relations Among Complexity Measures
• Simulations among multidimensional Turing machines
• Space-Time Trade-Offs in Structured Programming

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1166931)