On the public citation graph
Discrete Fourier transforms when the number of data samples is prime
0 signed · 489 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.1109/tau.1967.1161899openalex-snapshot
What is the fast Fourier transform?
inferredcites →https://doi.org/10.1145/1464182.1464209openalex-snapshot
High-speed convolution and correlation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611203.ch3openalex-snapshot
Linear Time‐Frequency Analysis I: Fourier‐Type Representations
inferred← citeshttps://doi.org/10.1002/cpe.4330030503openalex-snapshot
Two approaches to the concurrent implementation of the prime factor algorithm on a hypercube
inferred← citeshttps://doi.org/10.1002/cpe.4330070104openalex-snapshot
Pipeline optimizations of the prime factor algorithm
inferred← citeshttps://doi.org/10.1002/cta.4490160103openalex-snapshot
A multiplier‐free dft algorithm using differential coding of coefficients
inferred← citeshttps://doi.org/10.1002/ecjc.4430720512openalex-snapshot
A new DSP‐oriented FFT algorithm
inferred← citeshttps://doi.org/10.1002/mas.21422openalex-snapshot
Fourier transform ion cyclotron resonance (FT ICR) mass spectrometry: Theory and simulations
inferred← citeshttps://doi.org/10.1002/mma.4767openalex-snapshot
Fast algorithm of adaptive Fourier series
inferred← citeshttps://doi.org/10.1002/nla.563openalex-snapshot
A fast full multigrid solver for applications in image processing
inferred← citeshttps://doi.org/10.1007/1-4020-2307-3_9openalex-snapshot
Recent Progress and Applications in Group FFTs
inferred← citeshttps://doi.org/10.1007/3-540-15983-5_8openalex-snapshot
Algebraic and symbolic computation in digital signal processing, coding and cryptography
inferred← citeshttps://doi.org/10.1007/3-540-26598-8_16openalex-snapshot
The Chinese Remainder Theorem and Simultaneous Congruences
inferred← citeshttps://doi.org/10.1007/3-540-31186-6_22openalex-snapshot
Fast Component-by-Component Construction, a Reprise for Different Kernels
inferred← citeshttps://doi.org/10.1007/3-540-45545-0_17openalex-snapshot
Automatic Performance Tuning in the UHFFT Library
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_59openalex-snapshot
Fast integer multiplication by block recursive, number theoretical transforms
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_70openalex-snapshot
Algorithms explained by symmetries
inferred← citeshttps://doi.org/10.1007/978-0-387-75724-7_7openalex-snapshot
The Fast Fourier Transform (FFT)
inferred← citeshttps://doi.org/10.1007/978-0-8176-8220-0_3openalex-snapshot
Fast Fourier Transform Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4684-6393-4_3openalex-snapshot
Two Dimensional FFT Algorithms on Data Admitting 90°-Rotational Symmetry
inferred← citeshttps://doi.org/10.1007/978-1-4684-6888-5_10openalex-snapshot
Fourier Transform Algorithms for Spectral Analysis Derived with MACSYMA
inferred← citeshttps://doi.org/10.1007/978-1-4757-2767-8_14openalex-snapshot
Multiplicative Characters and the FT
inferred← citeshttps://doi.org/10.1007/978-1-4757-2767-8_8openalex-snapshot
Multiplicative Fourier Transform Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4757-3854-4_14openalex-snapshot
Multiplicative Characters and the FFT
inferred← citeshttps://doi.org/10.1007/978-1-4757-3854-4_8openalex-snapshot
Introduction to Multiplicative Fourier Transform Algorithm (MFTA)
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_8openalex-snapshot
Prime Length Symmetric FFTS and Their Computer Implementations
inferred← citeshttps://doi.org/10.1007/978-1-4899-0918-3_9openalex-snapshot
Number Theoretic Transformation Techniques
inferred← citeshttps://doi.org/10.1007/978-1-84882-409-6_13openalex-snapshot
Short-Vector SIMD Parallelization in Signal Processing
inferred← citeshttps://doi.org/10.1007/978-3-030-01812-2_2openalex-snapshot
Digital Sound and Discrete Fourier Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-02940-1_2openalex-snapshot
Digital Sound and Discrete Fourier Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-42071-0_18openalex-snapshot
Fast Algorithms for Join Operations on Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-030-43229-4_15openalex-snapshot
Exploiting Symmetries of Small Prime-Sized DFTs
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_27openalex-snapshot
A Generic Convolution Algorithm for Join Operations on Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-031-38548-3_2openalex-snapshot
Does the Dual-Sieve Attack on Learning with Errors Even Work?
inferred← citeshttps://doi.org/10.1007/978-3-031-54773-7_2openalex-snapshot
Algorithmic Views of Vectorized Polynomial Multipliers – NTRU Prime
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_5openalex-snapshot
CryptAttackTester: high-assurance attack analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-80165-5_7openalex-snapshot
Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_12openalex-snapshot
Fully Homomorphic Encryption for Matrix Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_16openalex-snapshot
Efficient Bootstrapping in Fully Homomorphic Encryption for Matrix Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_18openalex-snapshot
Fast Batch Matrix Multiplication in Ciphertexts
inferred← citeshttps://doi.org/10.1007/978-3-319-09967-5_15openalex-snapshot
An Input-Adaptive Algorithm for High Performance Sparse Fast Fourier Transform
inferred← citeshttps://doi.org/10.1007/978-3-319-33507-0_12openalex-snapshot
Computational Higher Order Quasi-Monte Carlo Integration
inferred← citeshttps://doi.org/10.1007/978-3-319-98684-5_2openalex-snapshot
Generalized Iterated Wreath Products of Cyclic Groups and Rooted Trees Correspondence
inferred← citeshttps://doi.org/10.1007/978-3-540-78879-9_3openalex-snapshot
Spectral Analysis Methods for Periodic and Non-Periodic Signals
inferred← citeshttps://doi.org/10.1007/978-3-540-85298-8_17openalex-snapshot
The Chinese Remainder Theorem and Simultaneous Congruences
inferred← citeshttps://doi.org/10.1007/978-3-540-89894-8_29openalex-snapshot
Optimization of Fast Fourier Transforms on the Blue Gene/L Supercomputer
inferred← citeshttps://doi.org/10.1007/978-3-642-13374-9_10openalex-snapshot
DFT Performance Prediction in FFTW
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_8openalex-snapshot
Faster Polynomial Multiplication via Discrete Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-3-642-25516-8_2openalex-snapshot
Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-81897-4_5openalex-snapshot
Linear Filtering Computation of Discrete Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-3-642-81897-4_7openalex-snapshot
Computation of Discrete Fourier Transforms by Polynomial Transforms
inferred← citeshttps://doi.org/10.1007/978-3-642-82568-2_4openalex-snapshot
Die numerische Ausführung der diskreten Fourier-Transformation
inferred← citeshttps://doi.org/10.1007/978-3-662-00551-4_5openalex-snapshot
Linear Filtering Computation of Discrete Fourier Transforms
inferred← citeshttps://doi.org/10.1007/978-3-662-00551-4_7openalex-snapshot
Computation of Discrete Fourier Transforms by Polynomial Transforms
inferred← citeshttps://doi.org/10.1007/978-3-662-02395-2_16openalex-snapshot
The Chinese Remainder Theorem and Simultaneous Congruences
inferred← citeshttps://doi.org/10.1007/978-3-662-03430-9_16openalex-snapshot
The Chinese Remainder Theorem and Simultaneous Congruences
inferred← citeshttps://doi.org/10.1007/978-3-662-22246-1_16openalex-snapshot
The Chinese Remainder Theorem and Simultaneous Congruences
inferred← citeshttps://doi.org/10.1007/978-94-009-7121-9_10openalex-snapshot
Fast Fourier Transform Algorithms with Applications
inferred← citeshttps://doi.org/10.1007/978-94-009-8543-8_1openalex-snapshot
Application of Complexity of Computations to Signal Processing
inferred← citeshttps://doi.org/10.1007/978-94-010-0662-0_8openalex-snapshot
Lesser Known FFT Algorithms
inferred← citeshttps://doi.org/10.1007/978-94-011-3036-3_22openalex-snapshot
Linear Signal Processing Architectures
inferred← citeshttps://doi.org/10.1007/978-981-33-6632-9_27openalex-snapshot
Fast Fourier Transform in Planar3D Model Using an Explicit Numerical Integration Scheme
inferred← citeshttps://doi.org/10.1007/978-981-95-5122-4_5openalex-snapshot
Carousel: Fully Homomorphic Encryption with Bootstrapping over Automorphism Group
inferred← citeshttps://doi.org/10.1007/978-981-97-5028-3_5openalex-snapshot
Pushing the Limit of Vectorized Polynomial Multiplications for NTRU Prime
inferred← citeshttps://doi.org/10.1007/978-981-97-5028-3_6openalex-snapshot
Jumping for Bernstein-Yang Inversion
inferred← citeshttps://doi.org/10.1007/bf00611079openalex-snapshot
Numerical treatment of fourier-spectrometer interferograms
inferred← citeshttps://doi.org/10.1007/bf01038118openalex-snapshot
The fast Fourier transform in computational physics (review)
inferred← citeshttps://doi.org/10.1007/bf01810853openalex-snapshot
Improved upper complexity bounds for the discrete fourier transform
inferred← citeshttps://doi.org/10.1007/bf01880272openalex-snapshot
2D grid architectures for the DFT and the 2D DFT
inferred← citeshttps://doi.org/10.1007/bf02510144openalex-snapshot
Double coset decompositions and computational harmonic analysis on groups
inferred← citeshttps://doi.org/10.1007/bf02998222openalex-snapshot
Transformations de Fourier discrètes: algorithmes rapides
inferred← citeshttps://doi.org/10.1007/bf03025807openalex-snapshot
Ring structure and the fourier transform
inferred← citeshttps://doi.org/10.1007/bfb0057595openalex-snapshot
Two-Dimensional Convolution and DFT Computation
inferred← citeshttps://doi.org/10.1007/bfb0057596openalex-snapshot
Winograd's Discrete Fourier Transform Algorithm
inferred← citeshttps://doi.org/10.1007/s00034-015-0106-5openalex-snapshot
Real-Time FFT Computation Using GPGPU for OFDM-Based Systems
inferred← citeshttps://doi.org/10.1007/s00034-019-01256-1openalex-snapshot
Design and Implementation of a High-Performance and High-Speed Architecture for Wideband Spectrum Sensing in Cognitive Radio Networks
inferred← citeshttps://doi.org/10.1007/s00041-011-9210-5openalex-snapshot
Efficient Algorithms for the Discrete Gabor Transform with a Long Fir Window
inferred← citeshttps://doi.org/10.1007/s00145-025-09560-7openalex-snapshot
Accurate Score Prediction for Dual-Sieve Attacks
inferred← citeshttps://doi.org/10.1007/s00607-007-0222-6openalex-snapshot
A new matrix approach to real FFTs and convolutions of length 2 k
inferred← citeshttps://doi.org/10.1007/s10559-021-00426-xopenalex-snapshot
Block-Cyclic Structuring of the Basis of Fourier Transforms Based on Cyclic Substitution
inferred← citeshttps://doi.org/10.1007/s10623-012-9720-4openalex-snapshot
Fully homomorphic SIMD operations
inferred← citeshttps://doi.org/10.1007/s11265-005-4175-8openalex-snapshot
Biorthogonal Recombination Nonuniform Cosine-Modulated Filter Banks and their Multiplier-Less Realizations
inferred← citeshttps://doi.org/10.1007/s11265-018-1393-4openalex-snapshot
Design Space Exploration of 1-D FFT Processor
inferred← citeshttps://doi.org/10.1007/s11390-014-1484-zopenalex-snapshot
Memory Efficient Two-Pass 3D FFT Algorithm for Intel® Xeon PhiTM Coprocessor
inferred← citeshttps://doi.org/10.1007/s40993-020-00213-1openalex-snapshot
Efficient computation of the Euler–Kronecker constants of prime cyclotomic fields
inferred← citeshttps://doi.org/10.1007/s40993-022-00402-0openalex-snapshot
Fast norm computation in smooth-degree Abelian number fields
inferred← citeshttps://doi.org/10.1007/s42514-025-00232-3openalex-snapshot
Implementation and optimization of batch 3D FFT for sunway many-core processor
inferred← citeshttps://doi.org/10.1007/s42600-022-00250-yopenalex-snapshot
Quantitative analysis of second harmonic generated images of collagen fibers: a review
inferred← citeshttps://doi.org/10.1016/0001-8708(79)90037-9openalex-snapshot
On the multiplicative complexity of the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1016/0016-0032(88)90031-2openalex-snapshot
Fast Fourier Transformation Based on Number Theoretic Transforms
inferred← citeshttps://doi.org/10.1016/0024-3795(80)90253-0openalex-snapshot
Matrix identities of the fast fourier transform
inferred← citeshttps://doi.org/10.1016/0024-3795(82)90217-8openalex-snapshot
Winograd's fourier transform via circulants
inferred← citeshttps://doi.org/10.1016/0045-7906(81)90030-6openalex-snapshot
A comparison of DFT algorithms using a residue architecture
inferred← citeshttps://doi.org/10.1016/0045-7906(91)90020-zopenalex-snapshot
An array architecture for computing two-dimensional discrete Hartley transforms
inferred← citeshttps://doi.org/10.1016/0094-5765(89)90086-6openalex-snapshot
VLSI processors for signal detection in SETI
inferred← citeshttps://doi.org/10.1016/0165-1684(85)90035-0openalex-snapshot
Fast mersenne number transforms for the computation of discrete fourier transforms
inferred← citeshttps://doi.org/10.1016/0165-1684(90)90158-uopenalex-snapshot
Fast fourier transforms: A tutorial review and a state of the art
inferred← citeshttps://doi.org/10.1016/0165-6074(87)90017-2openalex-snapshot
A real-time image compressor using a modular signal-processing system employing occam and the transputer
inferred← citeshttps://doi.org/10.1016/0167-8191(94)90082-5openalex-snapshot
Special purpose hardware for discrete Fourier transform implementation
inferred← citeshttps://doi.org/10.1016/0196-6774(80)90022-xopenalex-snapshot
Average running time of the fast Fourier transform
inferred← citeshttps://doi.org/10.1016/0196-6774(81)90016-xopenalex-snapshot
The bit-complexity of arithmetic algorithms
inferred← citeshttps://doi.org/10.1016/0196-8858(84)90004-6openalex-snapshot
The construction of orthonormal bases diagonalizing the Discrete Fourier Transform
inferred← citeshttps://doi.org/10.1016/0196-8858(85)90016-8openalex-snapshot
Ring structures and the discrete Fourier transform
inferred← citeshttps://doi.org/10.1016/0196-8858(86)90039-4openalex-snapshot
Multiplicative characters and the discrete Fourier transform
inferred← citeshttps://doi.org/10.1016/0196-8858(89)90012-2openalex-snapshot
Modified Winograd FFT algorithm and its variants for transform size N = p and their implementations
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90021-2openalex-snapshot
Fast generalized Fourier transforms
inferred← citeshttps://doi.org/10.1016/0378-4754(89)90138-9openalex-snapshot
Knowledge-based FFT and convolution synthesis for any number of points
inferred← citeshttps://doi.org/10.1016/0743-7315(85)90025-5openalex-snapshot
Fast fourier transform processors using Gaussian residue arithmetic
inferred← citeshttps://doi.org/10.1016/b978-0-12-047145-4.50010-9openalex-snapshot
Discrete and Fast Fourier Transform Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-12-506995-3.50010-2openalex-snapshot
Efficient Finite Field Algorithms
inferred← citeshttps://doi.org/10.1016/b978-0-44-323837-6.00012-0openalex-snapshot
Scientific computing tools
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50016-3openalex-snapshot
Algebraic Complexity Theory
inferred← citeshttps://doi.org/10.1016/j.apt.2019.07.004openalex-snapshot
Identification and characterization of solids in sand-water two-phase flows via vibration multi-sensor approaches
inferred← citeshttps://doi.org/10.1016/j.cej.2021.129173openalex-snapshot
Multi-scale characterization and identification of dilute solid particles impacting walls within an oil-conveying flow with an experimental evaluation by dual vibration sensors
inferred← citeshttps://doi.org/10.1016/j.chaos.2005.08.081openalex-snapshot
Fast algorithm for “error-free” convolution computation using Mersenne–Lucas codes
inferred← citeshttps://doi.org/10.1016/j.cherd.2019.07.029openalex-snapshot
Experimental evaluation of sand particle identification in oil–water–gas multiphase flows based on vibration signal analysis
inferred← citeshttps://doi.org/10.1016/j.dsp.2013.10.018openalex-snapshot
Efficient algorithms for computing the new Mersenne number transform
inferred← citeshttps://doi.org/10.1016/j.engfailanal.2015.10.016openalex-snapshot
Significant damages of core diamond bits in the process of rocks drilling
inferred← citeshttps://doi.org/10.1016/j.future.2026.108675openalex-snapshot
DRFFT: A dynamic and double radix FFT framework based on Ascend NPU
inferred← citeshttps://doi.org/10.1016/j.ins.2004.10.001openalex-snapshot
Fast, prime factor, discrete Fourier transform algorithms over GF(2 ) for 8 ⩽m⩽ 10
inferred← citeshttps://doi.org/10.1016/j.jco.2016.03.001openalex-snapshot
Even faster integer multiplication
inferred← citeshttps://doi.org/10.1016/j.jmaa.2024.128368openalex-snapshot
The Kummer ratio of the relative class number for prime cyclotomic fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2020.12.017openalex-snapshot
Numerical verification of Littlewood's bounds for |L(1,χ)|
inferred← citeshttps://doi.org/10.1016/j.jnt.2022.12.003openalex-snapshot
A unified strategy to compute some special functions of number-theoretic interest
inferred← citeshttps://doi.org/10.1016/j.jsc.2002.06.001openalex-snapshot
Automatic derivation and implementation of fast convolution algorithms
inferred← citeshttps://doi.org/10.1016/j.laa.2025.01.010openalex-snapshot
A low-complexity algorithm to search for Legendre pairs
inferred← citeshttps://doi.org/10.1016/j.measurement.2014.06.025openalex-snapshot
Measurement and processing of vibro-acoustic signal from the process of rock disintegration by rotary drilling
inferred← citeshttps://doi.org/10.1016/j.powtec.2018.12.053openalex-snapshot
Non-intrusive characterization of sand particles dispersed in gas–water bubbly flow using straight and bent pipes with vibration sensing
inferred← citeshttps://doi.org/10.1016/j.powtec.2019.04.059openalex-snapshot
Vibration multisensor fusion method for the identification and characterization of sand particles in dispersions of oil in water flow
inferred← citeshttps://doi.org/10.1016/j.sigpro.2005.10.022openalex-snapshot
Bilinear algorithms for discrete cosine transforms of prime lengths
inferred← citeshttps://doi.org/10.1016/j.sigpro.2013.08.004openalex-snapshot
Acquisition of modern GNSS signals using a modified parallel code-phase search architecture
inferred← citeshttps://doi.org/10.1016/j.sigpro.2015.01.008openalex-snapshot
Datapath-regular implementation and scaled technique for N=3×2 DFTs
inferred← citeshttps://doi.org/10.1016/j.sigpro.2023.109080openalex-snapshot
Local discrete fractional fourier transform: An algorithm for calculating partial points of DFrFT
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.09.029openalex-snapshot
A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115392openalex-snapshot
Full domain functional bootstrapping using the prime cyclotomic ring
inferred← citeshttps://doi.org/10.1016/s1570-8659(05)80017-1openalex-snapshot
Approximation and interpolation theory
inferred← citeshttps://doi.org/10.1017/9781009701297.012openalex-snapshot
The Cooley-Tukey FFT and Group Theory
inferred← citeshttps://doi.org/10.1017/cbo9780511760921openalex-snapshot
Fast Algorithms for Signal Processing
inferred← citeshttps://doi.org/10.1017/s0962492913000044openalex-snapshot
High-dimensional integration: The quasi-Monte Carlo way
inferred← citeshttps://doi.org/10.1023/a:1008160021085openalex-snapshot
High-Performance Radix-2, 3 and 5 Parallel 1-D Complex FFT Algorithms for Distributed-Memory Parallel Computers
inferred← citeshttps://doi.org/10.1038/s41598-021-86718-wopenalex-snapshot
Identifying unknown Indian wolves by their distinctive howls: its potential as a non-invasive survey method
inferred← citeshttps://doi.org/10.1049/cje.2020.03.012openalex-snapshot
An FFT‐Based High SNR MWC Back‐End Architecture with Analog Low‐Pass Filter Compensation
inferred← citeshttps://doi.org/10.1049/el.2009.3330openalex-snapshot
Efficient computation of DFT of Zadoff-Chu sequences
inferred← citeshttps://doi.org/10.1049/iet-cds.2018.5200openalex-snapshot
DFT processor implementation scheme based on Rader algorithm
inferred← citeshttps://doi.org/10.1049/iet-com.2017.0837openalex-snapshot
High‐throughput and compact FFT architectures using the Good–Thomas and Winograd algorithms
inferred← citeshttps://doi.org/10.1049/iet-cvi.2013.0101openalex-snapshot
Exact image representation via a number‐theoretic Radon transform
inferred← citeshttps://doi.org/10.1049/iet-spr.2013.0204openalex-snapshot
Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions
inferred← citeshttps://doi.org/10.1049/ip-cdt:20020429openalex-snapshot
Unified CORDIC-based chip to realise DFT∕DHT∕DCT∕DST
inferred← citeshttps://doi.org/10.1049/ip-e.1989.0035openalex-snapshot
Efficient realisation of discrete Fourier transforms using the recursive discrete Hartley transform
inferred← citeshttps://doi.org/10.1049/ip-f-2.1990.0031openalex-snapshot
Prime number DFT computation via parallel circular convolvers
inferred← citeshttps://doi.org/10.1049/ip-f-2.1993.0009openalex-snapshot
New high-speed prime-factor algorithm for discrete Hartley transform
inferred← citeshttps://doi.org/10.1049/ip-g-1.1983.0036openalex-snapshot
Very fast discrete Fourier transform using number theoretic transform
inferred← citeshttps://doi.org/10.1049/ip-g-1.1988.0036openalex-snapshot
Fast multidimensional discrete hartley transform using fermat number transform
inferred← citeshttps://doi.org/10.1049/ip-g-2.1990.0059openalex-snapshot
Computation of prime factor DFT and DHT/DCCT algorithms using cyclic and skew-cyclic bit-serial semisystolic IC convolvers
inferred← citeshttps://doi.org/10.1049/ip-g-2.1992.0084openalex-snapshot
On the design of VLSI arrays for discrete Fourier transform
inferred← citeshttps://doi.org/10.1049/ip-vis:19951689openalex-snapshot
Unusual-length number-theoretic transforms using recursive extensions of Rader's algorithm
inferred← citeshttps://doi.org/10.1051/itmconf/20171103001openalex-snapshot
Random Access Preamble Generation with Low Storage for LTE Networks
inferred← citeshttps://doi.org/10.1080/00206817509471546openalex-snapshot
Some possibilities involving computer-time saving in digital filtering of seismograms
inferred← citeshttps://doi.org/10.1080/00207167308803074openalex-snapshot
An algorithm for the on-line computation of fourier spectra
inferred← citeshttps://doi.org/10.1080/00207218008901156openalex-snapshot
Convolutional architectures for spectrum analysis employing CCD programmable transversal filters
inferred← citeshttps://doi.org/10.1080/00207219108921319openalex-snapshot
Realization of discrete Fourier transforms using a nesting algorithm
inferred← citeshttps://doi.org/10.1080/02533839.1992.9677447openalex-snapshot
A novel correlation‐based FFT algorithm
inferred← citeshttps://doi.org/10.1088/0143-0807/36/4/045018openalex-snapshot
The double pendulum: a numerical study
inferred← citeshttps://doi.org/10.1090/bull/1674openalex-snapshot
Book Review: Discrete harmonic analysis
inferred← citeshttps://doi.org/10.1090/cbms/071/03openalex-snapshot
Reproducing Kernel Hilbert Spaces
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01785-6openalex-snapshot
Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
inferred← citeshttps://doi.org/10.1090/s0025-5718-1977-0436662-8openalex-snapshot
Computational Complexity of Fourier Transforms Over Finite Fields
inferred← citeshttps://doi.org/10.1090/s0025-5718-1978-0468306-4openalex-snapshot
On computing the discrete Fourier transform
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
showing the first 200 of 487 · page through all 487
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.