Abstract
An optimal method for dynamically embedding trees into arrays is presented. Every multi-head tree machine of time complexity $t(n)$ can be simulated on-line by a multihead d-dimensional machine in time $O(t(n)^{1 + 1/d} /\log t(n))$. An information-theoretic argument gives the worst-case lower bound $\Omega (t(n)^{1+1/d} /\log t(n))$ on the time required.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
