Aho, Hopcroft & Ullman <br/><br/>
The Design and Analysis of Algorithms 

 - England:  Pearson, 
 - x,470p. 
<br/><br/>1. Models of computation.--<br/>Cap. 2. Design of efficient algorithms.--<br/>Cap. 3. Sorting and order statistics.--<br/>Cap. 4. Data structures for set manipulation problems.--<br/>Cap. 5. Algorithms on graphs.--<br/>Cap. 6. Matrix multiplication and related operations.--<br/>Cap. 7. The fast fourier transform and its applications.--<br/>Cap. 8. Integer and polynomial arithmetic.--<br/>Cap. 9. Pattern-matching algorithms.--<br/>Cap. 10. NP-complete problems.--<br/>Cap. 11. Some provably intractable problems.--<br/>Cap. 12. Lower bounds on numbers of arithmetic operations. 
<br/><br/><label>ISBN: </label>9780201000290 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Computer programming.<br/>Algoritmos (Computadores)<br/>Algoritmos -- Informática.
<br/><br/><label>Dewey Class. No.: </label>005.1  / AHO/D