The Design and Analysis of Computer Algorithms
Alfred V. Aho, John E. Hopcroft
Abstract
Alfred V. Aho, John E. Hopcroft
Abstract
A text book for a first course in design and analysis of algorithms. The emphasis is on ideas and ease of understanding rather then on implementation details or programming tricks. It starts with formulating several models that include random access register machine, random access stored program machine and variants of these, so one can establish analytical results and at the same time accurately reflect on the salient features of real machines
OpenAlex reports 9463 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A text book for a first course in design and analysis of algorithms. The emphasis is on ideas and ease of understanding rather then on implementation details or programming tricks. It starts with formulating several models that include random access register machine, random access stored program machine and variants of these, so one can establish analytical results and at the same time accurately reflect on the salient features of real machines
Key concepts: Computer science, Strassen algorithm, Sorting, String (physics), Sorting algorithm, Theoretical computer science, Algorithm, String searching algorithm