On the public citation graph

Improved upper complexity bounds for the discrete fourier transform

https://doi.org/10.1007/bf01810853
0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-9647-5_20openalex-snapshot
Computation of Fourier Transforms on the Symmetric Group
inferredcites →https://doi.org/10.1007/978-3-642-60487-4_9openalex-snapshot
Die diskrete Fourier-Transformation
inferredcites →https://doi.org/10.1007/978-3-642-64981-3openalex-snapshot
Endliche Gruppen I
inferredcites →https://doi.org/10.1007/978-3-662-00551-4openalex-snapshot
Fast Fourier Transform and Convolution Algorithms
inferredcites →https://doi.org/10.1016/0165-1684(85)90052-0openalex-snapshot
Spectral techniques in digital logic
inferredcites →https://doi.org/10.1016/0196-8858(90)90008-mopenalex-snapshot
Fast Fourier analysis for abelian group extensions
inferredcites →https://doi.org/10.1016/0304-3975(77)90007-xopenalex-snapshot
The complexity of group algebra computations
inferredcites →https://doi.org/10.1016/0304-3975(87)90041-7openalex-snapshot
On the computational complexity of the general discrete fourier transform
inferredcites →https://doi.org/10.1016/0304-3975(89)90021-2openalex-snapshot
Fast generalized Fourier transforms
inferredcites →https://doi.org/10.1016/0378-4754(81)90075-6openalex-snapshot
Fast fourier transform and convolution algorithms
inferredcites →https://doi.org/10.1016/b978-0-12-400060-5.x5001-0openalex-snapshot
Spectral Techniques and Fault Detection
inferredcites →https://doi.org/10.1038/250610b0openalex-snapshot
Computers in mathematics
inferredcites →https://doi.org/10.1073/pnas.73.4.1005openalex-snapshot
On computing the Discrete Fourier Transform
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/s0894-0347-1990-1030655-4openalex-snapshot
Efficient Computation of the Fourier Transform on Finite Groups
inferredcites →https://doi.org/10.1109/proc.1968.6477openalex-snapshot
Discrete Fourier transforms when the number of data samples is prime
inferredcites →https://doi.org/10.1109/tau.1970.1162132openalex-snapshot
A linear filtering approach to the computation of discrete Fourier transform
inferredcites →https://doi.org/10.1109/tc.1977.1674739openalex-snapshot
Fast Fourier Transforms on Finite Non-Abelian Groups
inferredcites →https://doi.org/10.1137/0218040openalex-snapshot
Fast Fourier Transforms for Metabelian Groups
inferredcites →https://doi.org/10.1137/0220028openalex-snapshot
Some Lower and Upper Complexity Bounds for Generalized Fourier Transforms and their Inverses
inferredcites →https://doi.org/10.1137/1.9781611970364openalex-snapshot
Arithmetic Complexity of Computations
inferredcites →https://doi.org/10.2307/2153230openalex-snapshot
Computers in Mathematics.
inferredcites →https://doi.org/10.7551/mitpress/5222.003.0018openalex-snapshot
A Linear Filtering Approach to the Computation of the Discrete Fourier Transform

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-4614-6624-6_86-1openalex-snapshot
Gomory Group Minimization Problem and Its Applications
inferred← citeshttps://doi.org/10.1007/bf01200062openalex-snapshot
Existence and efficient construction of fast Fourier transforms on supersolvable groups
inferred← citeshttps://doi.org/10.1007/bf02510144openalex-snapshot
Double coset decompositions and computational harmonic analysis on groups
inferred← citeshttps://doi.org/10.1007/bfb0021003openalex-snapshot
Towards an “Erlangen program” for general linear systems theory
inferred← citeshttps://doi.org/10.1007/s00041-017-9555-5openalex-snapshot
The Efficient Computation of Fourier Transforms on Semisimple Algebras
inferred← citeshttps://doi.org/10.1007/s00454-003-2946-1openalex-snapshot
The Power of Nonmonotonicity in Geometric Searching
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00044-2openalex-snapshot
Variations on computing reciprocals of power series
inferred← citeshttps://doi.org/10.1080/10586458.1992.10504252openalex-snapshot
Fast Fourier Analysis for SL2over a Finite Field and Related Numerical Experiments
inferred← citeshttps://doi.org/10.1090/s0894-0347-97-00219-1openalex-snapshot
Separation of variables and the computation of Fourier transforms on finite groups, I
inferred← citeshttps://doi.org/10.1117/12.434210openalex-snapshot
Fast quantum Fourier-Weyl-Heisenberg transforms
inferred← citeshttps://doi.org/10.1137/23m1611348openalex-snapshot
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
inferred← citeshttps://doi.org/10.1145/513400.513411openalex-snapshot
The power of nonmonotonicity in geometric searching
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0411037openalex-snapshot
The Hidden Subgroup Problem - Review and Open Problems
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.