Minimizing Access Pointer into Trees and Arrays.

Abstract

Multihead tree machines and multihead multidimensional machines are used to develop new methods for minimizing access pointers into trees and arrays. Every multihead tree machine of time complexity t(n) can be simulated on-line by a tree machine with only two access heads in time 0(t(n)log t(n)/log log t(n)). Every multihead e-dimensional machine of time complexity t(n) can be simulated on-line 0(t(n) 1+1/d-1/delog t(n)). The simulation for trees is optimal. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1981
Accession Number
ADA124491

Entities

People

  • Michael C. Loui

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Automata
  • Computations
  • Computer Science
  • Computers
  • Contracts
  • Directories
  • Electronics
  • Finite Alphabet
  • Machines
  • Simulations
  • Simulators
  • Theorems
  • Theoretical Computer Science
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computer Science/Computer Engineering/Data Science/Digital Signal Processing.
  • Forest Ecology
  • Housing Policy Studies in Military Families with Privatization and Telomerase Allowance Units, Multi-Family Housing, and Telomere Lengths.