An Embedding Result for Labelled Programs.

Abstract

It is shown that structured programs with n+1 labels can be simulated by structured programs with n labels by increasing the running time of the programs by at most a factor of 4. Two versions of this result are proved and in one version no node splitting operations are required in performing the simulation. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1977
Accession Number
ADA049344

Entities

People

  • Richard A. Demillo
  • S. Rao Kosaraju

Organizations

  • Georgia Tech

Tags

DTIC Thesaurus Topics

  • Computer Programming
  • Computer Science
  • Computers
  • Electrical Engineering
  • Embedding
  • Engineering
  • Hierarchies
  • Information Science
  • Military Research
  • Schools
  • Security
  • Simulations
  • Structured Programming
  • Trees (Data Structures)

Fields of Study

  • Computer science

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.