The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
On the Time Required to Perform Addition
Journal of the ACM (JACM)
On the Time Required to Perform Multiplication
Journal of the ACM (JACM)
The Time Required for Group Multiplication
Journal of the ACM (JACM)
Increasing the efficiency of quicksort
Communications of the ACM
The logarithmic error and Newton's method for the square root
Communications of the ACM
Optimal starting values for Newton-Raphson calculation of x1 2
Communications of the ACM
Evaluation of polynomials by computer
Communications of the ACM
Some results concerning efficient and optimal algorithms
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Theories of abstract automata (Prentice-Hall series in automatic computation)
Theories of abstract automata (Prentice-Hall series in automatic computation)
A n5/2 algorithm for maximum matchings in bipartite
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Boolean matrix multiplication and transitive closure
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Optimal algorithms for parallel polynomial evaluation
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Bounds on the evaluation time for rational polynomial
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficient
Journal of Computer and System Sciences
| Hi-index | 0.00 |
Algorithms for various computations have been known and studied for centuries, but it is only recently that much theoretical attention has been devoted to the analysis of algorithms. Turing machines and recursive functions were the first approaches, but these models, which provide much interesting mathematics, do not look at the problem from a practical standpoint. In "real" computing, no one uses Turing machines to evaluate polynomials or to multiply matrices, and little of practical significance is obtained from that approach. On the other hand, recent work has led to more realistic models and, correspondingly, to more practical results. Most of the results cannot be considered to be truly practical, but, all of them were motivated by practical considerations.