Special Feature An Introduction to Algorithm Design
- 1 February 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 12 (2) , 66-78
- https://doi.org/10.1109/mc.1979.1658620
Abstract
Fast algorithms dramatically decrease run time for certain tasks. Designing them offers not only the promise of better performance but also a better understanding of the problems underlying all computational tasks.Keywords
This publication has 14 references indexed in Scilit:
- A Survey of Analysis Techniques for Discrete AlgorithmsACM Computing Surveys, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977
- AlgorithmsScientific American, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975
- Efficient Planarity TestingJournal of the ACM, 1974
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965