A principle of algorithm design on limited problem domain

  • Authors:

  • Jayadev Misra

  • Affiliations:

  • -

  • Venue:
  • DAC '76 Proceedings of the 13th Design Automation Conference
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper studies the problem of algorithm design on well defined data structures. A general principle is presented which is shown to be useful in designing algorithms which operate on sequences (strings). A generalization of the principle is presented for more general data structures. Implications of these results are discussed.