Efficient algorithm for linear problems using packed data structure with a set of parallel pointers

  • Al-A'ali M
  • Ajiz M
  • 1


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


Nowadays the algorithms developed impose the same restrictions as many years before such as storage and execution time. In this paper an algorithm is presented which is efficient as regards to computer execution time and storage requirements. © 1994.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • M. A. Al-A'ali

  • M. A. Ajiz

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free