The design and analysis of computer algorithms
- New Delhi Dorling Kindersley Pvt. Ltd. 1974
- 1-470
1.Models of computation 2. Design of efficient algorithms 3. Sorting and order statics 4. Data structures set for manipulation 5. Algorithms on graphs 6. Matrix multiplication and related operations 7. The fast fourier transform and its application 8. Integer and polynomial algorithms 9. Pattern matching algorithms 10. NP-Complete problems 11. Some provably intractable problems 12. Lower bounds on numbers of arithmetic operations