Is a linked list the best storage structure for an algebra system?

  • Authors:
  • Robert Moenck

  • Affiliations:
  • University of Toronto

  • Venue:
  • ACM SIGSAM Bulletin
  • Year:
  • 1978

Quantified Score

Hi-index 0.00

Visualization

Abstract

Virtually all algebraic manipulation systems are very large programs which can only be run on the largest computers, and even then press the limits of the machines resources [1]. I see this as the principal reason for the lack of popularity of algebraic manipulation; namely for many potential users the costs involved in running these programs do not outweigh their benefits. The motivation for this note is to stimulate discussion about the design of algebra systems, with a view to making them more economically viable.