On the public citation graph
A high-performance fast Fourier transform algorithm for the Cray-2
0 signed · 41 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-0-12-592101-5.50007-5openalex-snapshot
Vectorizing the FFTs**This chapter was written while the author was visiting the Scientific Computing Division at the National Bureau of Standards.
inferredcites →https://doi.org/10.1016/s0167-8191(84)90413-7openalex-snapshot
FFT algorithms for vector computers
inferredcites →https://doi.org/10.1090/s0025-5718-1965-0178586-1openalex-snapshot
An Algorithm for the Machine Calculation of Complex Fourier Series
inferredcites →https://doi.org/10.1090/s0025-5718-81-99783-0openalex-snapshot
A Vector Implementation of the Fast Fourier Transform Algorithm
inferredcites →https://doi.org/10.1109/tassp.1975.1162674openalex-snapshot
The fast Fourier transform
inferredcites →https://doi.org/10.1145/321450.321457openalex-snapshot
An Adaptation of the Fast Fourier Transform for Parallel Processing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4615-3996-4_3openalex-snapshot
Experiments with Parallel Fast Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-1-4757-2736-4_60openalex-snapshot
The Computation of π to 29,360,000 Decimal Digits Using Borweins’ Quartically Convergent Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-3240-5_60openalex-snapshot
The Computation of π to 29,360,000 Decimal Digits Using Borweins’ Quartically Convergent Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-4217-6_60openalex-snapshot
The Computation of π to 29,360,000 Decimal Digits Using Borweins’ Quartically Convergent Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-32377-0_7openalex-snapshot
The computation of π to 29,360,000 decimal digits using Borweins quartically convergent algorithm (1988)
inferred← citeshttps://doi.org/10.1007/bf00129773openalex-snapshot
Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
inferred← citeshttps://doi.org/10.1007/bf00129835openalex-snapshot
Using local memory to boost the performance of FFT algorithms on the CRAY-2 supercomputer
inferred← citeshttps://doi.org/10.1007/bf00156677openalex-snapshot
A multi-algorithm approach to very high performance one-dimensional FFTs
inferred← citeshttps://doi.org/10.1007/bf00162341openalex-snapshot
FFTs in external or hierarchical memory
inferred← citeshttps://doi.org/10.1007/bf01063119openalex-snapshot
Computing the Fourier transform of real data on a hypercube
inferred← citeshttps://doi.org/10.1007/bf01245402openalex-snapshot
High-performance FFT algorithms for the Convex C4/XA supercomputer
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90126-0openalex-snapshot
A general purpose subroutine for fast fourier transform on a distributed memory parallel machine
inferred← citeshttps://doi.org/10.1016/j.parco.2007.09.006openalex-snapshot
Cache-efficient numerical algorithms using graphics hardware
inferred← citeshttps://doi.org/10.1090/s0025-5718-1988-0917835-1openalex-snapshot
Numerical results on the transcendence of constants involving 𝜋,𝑒, and Euler’s constant
inferred← citeshttps://doi.org/10.1090/s0025-5718-1988-0917836-3openalex-snapshot
The computation of 𝜋 to 29,360,000 decimal digits using Borweins’ quartically convergent algorithm
inferred← citeshttps://doi.org/10.1109/arrays.1988.18056openalex-snapshot
Systolic FFT algorithms on Boolean cube networks
inferred← citeshttps://doi.org/10.1109/cse.2011.103openalex-snapshot
Mixed Precision Method for GPU-based FFT
inferred← citeshttps://doi.org/10.1109/dmcc.1990.555406openalex-snapshot
An Efficient FFT Algorithm on Multiprocessors with Distributed Memory
inferred← citeshttps://doi.org/10.1109/dyspan.2008.12openalex-snapshot
A Parallel Computing Based Spectrum Sensing Approach for Signal Detection under Conditions of Low SNR and Rayleigh Multipath Fading
inferred← citeshttps://doi.org/10.1109/superc.1988.44637openalex-snapshot
The fast Fourier transform and sparse matrix computations: a study of two applications on the Horizon supercomputer
inferred← citeshttps://doi.org/10.1109/superc.1994.344263openalex-snapshot
A high performance parallel algorithm for 1-D FFT
inferred← citeshttps://doi.org/10.1145/1878537.1878622openalex-snapshot
Performance analysis of Cooley-Tukey FFT algorithms for a many-core architecture
inferred← citeshttps://doi.org/10.1145/1878537.1878623openalex-snapshot
Revisiting Cramer's rule for solving dense linear systems
inferred← citeshttps://doi.org/10.1145/2355585.2355596openalex-snapshot
A transpose-free in-place SIMD optimized FFT
inferred← citeshttps://doi.org/10.1145/602770.602784openalex-snapshot
A high performance parallel algorithm for 1-D FFT
inferred← citeshttps://doi.org/10.1145/76263.76288openalex-snapshot
FFTs in external of hierarchical memory
inferred← citeshttps://doi.org/10.1177/109434208800200106openalex-snapshot
A High-Performance FFT Algorithm for Vector Supercomputers
inferred← citeshttps://doi.org/10.1177/109434209901300206openalex-snapshot
High Performance FFT Algorithms for Cache-Coherent Multiprocessors
inferred← citeshttps://doi.org/10.5555/602770.602784openalex-snapshot
A high performance parallel algorithm for 1-D FFT
inferred← citeshttps://doi.org/10.5555/62972.62982openalex-snapshot
The fast fourier transform and sparse matrix computations: a study of two applications on teh HORIZON supercomputer
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.