1974CERN Document Server (European Organization for Nuclear Research)Requires access

The Design and Analysis of Computer Algorithms

Alfred V. Aho, John E. Hopcroft

Open publisher page 9,463 citations

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

About this research paper

What this paper is about

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

Why it matters

OpenAlex reports 9463 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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

Key concepts: Computer science, Strassen algorithm, Sorting, String (physics), Sorting algorithm, Theoretical computer science, Algorithm, String searching algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
The Design and Analysis of Computer Algorithms — Research Paper | ScholarLens