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

M.A Al-A'Ali,M.A Ajiz

doi:10.1016/0045-7949(94)90170-8

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

M.A Al-A'Ali, M.A Ajiz

https://doi.org/10.1016/0045-7949(94)90170-8

Copy DOI

Journal: Computers and Structures	Publication Date: Dec 1, 1994
Citations: 1

Affiliation: University of Bahrain

#Storage Requirements #Execution Time Requirements + Show 8 more

Abstract
Full-Text
Similar Papers

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

More From: Computers and Structures

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.