Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Reviews and Descriptions of Tables and Books
HTML articles powered by AMS MathViewer

by PDF
Math. Comp. 28 (1974), 325-339 Request permission
References
  • Shiu-fong Yeung and Chih Bing Ling, On values of roots of monomial-transcendental equations, Hung-ching Chow Sixty-fifth Anniversary Volume, Nat. Taiwan Univ., Math. Res. Center, Taipei, 1967, pp. 196–204. MR 0225466
    • H. P. Robinson, Roots of $\tan x = x$, Lawrence Berkeley Laboratory, University of California, Berkeley, California, December 1972, ms. deposited in the UMT file. (See Math. Comp., v. 27, 1973, p. 999, RMT 44.) H. E. Fettis, Private communication.
  • Chih Bing Ling, Tables of values of $\sigma _{2s}$ relating to Weierstrass’ elliptic function, Math. Comp. 19 (1965), 123–127. MR 171369, DOI 10.1090/S0025-5718-1965-0171369-8
  • A. Fletcher, J. C. P. Miller, L. Rosenhead, and L. J. Comrie, An index of mathematical tables. Vol. I: Introduction. Part I: Index according to functions, 2nd ed., Published for Scientific Computing Service Ltd., London, by Addison-Wesley Publishing Co., Inc., Reading, Mass., 1962. MR 0142796
    • Math Comp., v. 25, 1971, p. 200, MTE 474. MTAC, v. 1, 1943, pp. 30-31, QR 1.
  • Richard P. Brent, The distribution of small gaps between successive primes, Math. Comp. 28 (1974), 315–324. MR 330017, DOI 10.1090/S0025-5718-1974-0330017-X
    • S. Weintraub, UMT 27, Math. Comp., v. 26, 1972, p. 596.
  • Samuel S. Wagstaff Jr., On $k$-free sequences of integers, Math. Comp. 26 (1972), 767–771. MR 325500, DOI 10.1090/S0025-5718-1972-0325500-5
  • S. S. Wagstaff Jr., On sequences of integers with no $4$, or no $5$ numbers in arithmetical progression, Math. Comp. 21 (1967), 695–699. MR 222009, DOI 10.1090/S0025-5718-1967-0222009-2
  • Daniel Shanks, The infrastructure of a real quadratic field and its applications, Proceedings of the Number Theory Conference (Univ. Colorado, Boulder, Colo., 1972) Univ. Colorado, Boulder, Colo., 1972, pp. 217–224. MR 0389842
  • Daniel Shanks, Five number-theoretic algorithms, Proceedings of the Second Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1972) Congressus Numerantium, No. VII, Utilitas Math., Winnipeg, Man., 1973, pp. 51–70. MR 0371855
    • J. G. Sanderson, (Book Review), Austral. Comput. J., Vol. 4, No. 3, August 1972, p. 144.
  • A. P. Yershov, G. I. Kozhukhin, and U. M. Voloshin, Input language for automatic programming systems, Published for The Automatic Programming Information Centre, Brighton College of Technology, by Academic Press, London-New York, 1963. Authorized translation from the Russian; with an introduction by R. W. Hockney. MR 0173372
    • R. Iturriaga, T. Standish, R. Krutar & J. Earley, The Implementation of Formula Algol, Carnegie Institute of Technology, October 1966; available from DDC (AD 803 577); also, a briefer description is found in [4]. R. Iturriaga, T. Standish, R. Krutar & J. Earley, "Techniques and advantages of using the formal compiler writing system FSL to implement a formula Algol compiler," Proc. SJCC, v. 28, 1966, pp. 241-252. R. P. Brent, "Reducing the retrieval time of scatter storage techniques," Comm. ACM, v. 16, no. 2, February 1973, pp. 105-109.
  • Donald E. Knuth, The art of computer programming. Volume 3, Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1973. Sorting and searching. MR 0445948
    • P. Abrams, An APL Machine, Stanford Linear Accelerator Center, SLAC Report No. 114. R. A. Wagner, Some Techniques for Algorithm Optimization with Application to Matrix Arithmetic Expressions, Doctoral Dissertation, Carnegie-Mellon University, June 1968; available from DDC (AD 678 629). J. Cocke & J. T. Schwartz, Programming Languages and Their Compilers, second revised version, preliminary notes, New York University, April 1970, pp. 306-523. G. J. Lipovski, An Improved Method of Finding all Largest Combinable Classes, University of Illinois, Urbana, Illinois, August 1967; available from DDC (AD 656 608). B. Wegbreit, "An overview of the ECL programming system," SIGPLAN Notices, Vol. 6, No. 12, December 1971, pp. 26-28. R. A. Krutar, "An algebra of assignment," Courant Institute of Mathematical Sciences, SETL Newsletter No. 59, October 1971. See also [13]. J. T. Schwartz, "Sinister calls," Courant Institute of Mathematical Sciences, SETL Newsletter No. 30, May 1971.
Additional Information
  • © Copyright 1974 American Mathematical Society
  • Journal: Math. Comp. 28 (1974), 325-339
  • DOI: https://doi.org/10.1090/S0025-5718-74-99692-6