Optimal Dynamic Embedding of Trees into Arrays

DOI10.1137/0212030MaRDI QIDQ3040491zbMATH OpenOpenAlexFDO

Authors Michael C. Loui

Publication date 1983

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2142/74227

zbMATH Keywords

arraydata structureembeddinginformation-theoretic techniquemultidimensional Turing machinesimulationtree

Mathematics Subject Classification ID

Data structures (68P05)

Cited in

(6)

• On the worst case performance of buddy systems
• Optimal dynamic embedding of X-trees into arrays
• The complexity of on-line simulations between multidimensional turing machines and random access machines
• Linear speed-up does not hold on Turing machines with tree storages
• Simulating time with square-root space
• Minimizing access pointers into trees and arrays

This page was built for publication: Optimal Dynamic Embedding of Trees into Arrays

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