AnO(N logN) minimal spanning tree algorithm forN points in the plane R. C. ChangR. C. T. Lee Part I Computer Science Pages: 7 - 16
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms Michael J. QuinnNarsingh Deo Part I Computer Science Pages: 35 - 43
An algorithm for the enumeration of spanning trees Pawel Winter Part I Computer Science Pages: 44 - 62
Phase-lag analysis of explicit Nyström methods fory″=f(x,y) M. M. ChawlaP. S. Rao Part II Numerical Mathematics Pages: 63 - 70
On regularization and discretization control for the numerical solution of inverse problems in parabolic equations Bernd HofmannVolkmar Friedrich Part II Numerical Mathematics Pages: 80 - 92
Derivative free multipoint iterative methods for simple and multiple roots S. R. K. IyengarR. K. Jain Part II Numerical Mathematics Pages: 93 - 99
Local error control inSDIRK-methods Syvert P. NørsettPer G. Thomsen Part II Numerical Mathematics Pages: 100 - 113
Circle contractive linear multistep methods Jørgen Sand Part II Numerical Mathematics Pages: 114 - 122
A one-way, stackless quicksort algorithm Huang Bing-ChaoDonald E. Knuth Scientific Notes Pages: 127 - 130
The convergence of interpolatory product integration rules Philip Rabinowitz Scientific Notes Pages: 131 - 134