Abstract
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.
Cite
CITATION STYLE
APA
Al-A’ali, M. A., & Ajiz, M. A. (1994). Efficient algorithm for linear problems using packed data structure with a set of parallel pointers. Computers and Structures, 53(5), 1225–1233. https://doi.org/10.1016/0045-7949(94)90170-8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free