Cover of The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

by Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman · first published 1974

4mentions
2recommended by
4HN commenters
2010–2023first – last mentioned

50% recommend50% neutral

Affiliate links. As an Amazon Associate I earn from qualifying purchases.

Mentions per year

10 2007: 0 mentions2008: 0 mentions2009: 0 mentions2010: 1 mention2011: 0 mentions2012: 0 mentions2013: 0 mentions2014: 0 mentions2015: 0 mentions2016: 1 mention2017: 0 mentions2018: 0 mentions2019: 0 mentions2020: 0 mentions2021: 1 mention2022: 0 mentions2023: 1 mention2024: 0 mentions2025: 0 mentions2026: 0 mentions200720172026

What Hacker News says

  • svat · Apr 1, 2021 · Recommends

    …later). Also, even if you consider only books, they wrote nine books, and neither of the two mentioned as most influential is "the dragon book". The first mentioned is the book by Aho, Hopcraft and Ullman: Design and Analysis of Computer Algorithms (1974) > a classic in the field and was one of the most cited books in computer science research for more than a decade. It became the standard textbook for algorithms courses throughout the world when…

    on “Turing Award goes to Aho and Ullman” ↗
  • ljw1001 · Nov 5, 2016 · Recommends

    (edit) Their book, The Design and Analysis of Computer Algorithms, impressed me greatly for the clarity of the thinking and conciseness of explanation, not just compared to other algorithm books, but against anything I've read in any subject.

    on “Advanced Data Structures” ↗
  • jefffoster · Nov 19, 2010 · Mentions

    They are both algorithm books and the initials are the last names of the authors. AHU is "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft and Ullman. CLR is "Introduction to Algorithms" by Cormen, Leiserson and Rivest

    on “Algorithms and Data Structures by N. Wirth [pdf]” ↗
  • pfdietz · Aug 11, 2023 · Mentions

    …big-Theta). In fact, one can also show that M(n) is O(D(n)) (where D(n) is the time needed to divide n bit numbers). So they really are big-theta of each other. (See Aho, Hopcroft, and Ullman, The Design and Analysis of Computer Algorithms, 1976, section 8.2)

    on “Why is division so much more complex than other arithmetic operations?” ↗

Keyboard shortcuts

/
Focus search
j / k
Next / previous book
Enter
Open focused book
Esc
Close / go back
g h
Go to Home
g t
Go to Top all-time
g m
Go to Most recommended
g r
Go to Rising
g f
Go to For You
?
Show this help