1. D. H. Bailey, “A high-performance fast Fourier transform algorithm for the Cray-2,” J. Supercomputing, v. 1, 1987, pp. 43–60.
2. P. Beckmann, A History of Pi, Golem Press, Boulder, CO, 1971.
3. A. Borodin & I. Munro, The Computational Complexity of Algebraic and Numeric Problems, American Elsevier, New York, 1975.
4. J. M. Borwein & P. B. Borwein, “The arithmetic-geometric mean and fast computation of elementary functions,” SIAM Rev., v. 26, 1984, pp. 351–366.
5. J. M. Borwein & P. B. Borwein, “More quadratically converging algorithms for π,” Math. Comp., v. 46, 1986, pp. 247–253.