On the public citation graph
Generating and Searching Families of FFT Algorithms
0 signed · 48 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.1002/9781119942306.ch6openalex-snapshot
The Fast Fourier Transform and its Applications
inferredcites →https://doi.org/10.1007/11814948_18openalex-snapshot
On SAT Modulo Theories and Optimization Problems
inferredcites →https://doi.org/10.1007/978-1-4612-3912-3openalex-snapshot
Multiplicative Complexity, Convolution, and the DFT
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_28openalex-snapshot
The MathSAT 4 SMT Solver
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_16openalex-snapshot
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
inferredcites →https://doi.org/10.1007/978-3-642-02658-4_53openalex-snapshot
Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic
inferredcites →https://doi.org/10.1007/978-3-642-12002-2_8openalex-snapshot
Satisfiability Modulo the Theory of Costs: Foundations and Applications
inferredcites →https://doi.org/10.1007/978-3-642-14186-7_11openalex-snapshot
Symmetry and Satisfiability: An Update
inferredcites →https://doi.org/10.1007/s00607-007-0222-6openalex-snapshot
A new matrix approach to real FFTs and convolutions of length 2 k
inferredcites →https://doi.org/10.1007/s10817-010-9176-zopenalex-snapshot
A Framework for Certified Boolean Branch-and-Bound Optimization
inferredcites →https://doi.org/10.1016/0165-1684(90)90081-9openalex-snapshot
Multiplicative complexity, convolution, and the DFT
inferredcites →https://doi.org/10.1016/0165-1684(90)90158-uopenalex-snapshot
Fast fourier transforms: A tutorial review and a state of the art
inferredcites →https://doi.org/10.1016/j.entcs.2005.12.001openalex-snapshot
Encoding RTL Constructs for MathSAT: a Preliminary Report
inferredcites →https://doi.org/10.1049/el:19890225openalex-snapshot
Conjugate pair fast 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.1109/29.60070openalex-snapshot
Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
inferredcites →https://doi.org/10.1109/5992.814659openalex-snapshot
The FFT: an algorithm the whole family can use
inferredcites →https://doi.org/10.1109/tassp.1986.1164785openalex-snapshot
On the number of multiplications necessary to compute a length-2nDFT
inferredcites →https://doi.org/10.1109/tassp.1986.1164804openalex-snapshot
On computing the split-radix FFT
inferredcites →https://doi.org/10.1109/tsp.2006.882087openalex-snapshot
A Modified Split-Radix FFT With Fewer Arithmetic Operations
inferredcites →https://doi.org/10.1137/1.9781611970364openalex-snapshot
Arithmetic Complexity of Computations
inferredcites →https://doi.org/10.1145/1065579.1065703openalex-snapshot
Automatic generation of customized discrete fourier transform IPs
inferredcites →https://doi.org/10.1145/1217856.1217859openalex-snapshot
Solving SAT and SAT Modulo Theories
inferredcites →https://doi.org/10.1145/1476589.1476610openalex-snapshot
An economical method for calculating the discrete Fourier transform
inferredcites →https://doi.org/10.1145/1629911.1630057openalex-snapshot
Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1145/378239.378470openalex-snapshot
Circuit-based Boolean Reasoning
inferredcites →https://doi.org/10.1145/800152.804900openalex-snapshot
Polynomial evaluation via the division algorithm the fast Fourier transform revisited
inferredcites →https://doi.org/10.3233/978-1-58603-929-5-289openalex-snapshot
Symmetry and Satisfiability
inferredcites →https://doi.org/10.3233/sat190014openalex-snapshot
Translating Pseudo-Boolean Constraints into SAT
inferredcites →https://doi.org/10.35011/fmvtr.2010-1openalex-snapshot
Lingeling, Plingeling, PicoSAT and PrecoSAT at SAT Race 2010
inferredcites →https://doi.org/10.5555/367072.367288openalex-snapshot
LPSAT: a unified approach to RTL satisfiability
inferredcites →https://doi.org/10.5555/832284.835389openalex-snapshot
RTL-Datapath Verification using Integer Linear Programming
inferredcites →https://doi.org/10.5860/choice.26-3285openalex-snapshot
The fast Fourier transform and its applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1063/5.0025260openalex-snapshot
Mathematical modelling for the design of DFT processor using resource sharing
inferred← citeshttps://doi.org/10.1063/5.0109408openalex-snapshot
Experimental research of the overhead contact line pylons of electrified transport
inferred← citeshttps://doi.org/10.1109/csit56902.2022.10000535openalex-snapshot
Filtering of the fine-structured components of images with textual information by the TextSmooth software
inferred← citeshttps://doi.org/10.1109/dcabes.2014.29openalex-snapshot
Parallel Computing for the Radix-2 Fast Fourier Transform
inferred← citeshttps://doi.org/10.1109/icassp.2013.6638123openalex-snapshot
Brute-force search of fast convolution algorithms
inferred← citeshttps://doi.org/10.1109/iwssip55020.2022.9854425openalex-snapshot
Recognition of the astronomical images using the Sobel filter
inferred← citeshttps://doi.org/10.1109/tcsi.2022.3159803openalex-snapshot
One-Step Calculation Circuit of FFT and Its Application
inferred← citeshttps://doi.org/10.1109/tifs.2024.3390995openalex-snapshot
Discrete Spectral Encryption of Single-Carrier Signals With Pseudo Random Dynamic Keys
inferred← citeshttps://doi.org/10.1134/s0032946017030103openalex-snapshot
On the real complexity of a complex DFT
inferred← citeshttps://doi.org/10.1145/3564246.3585188openalex-snapshot
Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix Non-rigidity
inferred← citeshttps://doi.org/10.15587/1729-4061.2022.265309openalex-snapshot
Development of computational method for matched filtration with analytical profile of the blurred digital image
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.