The Design and Analysis of Computer Algorithms

Aho, A. V., Hopcroft, & Ullman, J. D. (1974). The Design and Analysis of Computer Algorithms. Addison-Wesley.

Type

Book

Intellectual base

Textbook

Year

1974

Link

https://openlibrary.org/isbn/9780201000290verified

Cited from

computer_science

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Algorithm
  • A common failure is optimizing for speed while discarding the correctness guarantees an algorithm once provided, without explicit acknowledgment

    This sourceClassical algorithm-design/analysis text establishing a rigorous framework for designing efficient algorithms and analysing worst-case complexity

• Iteration
  • A common failure is choosing the syntactically convenient form while ignoring the computational costs (unbounded call stacks, memory overhead)

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://www.google.com/books/edition/The_Design_and_Analysis_of_Computer_Algo/SJJQAAAAMAAJ ×1

Registry ID ref:6b53fc0aafda · see in the full table