J. Boothroyd

Personal Homepage
Employer
()
Email

Publication Statistics

Publication period start
1963
Publication period end
1969
Number of co-authors
1

Co-authors
Number of publications with favourite co-authors

Productive Colleagues
Most productive colleagues in number of publications

Publications

Hamilton, P. A., Boothroyd, J. (1969): Remark on algorithm 251 [E4]: function minimization. In Communications of the ACM, 12 (9) pp. 512-513. http://doi.acm.org/10.1145/363219.363231

Boothroyd, J. (1969): Remark on algorithm 274 [F1]: generation of Hilbert derived test matrix. In Communications of the ACM, 12 (7) pp. 407-408. http://doi.acm.org/10.1145/363156.363181

Boothroyd, J. (1967): Remark on Algorithm 281: Abscissas and weights for Romberg quadrature. In Communications of the ACM, 10 (3) pp. 188. http://doi.acm.org/10.1145/363162.363215

Boothroyd, J. (1967): Algorithm 297: Eigenvalues and Eigenvectors of the symmetric system. In Communications of the ACM, 10 (3) pp. 181-182. http://doi.acm.org/10.1145/363162.363208

Boothroyd, J. (1967): Algorithm 302: Transpose vector stored array. In Communications of the ACM, 10 (5) pp. 292-293. http://doi.acm.org/10.1145/363282.363304

Boothroyd, J. (1967): Algorithm 318: Chebyschev curve-fit. In Communications of the ACM, 10 (12) pp. 801-803. http://doi.acm.org/10.1145/363848.363865

Boothroyd, J. (1966): Algorithm 274: Generation of Hilbert derived test matrix. In Communications of the ACM, 9 (1) pp. 11-12. http://doi.acm.org/10.1145/365153.365159

Boothroyd, J. (1966): Algorithm 290: linear equations, exact solutions. In Communications of the ACM, 9 (9) pp. 683-684. http://doi.acm.org/10.1145/365813.365822

Boothroyd, J. (1965): Certification of algorithm 243 [B3]: logarithm of a complex number. In Communications of the ACM, 8 (5) pp. 279. http://doi.acm.org/10.1145/364914.364940

Boothroyd, J. (1964): ACM Algorithm 246: Graycode. In Communications of the ACM, 7 (12) pp. 701. http://doi.acm.org/10.1145/355588.355589

Boothroyd, J. (1963): Algorithm 207: stringsort. In Communications of the ACM, 6 (10) pp. 615. http://doi.acm.org/10.1145/367651.367662