[1]	Tsz-Wo Sze. Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers, April 2011. [ bib \| .pdf ]
[2]	Tsz-Wo Sze. The two quadrillionth bit of Pi is 0! Distributed computation of Pi with Apache Hadoop. CoRR, abs/1008.3171, 2010. [ bib \| http ]
[3]	George Marsaglia. On the randomness of pi and other decimal expansions. InterStat, 5, 2005. [ bib \| .html ]
[4]	George Marsaglia. Refutation of claims such as “Pi is less random than we thought”. Interstat, 2006. [ bib \| .pdf ]
[5]	Shu-Ju Tu and Ephraim Fischbach. A study on the randomness of the digits of π. Int J Mod Phys C, 16:281-294, 2005. [ bib \| DOI ]
[6]	Greg Rose. KISS: A bit too simple. 2011. [ bib \| .pdf ]
[7]	F. Bellard. Computation of 2700 billion decimal digits of Pi using a desktop computer, 2009. [ bib \| .pdf ]
[8]	D. Takahashi. Parallel implementation of multiple-precision arithmetic and 2,576,980,370,000 decimal digits of π calculation. Parallel computing, 36(8):439-448, 2010. [ bib \| .txt ]
[9]	J.M. Borwein and P.B. Borwein. Pi and the AGM: a study in analytic number theory and computational complexity. Pi and the Agm. Wiley, 1998. [ bib \| http ]
[10]	Tsz-Wo Sze. Computing 10.59 trillion decimal digits of Pi with IBM BlueGene. [ bib ]
[11]	D.H. Bailey, J.M. Borwein, A. Mattingly, and G. Wightwick. The computation of previously inaccessible digits of π2 and catalan's constant. Prepared for Notices of the AMS, 2011. [ bib \| .pdf ]
[12]	D.H. Bailey. A compendium of BBP-type formulas for mathematical constants. Preprint, 2000. [ bib \| .html ]
[13]	D.H. Bailey. The bbp algorithm for pi. Info:. [ bib \| http ]
[14]	D. Bailey, P. Borwein, and S. Plouffe. On the rapid computation of various polylogarithmic constants. Mathematics of Computation, 66(218):903-914, 1997. [ bib \| .pdf ]

This file was generated by bibtex2html 1.95.