Minimizing access pointers into trees and arrays
DOI10.1016/0022-0000(84)90019-9zbMATH Open0542.68031OpenAlexW1576817182MaRDI QIDQ795505FDOQ795505
Authors: Michael C. Loui
Publication date: 1984
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(84)90019-9
Recommendations
simulationtreesarraystime complexityaccess pointersmultidimensional Turing machinemultihead multidimensional machinesMultihead tree machines
Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-Tape Simulation of Multitape Turing Machines
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
- On time versus space. II
- An information-theoretic approach to time bounds for on-line computation
- A fast implementation of a multidimensional storage into a tree storage
- Optimal Dynamic Embedding of Trees into Arrays
- Simulations among multidimensional Turing machines
- New Real-Time Simulations of Multihead Tape Units
- Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines)
- Analysis of a General Mass Storage System
Cited In (4)
This page was built for publication: Minimizing access pointers into trees and arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795505)