Bailey's FFT algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Bailey's FFT algorithm" in English language version.

refsWebsite

Global rank English rank

5worldcat.org

5^th place

5doi.org

2^nd place

2semanticscholar.org

11^th place

8^th place

1books.google.com

3^rd place

1warwick.ac.uk

4,378^th place

2,689^th place

1rit.edu

8,676^th place

6,229^th place

1davidhbailey.com

low place

1harvard.edu

18^th place

17^th place

1psu.edu

207^th place

136^th place

books.google.com

Arndt 2010, p. 438. Arndt, Jörg (1 October 2010). "The Matrix Fourier Algorithm (MFA)". Matters Computational: Ideas, Algorithms, Source Code. Springer Science & Business Media. pp. 438–439. ISBN 978-3-642-14764-7. OCLC 1005788763.

davidhbailey.com

Bailey 1989, p. 2. Bailey, D. H. (March 1989). "FFTS in external of hierarchical memory" (PDF). Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89. Vol. 4. ACM Press. pp. 23–35. doi:10.1145/76263.76288. ISBN 0897913418. S2CID 52809390.

doi.org

Hart, Tornaría & Watkins 2010, p. 191. Hart, William B.; Tornaría, Gonzalo; Watkins, Mark (2010). "Congruent Number Theta Coefficients to 10¹²" (PDF). Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 6197. Springer Berlin Heidelberg. pp. 186–200. doi:10.1007/978-3-642-14518-6_17. eISSN 1611-3349. ISBN 978-3-642-14517-9. ISSN 0302-9743.
Bailey 1989, p. 2. Bailey, D. H. (March 1989). "FFTS in external of hierarchical memory" (PDF). Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89. Vol. 4. ACM Press. pp. 23–35. doi:10.1145/76263.76288. ISBN 0897913418. S2CID 52809390.
Frigo & Johnson 2005, p. 2. Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. ISSN 0018-9219. S2CID 6644892.
Al Na'mneh & Pan 2007, pp. 191–192. Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190.
Al Na'mneh & Pan 2007. Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190.

harvard.edu

ui.adsabs.harvard.edu

Frigo & Johnson 2005, p. 2. Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. ISSN 0018-9219. S2CID 6644892.

psu.edu

citeseerx.ist.psu.edu

Frigo & Johnson 2005, p. 2. Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. ISSN 0018-9219. S2CID 6644892.

rit.edu

cis.rit.edu

Gentleman, W.M.; Sande, G. (1966). "Fast Fourier Transforms—For Fun and Profit" (PDF). AFIPS Conference Proceedings Volume 29. Fall Joint Computer Conference, November 7-10, 1966. San Francisco, California. pp. 563–578.

semanticscholar.org

api.semanticscholar.org

Bailey 1989, p. 2. Bailey, D. H. (March 1989). "FFTS in external of hierarchical memory" (PDF). Proceedings of the 1989 ACM/IEEE conference on Supercomputing - Supercomputing '89. Vol. 4. ACM Press. pp. 23–35. doi:10.1145/76263.76288. ISBN 0897913418. S2CID 52809390.
Frigo & Johnson 2005, p. 2. Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. ISSN 0018-9219. S2CID 6644892.

warwick.ac.uk

wrap.warwick.ac.uk

Hart, Tornaría & Watkins 2010, p. 191. Hart, William B.; Tornaría, Gonzalo; Watkins, Mark (2010). "Congruent Number Theta Coefficients to 10¹²" (PDF). Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 6197. Springer Berlin Heidelberg. pp. 186–200. doi:10.1007/978-3-642-14518-6_17. eISSN 1611-3349. ISBN 978-3-642-14517-9. ISSN 0302-9743.

worldcat.org

search.worldcat.org

Arndt 2010, p. 438. Arndt, Jörg (1 October 2010). "The Matrix Fourier Algorithm (MFA)". Matters Computational: Ideas, Algorithms, Source Code. Springer Science & Business Media. pp. 438–439. ISBN 978-3-642-14764-7. OCLC 1005788763.
Hart, Tornaría & Watkins 2010, p. 191. Hart, William B.; Tornaría, Gonzalo; Watkins, Mark (2010). "Congruent Number Theta Coefficients to 10¹²" (PDF). Algorithmic Number Theory. Lecture Notes in Computer Science. Vol. 6197. Springer Berlin Heidelberg. pp. 186–200. doi:10.1007/978-3-642-14518-6_17. eISSN 1611-3349. ISBN 978-3-642-14517-9. ISSN 0302-9743.
Frigo & Johnson 2005, p. 2. Frigo, M.; Johnson, S.G. (February 2005). "The Design and Implementation of FFTW3". Proceedings of the IEEE. 93 (2): 216–231. Bibcode:2005IEEEP..93..216F. CiteSeerX 10.1.1.66.3097. doi:10.1109/JPROC.2004.840301. ISSN 0018-9219. S2CID 6644892.
Al Na'mneh & Pan 2007, pp. 191–192. Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190.
Al Na'mneh & Pan 2007. Al Na'mneh, Rami; Pan, W. David (March 2007). "Five-step FFT algorithm with reduced computational complexity". Information Processing Letters. 101 (6): 262–267. doi:10.1016/j.ipl.2006.10.009. ISSN 0020-0190.