000 01204nam a2200241Ia 4500
003 OSt
005 20230221170009.0
008 220128s9999 xx 000 0 und d
020 _a9780201000290
040 _cCUS
082 _a005.1
_bAHO/D
100 _aAho, Hopcroft & Ullman
_92972
245 4 _aThe Design and Analysis of Algorithms
260 _bPearson,
_aEngland:
300 _ax,470p.
505 _a1. Models of computation.-- Cap. 2. Design of efficient algorithms.-- Cap. 3. Sorting and order statistics.-- Cap. 4. Data structures for set manipulation problems.-- Cap. 5. Algorithms on graphs.-- Cap. 6. Matrix multiplication and related operations.-- Cap. 7. The fast fourier transform and its applications.-- Cap. 8. Integer and polynomial arithmetic.-- Cap. 9. Pattern-matching algorithms.-- Cap. 10. NP-complete problems.-- Cap. 11. Some provably intractable problems.-- Cap. 12. Lower bounds on numbers of arithmetic operations.
650 _aComputer programming.
_9587
650 _aAlgoritmos (Computadores)
_96568
650 _aAlgoritmos -- Informática.
_96569
700 _96566
_aHopcroft, John E & Ullman, Jeffrey D
942 _2ddc
_cWB16
947 _a1974
999 _c211214
_d211214